%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS007-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 : n020.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.14s 1.85s
% Output : Saturation 1.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% 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_26,axiom,
( r2least(X1)
| equalish(X2,X3)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_26) ).
cnf(clause_16,axiom,
( r(X1,u4r3(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_18,axiom,
( r(X1,u4r2(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).
cnf(clause_19,axiom,
( r(X1,u4r1(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_8,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_13,axiom,
( s1most(X1)
| s(X1,u3r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_13) ).
cnf(clause_20,axiom,
( e(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ c(X3)
| ~ r(X1,X4)
| ~ d(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_25,axiom,
( r(X1,u6r2(X1))
| ~ r2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_25) ).
cnf(clause_24,axiom,
( r(X1,u6r1(X1))
| ~ r2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_24) ).
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_17,axiom,
( c(u4r2(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_22,axiom,
( f(X1)
| ~ r2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_14,axiom,
( s1most(X1)
| s(X1,u3r2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_12,axiom,
( s1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_10,axiom,
( d(X1)
| ~ s1most(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_9,axiom,
( s1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_15,axiom,
( d(u4r3(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_23,axiom,
( ~ r2least(X1)
| ~ equalish(u6r2(X1),u6r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_23) ).
cnf(clause_4,axiom,
( c(X1)
| ~ s2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_21,axiom,
( r2least(X1)
| ~ f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_21) ).
cnf(c_0_26,axiom,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
clause_11,
[final] ).
cnf(c_0_27,axiom,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
clause_6,
[final] ).
cnf(c_0_28,axiom,
( r2least(X1)
| equalish(X2,X3)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
clause_26,
[final] ).
cnf(c_0_29,axiom,
( r(X1,u4r3(X1))
| ~ e(X1) ),
clause_16,
[final] ).
cnf(c_0_30,axiom,
( r(X1,u4r2(X1))
| ~ e(X1) ),
clause_18,
[final] ).
cnf(c_0_31,axiom,
( r(X1,u4r1(X1))
| ~ e(X1) ),
clause_19,
[final] ).
cnf(c_0_32,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
clause_8,
[final] ).
cnf(c_0_33,axiom,
( s1most(X1)
| s(X1,u3r1(X1)) ),
clause_13,
[final] ).
cnf(c_0_34,axiom,
( e(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ c(X3)
| ~ r(X1,X4)
| ~ d(X4) ),
clause_20,
[final] ).
cnf(c_0_35,axiom,
( r(X1,u6r2(X1))
| ~ r2least(X1) ),
clause_25,
[final] ).
cnf(c_0_36,axiom,
( r(X1,u6r1(X1))
| ~ r2least(X1) ),
clause_24,
[final] ).
cnf(c_0_37,axiom,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
clause_5,
[final] ).
cnf(c_0_38,plain,
( equalish(X1,u1r1(X2))
| ~ s1most(X2)
| ~ s(X2,X1)
| ~ s2least(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_39,axiom,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
clause_7,
[final] ).
cnf(c_0_40,axiom,
( s2least(X1)
| ~ c(X1) ),
clause_3,
[final] ).
cnf(c_0_41,axiom,
( c(u4r2(X1))
| ~ e(X1) ),
clause_17,
[final] ).
cnf(c_0_42,plain,
( r2least(X1)
| equalish(X2,u4r3(X1))
| ~ r(X1,X2)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[final] ).
cnf(c_0_43,negated_conjecture,
~ f(exist),
clause_2,
[final] ).
cnf(c_0_44,axiom,
( f(X1)
| ~ r2least(X1) ),
clause_22,
[final] ).
cnf(c_0_45,plain,
( r2least(X1)
| equalish(X2,u4r2(X1))
| ~ r(X1,X2)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_30]),
[final] ).
cnf(c_0_46,plain,
( r2least(X1)
| equalish(X2,u4r1(X1))
| ~ r(X1,X2)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_31]),
[final] ).
cnf(c_0_47,plain,
( s1most(X1)
| equalish(X2,u3r1(X1))
| s2least(X1)
| ~ s(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_48,axiom,
( s1most(X1)
| s(X1,u3r2(X1)) ),
clause_14,
[final] ).
cnf(c_0_49,axiom,
( s1most(X1)
| ~ equalish(u3r2(X1),u3r1(X1)) ),
clause_12,
[final] ).
cnf(c_0_50,plain,
( e(X1)
| ~ r2least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ d(u6r2(X1))
| ~ c(X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_51,axiom,
( d(X1)
| ~ s1most(X1) ),
clause_10,
[final] ).
cnf(c_0_52,plain,
( e(X1)
| ~ r2least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ d(u6r1(X1))
| ~ c(X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_36]),
[final] ).
cnf(c_0_53,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_54,plain,
( s2least(u4r2(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]),
[final] ).
cnf(c_0_55,axiom,
( s1most(X1)
| ~ d(X1) ),
clause_9,
[final] ).
cnf(c_0_56,axiom,
( d(u4r3(X1))
| ~ e(X1) ),
clause_15,
[final] ).
cnf(c_0_57,plain,
( r2least(X1)
| equalish(u4r3(X1),u4r3(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_29]),
[final] ).
cnf(c_0_58,negated_conjecture,
e(exist),
clause_1,
[final] ).
cnf(c_0_59,negated_conjecture,
~ r2least(exist),
inference(spm,[status(thm)],[c_0_43,c_0_44]),
[final] ).
cnf(c_0_60,plain,
( r2least(X1)
| equalish(u4r2(X1),u4r3(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_30]),
[final] ).
cnf(c_0_61,plain,
( r2least(X1)
| equalish(u4r1(X1),u4r3(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_31]),
[final] ).
cnf(c_0_62,plain,
( r2least(X1)
| equalish(u4r3(X1),u4r2(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_29]),
[final] ).
cnf(c_0_63,plain,
( r2least(X1)
| equalish(u4r2(X1),u4r2(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_30]),
[final] ).
cnf(c_0_64,plain,
( r2least(X1)
| equalish(u4r1(X1),u4r2(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_31]),
[final] ).
cnf(c_0_65,plain,
( r2least(X1)
| equalish(u4r3(X1),u4r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_29]),
[final] ).
cnf(c_0_66,plain,
( r2least(X1)
| equalish(u4r2(X1),u4r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_30]),
[final] ).
cnf(c_0_67,plain,
( r2least(X1)
| equalish(u4r1(X1),u4r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_31]),
[final] ).
cnf(c_0_68,plain,
( s1most(X1)
| s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
[final] ).
cnf(c_0_69,plain,
( e(X1)
| ~ r2least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ s1most(u6r2(X1))
| ~ c(X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]),
[final] ).
cnf(c_0_70,plain,
( e(X1)
| ~ r2least(X1)
| ~ r(X1,X2)
| ~ r(X1,X3)
| ~ s1most(u6r1(X1))
| ~ c(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_51]),
[final] ).
cnf(c_0_71,plain,
( ~ s1most(u4r2(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]),
[final] ).
cnf(c_0_72,axiom,
( ~ r2least(X1)
| ~ equalish(u6r2(X1),u6r1(X1)) ),
clause_23,
[final] ).
cnf(c_0_73,plain,
( s1most(u4r3(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]),
[final] ).
cnf(c_0_74,axiom,
( c(X1)
| ~ s2least(X1) ),
clause_4,
[final] ).
cnf(c_0_75,axiom,
( r2least(X1)
| ~ f(X1) ),
clause_21,
[final] ).
cnf(c_0_76,negated_conjecture,
equalish(u4r3(exist),u4r3(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_77,negated_conjecture,
equalish(u4r2(exist),u4r3(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_78,negated_conjecture,
equalish(u4r1(exist),u4r3(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_79,negated_conjecture,
equalish(u4r3(exist),u4r2(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_80,negated_conjecture,
equalish(u4r2(exist),u4r2(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_81,negated_conjecture,
equalish(u4r1(exist),u4r2(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_82,negated_conjecture,
equalish(u4r3(exist),u4r1(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_83,negated_conjecture,
equalish(u4r2(exist),u4r1(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_84,negated_conjecture,
equalish(u4r1(exist),u4r1(exist)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_58]),c_0_59]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.19 % Problem : KRS007-1 : TPTP v9.2.1. Released v2.0.0.
% 0.02/0.19 % 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.12/0.44 % Computer : n020.cluster.edu
% 0.12/0.44 % Model : x86_64 x86_64
% 0.12/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.44 % Memory : 8042.1875MB
% 0.12/0.44 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.44 % CPULimit : 300
% 0.12/0.44 % WCLimit : 300
% 0.12/0.44 % DateTime : Mon May 4 20:34:20 EDT 2026
% 0.15/0.45 % CPUTime :
% 0.15/0.46 % start to proof: theBenchmark
% 1.14/1.85 % Version : CSE_E---1.7
% 1.14/1.85 % Problem : theBenchmark.p
% 1.14/1.85 % SZS status Satisfiable for theBenchmark.p
% 1.14/1.85 % SZS output start Saturation
% See solution above
% 1.14/1.85 % Total time : 1.382s
%------------------------------------------------------------------------------