%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS006-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 : n024.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 : Satisfiable 1.11s 1.62s
% Output : Saturation 1.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_14,axiom,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_9,axiom,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_11,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_16,axiom,
( s1most(X1)
| s(X1,u3r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_8,axiom,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_10,axiom,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_6,axiom,
( s2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_20,axiom,
( c(u4r1(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_5,negated_conjecture,
c(u4r1(exist)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_17,axiom,
( s1most(X1)
| s(X1,u3r2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_15,axiom,
( s1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_24,axiom,
( equalish(X1,X2)
| ~ r1most(X3)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
cnf(clause_21,axiom,
( r(X1,u4r1(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_22,axiom,
( r1most(X1)
| ~ e(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_19,axiom,
( r(X1,u4r2(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_3,negated_conjecture,
r(exist,u4r1(exist)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_2,negated_conjecture,
r1most(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_12,axiom,
( s1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_18,axiom,
( d(u4r2(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).
cnf(clause_4,negated_conjecture,
d(u4r2(exist)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_23,axiom,
( e(X1)
| ~ r1most(X1)
| ~ r(X1,X2)
| ~ c(X2)
| ~ r(X1,X3)
| ~ d(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).
cnf(clause_26,axiom,
( r1most(X1)
| r(X1,u5r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_26) ).
cnf(clause_27,axiom,
( r1most(X1)
| r(X1,u5r2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_27) ).
cnf(clause_25,axiom,
( r1most(X1)
| ~ equalish(u5r2(X1),u5r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_25) ).
cnf(clause_7,axiom,
( c(X1)
| ~ s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_13,axiom,
( d(X1)
| ~ s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_13) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_27,axiom,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
clause_14,
[final] ).
cnf(c_0_28,axiom,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
clause_9,
[final] ).
cnf(c_0_29,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
clause_11,
[final] ).
cnf(c_0_30,axiom,
( s1most(X1)
| s(X1,u3r1(X1)) ),
clause_16,
[final] ).
cnf(c_0_31,axiom,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
clause_8,
[final] ).
cnf(c_0_32,plain,
( equalish(X1,u1r1(X2))
| ~ s1most(X2)
| ~ s(X2,X1)
| ~ s2least(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,axiom,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
clause_10,
[final] ).
cnf(c_0_34,axiom,
( s2least(X1)
| ~ c(X1) ),
clause_6,
[final] ).
cnf(c_0_35,axiom,
( c(u4r1(X1))
| ~ e(X1) ),
clause_20,
[final] ).
cnf(c_0_36,negated_conjecture,
c(u4r1(exist)),
clause_5,
[final] ).
cnf(c_0_37,plain,
( s1most(X1)
| equalish(X2,u3r1(X1))
| s2least(X1)
| ~ s(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,axiom,
( s1most(X1)
| s(X1,u3r2(X1)) ),
clause_17,
[final] ).
cnf(c_0_39,axiom,
( s1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
clause_15,
[final] ).
cnf(c_0_40,plain,
( ~ s1most(X1)
| ~ s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[final] ).
cnf(c_0_41,plain,
( s2least(u4r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_42,axiom,
( equalish(X1,X2)
| ~ r1most(X3)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
clause_24,
[final] ).
cnf(c_0_43,axiom,
( r(X1,u4r1(X1))
| ~ e(X1) ),
clause_21,
[final] ).
cnf(c_0_44,axiom,
( r1most(X1)
| ~ e(X1) ),
clause_22,
[final] ).
cnf(c_0_45,axiom,
( r(X1,u4r2(X1))
| ~ e(X1) ),
clause_19,
[final] ).
cnf(c_0_46,negated_conjecture,
r(exist,u4r1(exist)),
clause_3,
[final] ).
cnf(c_0_47,negated_conjecture,
r1most(exist),
clause_2,
[final] ).
cnf(c_0_48,axiom,
( s1most(X1)
| ~ d(X1) ),
clause_12,
[final] ).
cnf(c_0_49,axiom,
( d(u4r2(X1))
| ~ e(X1) ),
clause_18,
[final] ).
cnf(c_0_50,negated_conjecture,
s2least(u4r1(exist)),
inference(spm,[status(thm)],[c_0_34,c_0_36]),
[final] ).
cnf(c_0_51,negated_conjecture,
d(u4r2(exist)),
clause_4,
[final] ).
cnf(c_0_52,plain,
( s1most(X1)
| s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[final] ).
cnf(c_0_53,plain,
( ~ s1most(u4r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]),
[final] ).
cnf(c_0_54,axiom,
( e(X1)
| ~ r1most(X1)
| ~ r(X1,X2)
| ~ c(X2)
| ~ r(X1,X3)
| ~ d(X3) ),
clause_23,
[final] ).
cnf(c_0_55,plain,
( equalish(X1,u4r1(X2))
| ~ r(X2,X1)
| ~ e(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[final] ).
cnf(c_0_56,plain,
( equalish(X1,u4r2(X2))
| ~ r(X2,X1)
| ~ e(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_45]),c_0_44]),
[final] ).
cnf(c_0_57,negated_conjecture,
( equalish(X1,u4r1(exist))
| ~ r(exist,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_46]),c_0_47])]),
[final] ).
cnf(c_0_58,axiom,
( r1most(X1)
| r(X1,u5r1(X1)) ),
clause_26,
[final] ).
cnf(c_0_59,axiom,
( r1most(X1)
| r(X1,u5r2(X1)) ),
clause_27,
[final] ).
cnf(c_0_60,plain,
( s1most(u4r2(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]),
[final] ).
cnf(c_0_61,axiom,
( r1most(X1)
| ~ equalish(u5r2(X1),u5r1(X1)) ),
clause_25,
[final] ).
cnf(c_0_62,axiom,
( c(X1)
| ~ s2least(X1) ),
clause_7,
[final] ).
cnf(c_0_63,axiom,
( d(X1)
| ~ s1most(X1) ),
clause_13,
[final] ).
cnf(c_0_64,negated_conjecture,
~ s1most(u4r1(exist)),
inference(spm,[status(thm)],[c_0_40,c_0_50]),
[final] ).
cnf(c_0_65,negated_conjecture,
s1most(u4r2(exist)),
inference(spm,[status(thm)],[c_0_48,c_0_51]),
[final] ).
cnf(c_0_66,negated_conjecture,
e(exist),
clause_1,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : KRS006-1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.06 % 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.06/0.25 % Computer : n024.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Mon May 4 15:33:56 EDT 2026
% 0.06/0.25 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 1.11/1.62 % Version : CSE_E---1.7
% 1.11/1.62 % Problem : theBenchmark.p
% 1.11/1.62 % SZS status Satisfiable for theBenchmark.p
% 1.11/1.62 % SZS output start Saturation
% See solution above
% 1.11/1.62 % Total time : 1.363s
%------------------------------------------------------------------------------