%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN949+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 : n002.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:28 AM UTC 2026
% Result : Theorem 3.34s 12.34s
% Output : Refutation 3.34s
% 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 : 28 ( 0 equ; 0 cnn)
% Maximal formula atoms : 9 ( 7 avg)
% Number of connectives : 65 ( 2 ~; 0 |; 15 &; 39 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 11 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-2 aty)
% Number of variables : 24 ( 0 ^; 18 !; 6 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(s_decl,type,
s: $i > $o ).
thf(r_decl,type,
r: $i > $i > $o ).
thf(p_decl,type,
p: $i > $o ).
thf(q_decl,type,
q: $i > $i > $o ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ! [D: $i,E: $i] :
( ( E @ ( D @ r ) )
=> ( E @ ( D @ q ) ) )
& ! [D: $i] :
( ( D @ s )
=> ( D @ p ) )
& ( C @ ( B @ r ) )
& ( B @ s )
& ( A @ s ) )
=> ? [D: $i,E: $i] :
( ( E @ ( D @ q ) )
& ( D @ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ! [D: $i,E: $i] :
( ( E @ ( D @ r ) )
=> ( E @ ( D @ q ) ) )
& ! [D: $i] :
( ( D @ s )
=> ( D @ p ) )
& ( C @ ( B @ r ) )
& ( B @ s )
& ( A @ s ) )
=> ? [D: $i,E: $i] :
( ( E @ ( D @ q ) )
& ( D @ p ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ! [D: $i,E: $i] :
( ( E @ ( D @ r ) )
=> ( E @ ( D @ q ) ) )
& ! [D: $i] :
( ( D @ s )
=> ( D @ p ) )
& ( C @ ( B @ r ) )
& ( B @ s )
& ( A @ s ) )
=> ? [D: $i,E: $i] :
( ( E @ ( D @ q ) )
& ( D @ p ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(14,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN949+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.11 % 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.20/10.48 % Computer : n002.cluster.edu
% 0.20/10.48 % Model : x86_64 x86_64
% 0.20/10.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/10.48 % Memory : 8046.5625MB
% 0.20/10.48 % OS : Linux 6.8.0-71-generic
% 0.20/10.48 % CPULimit : 300
% 0.20/10.48 % WCLimit : 300
% 0.20/10.48 % DateTime : Sat Sep 26 18:54:16 UTC 2026
% 0.20/10.48 % CPUTime :
% 0.20/10.48 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
% 1.02/11.07 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.31/11.24 % [INFO] Parsing done (171ms).
% 1.31/11.26 % [INFO] Running in sequential loop mode.
% 1.93/11.67 % [INFO] eprover registered as external prover.
% 1.93/11.68 % [INFO] Scanning for conjecture ...
% 2.14/11.78 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.32/11.82 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.32/11.82 % [INFO] Problem is first-order (TPTP FOF).
% 2.32/11.82 % [INFO] Type checking passed.
% 2.32/11.83 % [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 ...
% 3.34/12.33 % External prover 'e' found a proof!
% 3.34/12.33 % [INFO] Killing All external provers ...
% 3.34/12.34 % Time passed: 1708ms (effective reasoning time: 1070ms)
% 3.34/12.34 % 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)>
% 3.34/12.34 % Axioms used in derivation (0):
% 3.34/12.34 % No. of inferences in proof: 4
% 3.34/12.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1708 ms resp. 1070 ms w/o parsing
% 3.34/12.37 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.34/12.37 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------