%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS013-1 : TPTP v9.2.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n021.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:09 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.71s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 43 ( 5 unt; 14 nHn; 36 RR)
% Number of literals : 106 ( 0 equ; 53 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_11,axiom,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_6,axiom,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_16,axiom,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1)
| ~ s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_29,axiom,
( f(X1)
| r(X1,u6r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_29) ).
cnf(clause_15,axiom,
( d(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_5,axiom,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_7,axiom,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_3,axiom,
( t2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_9,axiom,
( t1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_26,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_26) ).
cnf(clause_32,axiom,
( s1most(X1)
| s(X1,u7r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_32) ).
cnf(clause_31,axiom,
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).
cnf(clause_33,axiom,
( s1most(X1)
| s(X1,u7r2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_33) ).
cnf(clause_28,axiom,
( f(X1)
| ~ s1most(u6r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_28) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_16,axiom,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
clause_11 ).
cnf(c_0_17,axiom,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
clause_6 ).
cnf(c_0_18,axiom,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1)
| ~ s2least(X1) ),
clause_16 ).
cnf(c_0_19,axiom,
( f(X1)
| r(X1,u6r1(X1)) ),
clause_29 ).
cnf(c_0_20,axiom,
( d(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
clause_15 ).
cnf(c_0_21,axiom,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
clause_5 ).
cnf(c_0_22,plain,
( equalish(X1,u1r1(X2))
| ~ t1most(X2)
| ~ t(X2,X1)
| ~ t2least(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,axiom,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
clause_7 ).
cnf(c_0_24,axiom,
( t2least(X1)
| ~ c(X1) ),
clause_3 ).
cnf(c_0_25,plain,
( c(u6r1(X1))
| f(X1)
| ~ s2least(u6r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,axiom,
( t1most(X1)
| ~ d(X1) ),
clause_9 ).
cnf(c_0_27,plain,
( d(u6r1(X1))
| f(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
clause_26 ).
cnf(c_0_29,axiom,
( s1most(X1)
| s(X1,u7r1(X1)) ),
clause_32 ).
cnf(c_0_30,plain,
( ~ t1most(X1)
| ~ t2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_31,plain,
( t2least(u6r1(X1))
| f(X1)
| ~ s2least(u6r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( t1most(u6r1(X1))
| f(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,axiom,
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ),
clause_31 ).
cnf(c_0_34,plain,
( s1most(X1)
| s2least(X1)
| equalish(X2,u7r1(X1))
| ~ s(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,axiom,
( s1most(X1)
| s(X1,u7r2(X1)) ),
clause_33 ).
cnf(c_0_36,plain,
( f(X1)
| ~ s2least(u6r1(X1))
| ~ e(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_37,plain,
( s1most(X1)
| s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,axiom,
( f(X1)
| ~ s1most(u6r1(X1)) ),
clause_28 ).
cnf(c_0_39,negated_conjecture,
~ f(exist),
clause_2 ).
cnf(c_0_40,plain,
( f(X1)
| ~ e(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS013-1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.32 % Computer : n021.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon May 4 20:35:55 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.371s
%------------------------------------------------------------------------------