%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL981+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n009.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:53:31 AM UTC 2026
% Result : Theorem 21.16s 5.76s
% Output : Refutation 21.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 95 ( 6 ~; 4 |; 0 &; 85 @)
% ( 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 : 4 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 0 ^; 23 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(is_a_theorem_decl,type,
is_a_theorem: $i > $o ).
thf(implies_decl,type,
implies: $i > $i > $i ).
thf(not_decl,type,
not: $i > $i ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ implies ) @ is_a_theorem ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
thf(7,plain,
! [A: $i,B: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ implies ) @ is_a_theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i,D: $i,E: $i] : ( B @ ( C @ implies ) @ ( E @ ( C @ implies ) @ implies ) @ ( B @ ( E @ implies ) @ ( D @ ( C @ not @ implies ) @ implies ) @ ( B @ not @ implies ) @ implies ) @ ( A @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4) ).
thf(9,plain,
! [A: $i,B: $i,C: $i,D: $i,E: $i] : ( B @ ( C @ implies ) @ ( E @ ( C @ implies ) @ implies ) @ ( B @ ( E @ implies ) @ ( D @ ( C @ not @ implies ) @ implies ) @ ( B @ not @ implies ) @ implies ) @ ( A @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(1232,plain,
$false,
inference(e,[status(thm)],[5,7,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL981+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.14/0.41 % Computer : n009.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Fri Sep 25 23:55:14 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.86/0.99 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.25/1.17 % [INFO] Parsing done (180ms).
% 1.25/1.19 % [INFO] Running in sequential loop mode.
% 2.01/1.60 % [INFO] eprover registered as external prover.
% 2.01/1.61 % [INFO] Scanning for conjecture ...
% 2.18/1.70 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.18/1.73 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.18/1.75 % [INFO] Problem is first-order (TPTP FOF).
% 2.18/1.75 % [INFO] Type checking passed.
% 2.18/1.76 % [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 ...
% 21.16/5.76 % External prover 'e' found a proof!
% 21.16/5.76 % [INFO] Killing All external provers ...
% 21.16/5.76 % Time passed: 5210ms (effective reasoning time: 4566ms)
% 21.16/5.76 % 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)>
% 21.16/5.76 % Axioms used in derivation (2): condensed_detachment, a4
% 21.16/5.76 % No. of inferences in proof: 8
% 21.16/5.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 5210 ms resp. 4566 ms w/o parsing
% 21.16/5.79 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 21.16/5.79 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------