%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL237-1 : TPTP v9.3.1. Bugfixed v2.3.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 : n007.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:51:18 AM UTC 2026
% Result : Unsatisfiable 5.09s 2.73s
% Output : Refutation 5.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 178 ( 12 ~; 10 |; 0 &; 156 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 ^; 34 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_decl,type,
theorem: $i > $o ).
thf(or_decl,type,
or: $i > $i > $i ).
thf(not_decl,type,
not: $i > $i ).
thf(q_decl,type,
q: $i ).
thf(p_decl,type,
p: $i ).
thf(axiom_decl,type,
axiom: $i > $o ).
thf(1,negated_conjecture,
~ ( q @ not @ ( p @ not @ or ) @ not @ ( p @ not @ or ) @ ( q @ not @ or ) @ theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(10,plain,
~ ( q @ not @ ( p @ not @ or ) @ not @ ( p @ not @ or ) @ ( q @ not @ or ) @ theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(4,axiom,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
thf(14,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(9,axiom,
! [C: $i,B: $i,A: $i] :
( ~ ( B @ ( C @ not @ or ) @ theorem )
| ~ ( C @ ( A @ not @ or ) @ axiom )
| ( B @ ( A @ not @ or ) @ theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
thf(21,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( B @ ( C @ not @ or ) @ theorem )
| ~ ( C @ ( A @ not @ or ) @ axiom )
| ( B @ ( A @ not @ or ) @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(3,axiom,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
thf(13,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,axiom,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
thf(17,plain,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(2,axiom,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
thf(12,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ not @ or ) @ ( B @ ( A @ not @ or ) @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ not @ or ) @ ( B @ ( A @ not @ or ) @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(8,axiom,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ not @ or ) @ axiom )
| ( A @ theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
thf(19,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ not @ or ) @ axiom )
| ( A @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
thf(15,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(135,plain,
$false,
inference(e,[status(thm)],[10,14,21,13,17,12,16,19,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL237-1 : TPTP v9.3.1. Bugfixed v2.3.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 : n007.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 22:03:23 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.85/0.97 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/1.16 % [INFO] Parsing done (186ms).
% 1.22/1.17 % [INFO] Running in sequential loop mode.
% 1.82/1.58 % [INFO] eprover registered as external prover.
% 1.82/1.58 % [INFO] Scanning for conjecture ...
% 2.01/1.67 % [INFO] Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ...
% 2.15/1.70 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 2.15/1.72 % [INFO] Problem is propositional (TPTP CNF).
% 2.15/1.72 % [INFO] Type checking passed.
% 2.15/1.73 % [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 ...
% 5.09/2.72 % External prover 'e' found a proof!
% 5.09/2.72 % [INFO] Killing All external provers ...
% 5.09/2.72 % Time passed: 2190ms (effective reasoning time: 1544ms)
% 5.09/2.72 % Axioms used in derivation (8): axiom_1_5, axiom_1_4, rule_1, axiom_1_3, rule_3, axiom_1_2, rule_2, axiom_1_6
% 5.09/2.72 % No. of inferences in proof: 19
% 5.09/2.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 2190 ms resp. 1544 ms w/o parsing
% 5.09/2.76 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.09/2.76 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------