%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS015-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 : Thu Sep 24 01:01:19 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 3 unt; 0 nHn; 42 RR)
% Number of literals : 98 ( 0 equ; 64 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_10,axiom,
( ~ t(X3,X2)
| ~ t(X3,X1)
| ~ t1most(X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_5,axiom,
( ~ t2least(X1)
| t(X1,u1r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,axiom,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,axiom,
( ~ t2least(X1)
| t(X1,u1r2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_2,axiom,
( ~ c(X1)
| t2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_15,axiom,
( ~ r(X1,X2)
| ~ e(X1)
| s(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_8,axiom,
( ~ d(X1)
| t1most(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_17,axiom,
( ~ s(X2,X1)
| ~ e(X2)
| d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_18,axiom,
( ~ r(X2,X1)
| ~ e(X2)
| c(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).
cnf(clause_14,axiom,
( ~ e(X1)
| r(X1,u4r4(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
cnf(c_0_11,plain,
( ~ t(X3,X2)
| ~ t(X3,X1)
| ~ t1most(X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_12,plain,
( ~ t2least(X1)
| t(X1,u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_13,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_14,plain,
( ~ t(X3,X2)
| ~ t(X3,X1)
| ~ t1most(X3)
| equalish(X1,X2) ),
c_0_11 ).
cnf(c_0_15,plain,
( ~ t2least(X1)
| t(X1,u1r1(X1)) ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ t2least(X1)
| t(X1,u1r2(X1)) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_17,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ t2least(X2)
| ~ t(X2,X1)
| ~ t1most(X2)
| equalish(X1,u1r1(X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ t2least(X1)
| t(X1,u1r2(X1)) ),
c_0_16 ).
cnf(c_0_20,plain,
( ~ c(X1)
| t2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_21,plain,
( ~ r(X1,X2)
| ~ e(X1)
| s(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_22,plain,
( ~ t2least(X1)
| ~ t1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( ~ c(X1)
| t2least(X1) ),
c_0_20 ).
cnf(c_0_24,plain,
( ~ d(X1)
| t1most(X1) ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_25,plain,
( ~ s(X2,X1)
| ~ e(X2)
| d(X1) ),
inference(fof_simplification,[status(thm)],[clause_17]) ).
cnf(c_0_26,plain,
( ~ r(X1,X2)
| ~ e(X1)
| s(X1,X2) ),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_28,plain,
( ~ c(X1)
| ~ t1most(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( ~ d(X1)
| t1most(X1) ),
c_0_24 ).
cnf(c_0_30,plain,
( ~ s(X2,X1)
| ~ e(X2)
| d(X1) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
( ~ r(exist,X1)
| s(exist,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ r(X2,X1)
| ~ e(X2)
| c(X1) ),
inference(fof_simplification,[status(thm)],[clause_18]) ).
cnf(c_0_33,plain,
( ~ e(X1)
| r(X1,u4r4(X1)) ),
inference(fof_simplification,[status(thm)],[clause_14]) ).
cnf(c_0_34,plain,
( ~ c(X1)
| ~ d(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( ~ r(exist,X1)
| d(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27])]) ).
cnf(c_0_36,plain,
( ~ r(X2,X1)
| ~ e(X2)
| c(X1) ),
c_0_32 ).
cnf(c_0_37,plain,
( ~ e(X1)
| r(X1,u4r4(X1)) ),
c_0_33 ).
cnf(c_0_38,negated_conjecture,
( ~ c(X1)
| ~ r(exist,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( ~ e(X1)
| c(u4r4(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ~ e(X1)
| ~ r(exist,u4r4(X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS015-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n004.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 22:50:34 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.42 % Version: 3.5.1
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % Starting sh5l with 300s (1) cores
% 0.12/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1662384 completed with status 0
% 0.12/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.42 % No SInE strategy applied
% 0.12/0.42 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.12/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.42 % Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.12/0.42 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.42 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.12/0.42 % SubtermCWHack with pid 1662388 completed with status 0
% 0.12/0.42 % Result found by SubtermCWHack
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.42 % No SInE strategy applied
% 0.12/0.42 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.12/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.42 % Preprocessing time : 0.001 s
% 0.12/0.42
% 0.12/0.42 % Proof found!
% 0.12/0.42 % SZS status Unsatisfiable
% 0.12/0.42 % SZS output start CNFRefutation
% See solution above
% 0.12/0.42 % Parsed axioms : 26
% 0.12/0.42 % Removed by relevancy pruning/SinE : 0
% 0.12/0.42 % Initial clauses : 26
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 26
% 0.12/0.42 % Processed clauses : 34
% 0.12/0.42 % ...of these trivial : 0
% 0.12/0.42 % ...subsumed : 1
% 0.12/0.42 % ...remaining for further processing : 33
% 0.12/0.42 % Other redundant clauses eliminated : 0
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 2
% 0.12/0.42 % Backward-rewritten : 0
% 0.12/0.42 % Generated clauses : 30
% 0.12/0.42 % ...of the previous two non-redundant : 19
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 2
% 0.12/0.42 % Paramodulations : 30
% 0.12/0.42 % Factorizations : 0
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 0
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 3
% 0.12/0.42 % ...of those cached : 2
% 0.12/0.42 % Propositional unsat checks : 0
% 0.12/0.42 % Propositional check models : 0
% 0.12/0.42 % Propositional check unsatisfiable : 0
% 0.12/0.42 % Propositional clauses : 0
% 0.12/0.42 % Propositional clauses after purity: 0
% 0.12/0.42 % Propositional unsat core size : 0
% 0.12/0.42 % Propositional preprocessing time : 0.000
% 0.12/0.42 % Propositional encoding time : 0.000
% 0.12/0.42 % Propositional solver time : 0.000
% 0.12/0.42 % Success case prop preproc time : 0.000
% 0.12/0.42 % Success case prop encoding time : 0.000
% 0.12/0.42 % Success case prop solver time : 0.000
% 0.12/0.42 % Current number of processed clauses : 31
% 0.12/0.42 % Positive orientable unit clauses : 1
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 0
% 0.12/0.42 % Non-unit-clauses : 30
% 0.12/0.42 % Current number of unprocessed clauses: 11
% 0.12/0.42 % ...number of literals in the above : 64
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 2
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 650
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 332
% 0.12/0.42 % Non-unit clause-clause subsumptions : 5
% 0.12/0.42 % Unit Clause-clause subsumption calls : 0
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 0
% 0.12/0.42 % BW rewrite match successes : 0
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 1528
% 0.12/0.42 % Search garbage collected termcells : 79
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.001 s
% 0.12/0.42 % System time : 0.005 s
% 0.12/0.42 % Total time : 0.006 s
% 0.12/0.42 % Maximum resident set size: 3652 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.013 s
% 0.12/0.42 % System time : 0.018 s
% 0.12/0.42 % Total time : 0.031 s
% 0.12/0.42 % Maximum resident set size: 4864 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------