%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL662+1.001 : TPTP v9.3.1. Released v4.0.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 : n014.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 07:52:24 AM UTC 2026
% Result : Theorem 3.36s 2.57s
% Output : Refutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 6 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 2 |; 0 &; 4 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 2 ( 0 ^; 0 !; 2 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
thf(p1_decl,type,
p1: $i > $o ).
thf(1,conjecture,
~ ? [A: $i] :
~ ( ( A @ p1 )
| ~ ( A @ p1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
thf(2,negated_conjecture,
~ ~ ? [A: $i] :
~ ( ( A @ p1 )
| ~ ( A @ p1 ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
$false,
inference(simp,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL662+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.12 % 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.21/0.47 % Computer : n014.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.48 % CPULimit : 300
% 0.21/0.48 % WCLimit : 300
% 0.21/0.48 % DateTime : Fri Sep 25 23:05:47 UTC 2026
% 0.21/0.48 % CPUTime :
% 0.21/0.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.40/1.32 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.74/1.57 % [INFO] Parsing done (243ms).
% 1.74/1.59 % [INFO] Running in sequential loop mode.
% 2.81/2.18 % [INFO] eprover registered as external prover.
% 2.81/2.19 % [INFO] Scanning for conjecture ...
% 2.89/2.30 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 3.03/2.34 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 3.03/2.34 % [INFO] Problem is first-order (TPTP FOF).
% 3.03/2.35 % [INFO] Type checking passed.
% 3.03/2.36 % [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.36/2.57 % [INFO] Killing All external provers ...
% 3.36/2.57 % Time passed: 1887ms (effective reasoning time: 971ms)
% 3.36/2.57 % 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.36/2.57 % Axioms used in derivation (0):
% 3.36/2.57 % No. of inferences in proof: 4
% 3.36/2.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1887 ms resp. 971 ms w/o parsing
% 3.54/2.63 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.54/2.63 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------