## TSTP Solution File: SYN969+1 by Leo-III---1.7.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : Leo-III---1.7.0
% Problem  : SYN969+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 29 22:50:21 EDT 2022

% Result   : Theorem 2.46s 1.48s
% Output   : Refutation 2.70s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :    7 (   1 unt;   3 typ;   0 def)
%            Number of atoms       :   19 (   0 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :   35 (   2   ~;   0   |;   3   &;  18   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :    9 (   0   ^   9   !;   0   ?;   9   :)

%------------------------------------------------------------------------------
thf(p_type,type,
p: \$i > \$o ).

thf(q_type,type,
q: \$i > \$o ).

thf(r_type,type,
r: \$i > \$o ).

thf(1,conjecture,
! [A: \$i] :
( ( ! [B: \$i] :
( ( p @ B )
=> ( q @ B ) )
& ( r @ A ) )
=> ( ! [B: \$i] :
( ( r @ B )
=> ( p @ B ) )
=> ( q @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

thf(2,negated_conjecture,
~ ! [A: \$i] :
( ( ! [B: \$i] :
( ( p @ B )
=> ( q @ B ) )
& ( r @ A ) )
=> ( ! [B: \$i] :
( ( r @ B )
=> ( p @ B ) )
=> ( q @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
~ ! [A: \$i] :
( ( ! [B: \$i] :
( ( p @ B )
=> ( q @ B ) )
& ( r @ A ) )
=> ( ! [B: \$i] :
( ( r @ B )
=> ( p @ B ) )
=> ( q @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(11,plain,
\$false,
inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN969+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n021.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Mon Sep  5 09:41:46 EDT 2022
% 0.16/0.36  % CPUTime  :
% 0.88/0.84  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.95  % [INFO] 	 Parsing done (103ms).
% 1.19/0.95  % [INFO] 	 Running in sequential loop mode.
% 1.48/1.14  % [INFO] 	 eprover registered as external prover.
% 1.48/1.14  % [INFO] 	 cvc4 registered as external prover.
% 1.48/1.14  % [INFO] 	 Scanning for conjecture ...
% 1.73/1.19  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ...
% 1.76/1.20  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.76/1.20  % [INFO] 	 Problem is first-order (TPTP FOF).
% 1.76/1.21  % [INFO] 	 Type checking passed.
% 1.76/1.21  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ...
% 2.46/1.48  % External prover 'e' found a proof!
% 2.46/1.48  % [INFO] 	 Killing All external provers ...
% 2.46/1.48  % Time passed: 971ms (effective reasoning time: 520ms)
% 2.46/1.48  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.46/1.48  % Axioms used in derivation (0):
% 2.46/1.48  % No. of inferences in proof: 4
% 2.46/1.48  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 971 ms resp. 520 ms w/o parsing
% 2.70/1.53  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.70/1.53  % [INFO] 	 Killing All external provers ...
%------------------------------------------------------------------------------
```