%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : KRS003-1 : TPTP v9.3.1. Released v2.0.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 : 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:44:29 AM UTC 2026
% Result : Unsatisfiable 3.40s 2.31s
% Output : Refutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 16
% Syntax : Number of formulae : 33 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 69 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 176 ( 32 ~; 36 |; 0 &; 108 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 13 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 ^; 36 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(e_decl,type,
e: $i > $o ).
thf(exist_decl,type,
exist: $i ).
thf(f_decl,type,
f: $i > $o ).
thf(s2least_decl,type,
s2least: $i > $o ).
thf(c_decl,type,
c: $i > $o ).
thf(equalish_decl,type,
equalish: $i > $i > $o ).
thf(u1r2_decl,type,
u1r2: $i > $i ).
thf(u1r1_decl,type,
u1r1: $i > $i ).
thf(s_decl,type,
s: $i > $i > $o ).
thf(s1most_decl,type,
s1most: $i > $o ).
thf(d_decl,type,
d: $i > $o ).
thf(u3r2_decl,type,
u3r2: $i > $i ).
thf(u3r1_decl,type,
u3r1: $i > $i ).
thf(8,axiom,
! [C: $i,B: $i,A: $i] :
( ~ ( C @ ( A @ s ) )
| ~ ( B @ ( A @ s ) )
| ( C @ ( B @ equalish ) )
| ( A @ s2least ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
thf(29,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( C @ ( A @ s ) )
| ~ ( B @ ( A @ s ) )
| ( C @ ( B @ equalish ) )
| ( A @ s2least ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(14,axiom,
! [A: $i] :
( ( A @ u3r2 @ ( A @ s ) )
| ( A @ s1most ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).
thf(41,plain,
! [A: $i] :
( ( A @ u3r2 @ ( A @ s ) )
| ( A @ s1most ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(7,axiom,
! [A: $i] :
( ~ ( A @ s2least )
| ( A @ u1r2 @ ( A @ s ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
thf(27,plain,
! [A: $i] :
( ~ ( A @ s2least )
| ( A @ u1r2 @ ( A @ s ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(13,axiom,
! [A: $i] :
( ( A @ u3r1 @ ( A @ s ) )
| ( A @ s1most ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_13) ).
thf(39,plain,
! [A: $i] :
( ( A @ u3r1 @ ( A @ s ) )
| ( A @ s1most ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(11,axiom,
! [C: $i,B: $i,A: $i] :
( ~ ( B @ ( C @ s ) )
| ~ ( A @ ( C @ s ) )
| ~ ( C @ s1most )
| ( B @ ( A @ equalish ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
thf(35,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( B @ ( C @ s ) )
| ~ ( A @ ( C @ s ) )
| ~ ( C @ s1most )
| ( B @ ( A @ equalish ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(2,negated_conjecture,
exist @ f,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
thf(18,plain,
exist @ f,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,axiom,
! [A: $i] :
( ~ ( A @ d )
| ( A @ s1most ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
thf(31,plain,
! [A: $i] :
( ~ ( A @ d )
| ( A @ s1most ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(15,axiom,
! [A: $i] :
( ~ ( A @ e )
| ( A @ c ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
thf(43,plain,
! [A: $i] :
( ~ ( A @ e )
| ( A @ c ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(5,axiom,
! [A: $i] :
( ~ ( A @ u1r1 @ ( A @ u1r2 @ equalish ) )
| ~ ( A @ s2least ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
thf(23,plain,
! [A: $i] :
( ~ ( A @ u1r1 @ ( A @ u1r2 @ equalish ) )
| ~ ( A @ s2least ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(3,axiom,
! [A: $i] :
( ~ ( A @ c )
| ( A @ s2least ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
thf(19,plain,
! [A: $i] :
( ~ ( A @ c )
| ( A @ s2least ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(12,axiom,
! [A: $i] :
( ~ ( A @ u3r1 @ ( A @ u3r2 @ equalish ) )
| ( A @ s1most ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).
thf(37,plain,
! [A: $i] :
( ~ ( A @ u3r1 @ ( A @ u3r2 @ equalish ) )
| ( A @ s1most ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(6,axiom,
! [A: $i] :
( ~ ( A @ s2least )
| ( A @ u1r1 @ ( A @ s ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
thf(25,plain,
! [A: $i] :
( ~ ( A @ s2least )
| ( A @ u1r1 @ ( A @ s ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [A: $i] :
( ~ ( A @ s2least )
| ( A @ c ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
thf(21,plain,
! [A: $i] :
( ~ ( A @ s2least )
| ( A @ c ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(10,axiom,
! [A: $i] :
( ~ ( A @ s1most )
| ( A @ d ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
thf(33,plain,
! [A: $i] :
( ~ ( A @ s1most )
| ( A @ d ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(16,axiom,
! [A: $i] :
( ~ ( A @ f )
| ( A @ d ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
thf(45,plain,
! [A: $i] :
( ~ ( A @ f )
| ( A @ d ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(1,negated_conjecture,
exist @ e,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
thf(17,plain,
exist @ e,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(47,plain,
$false,
inference(e,[status(thm)],[29,41,27,39,35,18,31,43,23,19,37,25,21,33,45,17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS003-1 : TPTP v9.3.1. Released v2.0.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.12/0.40 % Computer : n007.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Fri Sep 25 19:30:09 UTC 2026
% 0.12/0.41 % CPUTime :
% 0.12/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.85/0.98 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/1.18 % [INFO] Parsing done (192ms).
% 1.21/1.19 % [INFO] Running in sequential loop mode.
% 1.89/1.62 % [INFO] eprover registered as external prover.
% 1.89/1.63 % [INFO] Scanning for conjecture ...
% 2.05/1.71 % [INFO] Found a conjecture (or negated_conjecture) and 14 axioms. Running axiom selection ...
% 2.05/1.74 % [INFO] Axiom selection finished. Selected 14 axioms (removed 0 axioms).
% 2.05/1.76 % [INFO] Problem is propositional (TPTP CNF).
% 2.05/1.77 % [INFO] Type checking passed.
% 2.05/1.77 % [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.40/2.31 % External prover 'e' found a proof!
% 3.40/2.31 % [INFO] Killing All external provers ...
% 3.40/2.31 % Time passed: 1767ms (effective reasoning time: 1110ms)
% 3.40/2.31 % Axioms used in derivation (14): clause_5, clause_16, clause_9, clause_14, clause_4, clause_13, clause_6, clause_12, clause_8, clause_15, clause_7, clause_10, clause_11, clause_3
% 3.40/2.31 % No. of inferences in proof: 33
% 3.40/2.31 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1767 ms resp. 1110 ms w/o parsing
% 3.40/2.36 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.40/2.36 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------