%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL003-1 : TPTP v9.3.1. Released v1.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 : n019.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:50:33 AM UTC 2026
% Result : Unsatisfiable 40.50s 9.56s
% Output : Refutation 37.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of formulae : 7 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 86 ( 6 ~; 4 |; 0 &; 76 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(is_a_theorem_decl,type,
is_a_theorem: $i > $o ).
thf(or_decl,type,
or: $i > $i > $i ).
thf(not_decl,type,
not: $i > $i ).
thf(a_decl,type,
a: $i ).
thf(b_decl,type,
b: $i ).
thf(1,negated_conjecture,
~ ( a @ ( b @ or ) @ ( b @ ( a @ or ) @ not @ or ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_2) ).
thf(4,plain,
~ ( a @ ( b @ or ) @ ( b @ ( a @ or ) @ not @ or ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ not @ or ) @ is_a_theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
thf(6,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ not @ or ) @ is_a_theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( E @ or ) @ ( C @ or ) @ ( A @ ( D @ not @ or ) @ not @ or ) @ ( E @ ( D @ or ) @ ( C @ or ) @ ( B @ ( A @ not @ or ) @ not @ or ) @ not @ or ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_CAMeredith) ).
thf(8,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( E @ or ) @ ( C @ or ) @ ( A @ ( D @ not @ or ) @ not @ or ) @ ( E @ ( D @ or ) @ ( C @ or ) @ ( B @ ( A @ not @ or ) @ not @ or ) @ not @ or ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(2159,plain,
$false,
inference(e,[status(thm)],[4,6,8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % 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 : n019.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 : Fri Sep 25 21:43:06 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
% 1.29/1.20 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.52/1.39 % [INFO] Parsing done (182ms).
% 1.71/1.41 % [INFO] Running in sequential loop mode.
% 2.41/2.03 % [INFO] eprover registered as external prover.
% 2.67/2.04 % [INFO] Scanning for conjecture ...
% 2.84/2.17 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.93/2.22 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.93/2.23 % [INFO] Problem is propositional (TPTP CNF).
% 2.93/2.24 % [INFO] Type checking passed.
% 2.93/2.24 % [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 ...
% 40.50/9.55 % External prover 'e' found a proof!
% 40.50/9.56 % [INFO] Killing All external provers ...
% 40.50/9.56 % Time passed: 8956ms (effective reasoning time: 8143ms)
% 40.50/9.56 % Axioms used in derivation (2): condensed_detachment, an_CAMeredith
% 40.50/9.56 % No. of inferences in proof: 7
% 40.50/9.56 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 8956 ms resp. 8143 ms w/o parsing
% 37.23/9.60 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 37.23/9.60 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------