%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS003-1 : TPTP v9.2.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:36:08 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 9 unt; 0 nHn; 27 RR)
% Number of literals : 51 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_11,axiom,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_6,axiom,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_15,axiom,
( c(X1)
| ~ e(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_16,axiom,
( d(X1)
| ~ f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_2,negated_conjecture,
f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_5,axiom,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_7,axiom,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_3,axiom,
( s2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_9,axiom,
( s1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(c_0_10,axiom,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
clause_11 ).
cnf(c_0_11,axiom,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
clause_6 ).
cnf(c_0_12,axiom,
( c(X1)
| ~ e(X1) ),
clause_15 ).
cnf(c_0_13,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_14,axiom,
( d(X1)
| ~ f(X1) ),
clause_16 ).
cnf(c_0_15,negated_conjecture,
f(exist),
clause_2 ).
cnf(c_0_16,axiom,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
clause_5 ).
cnf(c_0_17,plain,
( equalish(X1,u1r1(X2))
| ~ s1most(X2)
| ~ s(X2,X1)
| ~ s2least(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,axiom,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
clause_7 ).
cnf(c_0_19,axiom,
( s2least(X1)
| ~ c(X1) ),
clause_3 ).
cnf(c_0_20,negated_conjecture,
c(exist),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,axiom,
( s1most(X1)
| ~ d(X1) ),
clause_9 ).
cnf(c_0_22,negated_conjecture,
d(exist),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( ~ s1most(X1)
| ~ s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
s2least(exist),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
s1most(exist),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS003-1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n031.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 20:36:08 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.368s
%------------------------------------------------------------------------------