%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN939+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 09:20:26 AM UTC 2026
% Result : Theorem 4.26s 2.66s
% Output : Refutation 4.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 47 ( 2 ~; 0 |; 9 &; 27 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 15 ( 0 ^; 9 !; 6 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(q_decl,type,
q: $i > $o ).
thf(f_decl,type,
f: $i > $i ).
thf(p_decl,type,
p: $i > $o ).
thf(r_decl,type,
r: $i > $o ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ! [C: $i] : ( C @ f @ q )
=> ? [C: $i,D: $i] :
( ( C @ q )
& ( ( D @ r )
=> ( ( A @ r )
& ( B @ r ) ) )
& ( ( D @ f @ p )
=> ( C @ p ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ! [C: $i] : ( C @ f @ q )
=> ? [C: $i,D: $i] :
( ( C @ q )
& ( ( D @ r )
=> ( ( A @ r )
& ( B @ r ) ) )
& ( ( D @ f @ p )
=> ( C @ p ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i,B: $i] :
( ! [C: $i] : ( C @ f @ q )
=> ? [C: $i,D: $i] :
( ( C @ q )
& ( ( D @ r )
=> ( ( A @ r )
& ( B @ r ) ) )
& ( ( D @ f @ p )
=> ( C @ p ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(15,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN939+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.13/0.38 % Computer : n001.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sat Sep 26 18:56:58 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.94/1.01 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.41/1.19 % [INFO] Parsing done (183ms).
% 1.50/1.21 % [INFO] Running in sequential loop mode.
% 2.12/1.66 % [INFO] eprover registered as external prover.
% 2.12/1.67 % [INFO] Scanning for conjecture ...
% 2.48/1.81 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.48/1.86 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.48/1.86 % [INFO] Problem is first-order (TPTP FOF).
% 2.48/1.87 % [INFO] Type checking passed.
% 2.48/1.88 % [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 ...
% 4.26/2.65 % External prover 'e' found a proof!
% 4.26/2.66 % [INFO] Killing All external provers ...
% 4.26/2.66 % Time passed: 2115ms (effective reasoning time: 1441ms)
% 4.26/2.66 % 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)>
% 4.26/2.66 % Axioms used in derivation (0):
% 4.26/2.66 % No. of inferences in proof: 4
% 4.26/2.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2115 ms resp. 1441 ms w/o parsing
% 4.54/2.71 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.54/2.71 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------