%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN952+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 : n003.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.06s 2.19s
% Output : Refutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 13 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 6 ~; 0 |; 1 &; 11 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 1 usr; 2 con; 0-1 aty)
% Number of variables : 11 ( 0 ^; 8 !; 3 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(p_decl,type,
p: $i > $o ).
thf(1,conjecture,
( ! [A: $i] : ( A @ p )
=> ? [A: $i] : ( A @ p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
~ ( ! [A: $i] : ( A @ p )
=> ? [A: $i] : ( A @ p ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i] : ( A @ p )
=> ? [A: $i] : ( A @ p ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [B: $i,A: $i] :
( ~ ( B @ p )
& ( A @ p ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
! [A: $i] :
~ ( A @ p ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
! [A: $i] :
~ ( A @ p ),
inference(simp,[status(thm)],[6]) ).
thf(5,plain,
! [A: $i] : ( A @ p ),
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
~ $true,
inference(rewrite,[status(thm)],[7,5]) ).
thf(9,plain,
$false,
inference(simp,[status(thm)],[8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN952+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % 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.12/0.39 % Computer : n003.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sat Sep 26 18:53:24 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 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.88/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.28/1.16 % [INFO] Parsing done (172ms).
% 1.28/1.17 % [INFO] Running in sequential loop mode.
% 1.82/1.58 % [INFO] eprover registered as external prover.
% 1.82/1.59 % [INFO] Scanning for conjecture ...
% 2.00/1.67 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.18/1.70 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.18/1.70 % [INFO] Problem is first-order (TPTP FOF).
% 2.18/1.71 % [INFO] Type checking passed.
% 2.18/1.71 % [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.06/2.18 % [INFO] Killing All external provers ...
% 3.06/2.18 % Time passed: 1646ms (effective reasoning time: 1003ms)
% 3.06/2.18 % 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.06/2.18 % Axioms used in derivation (0):
% 3.06/2.18 % No. of inferences in proof: 9
% 3.06/2.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1646 ms resp. 1003 ms w/o parsing
% 3.32/2.22 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.32/2.22 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------