%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS115+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:32 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.65s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 5 unt; 0 def)
% Number of atoms : 133 ( 13 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 150 ( 65 ~; 57 |; 18 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 83 ( 3 sgn 39 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_6,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X6,X7] :
( ( rf1(X4,X7)
& rf1(X4,X6) )
=> X6 = X7 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_10,axiom,
! [X4,X5] :
( rr(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( cowlThing(X5)
& rr(X4,X5) )
& ? [X5] :
( cp1(X5)
& rf1(X4,X5) )
& ? [X5] :
( cp2(X5)
& rf2(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_7,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X6,X7] :
( ( rf2(X4,X7)
& rf2(X4,X6) )
=> X6 = X7 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rr(X4,X5)
=> rf2(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_4,axiom,
! [X4] :
( cp2(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
! [X4] :
( cp2xcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> cp2xcomp(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_21_30578),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_10,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_11,plain,
! [X67,X68,X69] :
( X68 = X69
| ~ rf1(X67,X69)
| ~ rf1(X67,X68)
| ~ cowlThing(X67) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])])]) ).
fof(c_0_12,plain,
! [X48] :
( ~ cowlNothing(X48)
& cowlThing(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_13,plain,
! [X75,X76] :
( rf1(X75,X76)
| ~ rr(X75,X76) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])])]) ).
fof(c_0_14,plain,
! [X50,X54,X55,X56,X57] :
( ( cUnsatisfiable(X54)
| ~ cowlThing(X57)
| ~ rr(X54,X57)
| ~ cp1(X56)
| ~ rf1(X54,X56)
| ~ cp2(X55)
| ~ rf2(X54,X55) )
& ( ~ cUnsatisfiable(X50)
| cowlThing(esk3_1(X50)) )
& ( ~ cUnsatisfiable(X50)
| rr(X50,esk3_1(X50)) )
& ( ~ cUnsatisfiable(X50)
| cp1(esk2_1(X50)) )
& ( ~ cUnsatisfiable(X50)
| rf1(X50,esk2_1(X50)) )
& ( ~ cUnsatisfiable(X50)
| cp2(esk1_1(X50)) )
& ( ~ cUnsatisfiable(X50)
| rf2(X50,esk1_1(X50)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])])]) ).
fof(c_0_15,plain,
! [X70,X71,X72] :
( X71 = X72
| ~ rf2(X70,X72)
| ~ rf2(X70,X71)
| ~ cowlThing(X70) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])])]) ).
cnf(c_0_16,plain,
( ~ rf1(X1,X3)
| ~ rf1(X1,X2)
| ~ cowlThing(X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ rr(X1,X2)
| rf1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ rf2(X1,X3)
| ~ rf2(X1,X2)
| ~ cowlThing(X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X73,X74] :
( rf2(X73,X74)
| ~ rr(X73,X74) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])])]) ).
cnf(c_0_22,plain,
( ~ rf1(X1,X2)
| ~ rf1(X1,X3)
| X2 = X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_23,plain,
( ~ cUnsatisfiable(X1)
| rf1(X1,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ rf2(X1,X2)
| ~ rf2(X1,X3)
| X2 = X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_17])]) ).
cnf(c_0_25,plain,
( ~ cUnsatisfiable(X1)
| rf2(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( ~ rr(X1,X2)
| rf2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,plain,
! [X59,X60,X61] :
( ( cp2(X61)
| ra_Px1(X61,esk4_1(X61)) )
& ( ~ ra_Px1(X59,X60)
| ~ cp2(X59) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])])])]) ).
fof(c_0_28,plain,
! [X63,X65,X66] :
( ( cp2xcomp(X65)
| ~ ra_Px1(X65,X66) )
& ( ra_Px1(X63,esk5_1(X63))
| ~ cp2xcomp(X63) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])])])]) ).
fof(c_0_29,plain,
! [X58] :
( cp2xcomp(X58)
| ~ cp1(X58) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_30,plain,
( ~ cUnsatisfiable(X2)
| ~ rf1(X2,X1)
| X1 = esk3_1(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( ~ cUnsatisfiable(X1)
| rf1(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,plain,
( ~ cUnsatisfiable(X2)
| ~ rf2(X2,X1)
| X1 = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
( ~ cUnsatisfiable(X1)
| rf2(X1,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_34,plain,
( ~ ra_Px1(X1,X2)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( ~ cp2xcomp(X1)
| ra_Px1(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( ~ cp1(X1)
| cp2xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
( ~ cUnsatisfiable(X1)
| cp1(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_38,plain,
( ~ cUnsatisfiable(X1)
| esk3_1(X1) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( ~ cUnsatisfiable(X1)
| esk3_1(X1) = esk1_1(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( ~ cp2(X1)
| ~ cp2xcomp(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( ~ cUnsatisfiable(X1)
| cp2xcomp(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( ~ cUnsatisfiable(X1)
| cp2(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,plain,
( ~ cUnsatisfiable(X1)
| esk1_1(X1) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( ~ cUnsatisfiable(X1)
| ~ cp2(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
cUnsatisfiable(i2003_11_14_17_21_30578),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_46,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[c_0_45,c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS115+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.57 % Computer : n018.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Sun Sep 20 22:55:59 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.62 Running first-order theorem proving
% 0.10/0.62 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.14/0.65 % Version: 3.5.1
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65 % Starting sh5l with 300s (1) cores
% 0.14/0.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 377593 completed with status 0
% 0.14/0.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.65 % No SInE strategy applied
% 0.14/0.65 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.14/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.14/0.65 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.65 % new_bool_3 with pid 377611 completed with status 0
% 0.14/0.65 % Result found by new_bool_3
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.65 % No SInE strategy applied
% 0.14/0.65 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.14/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.14/0.65 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.65 % Preprocessing time : 0.001 s
% 0.14/0.65 % Presaturation interreduction done
% 0.14/0.65
% 0.14/0.65 % Proof found!
% 0.14/0.65 % SZS status Unsatisfiable
% 0.14/0.65 % SZS output start CNFRefutation
% See solution above
% 0.14/0.65 % Parsed axioms : 27
% 0.14/0.65 % Removed by relevancy pruning/SinE : 0
% 0.14/0.65 % Initial clauses : 37
% 0.14/0.65 % Removed in clause preprocessing : 18
% 0.14/0.65 % Initial clauses in saturation : 19
% 0.14/0.65 % Processed clauses : 53
% 0.14/0.65 % ...of these trivial : 0
% 0.14/0.65 % ...subsumed : 1
% 0.14/0.65 % ...remaining for further processing : 52
% 0.14/0.65 % Other redundant clauses eliminated : 0
% 0.14/0.65 % Clauses deleted for lack of memory : 0
% 0.14/0.65 % Backward-subsumed : 16
% 0.14/0.65 % Backward-rewritten : 0
% 0.14/0.65 % Generated clauses : 31
% 0.14/0.65 % ...of the previous two non-redundant : 24
% 0.14/0.65 % ...aggressively subsumed : 0
% 0.14/0.65 % Contextual simplify-reflections : 1
% 0.14/0.65 % Paramodulations : 30
% 0.14/0.65 % Factorizations : 0
% 0.14/0.65 % NegExts : 0
% 0.14/0.65 % Equation resolutions : 0
% 0.14/0.65 % Disequality decompositions : 0
% 0.14/0.65 % Total rewrite steps : 0
% 0.14/0.65 % ...of those cached : 0
% 0.14/0.65 % Propositional unsat checks : 0
% 0.14/0.65 % Propositional check models : 0
% 0.14/0.65 % Propositional check unsatisfiable : 0
% 0.14/0.65 % Propositional clauses : 0
% 0.14/0.65 % Propositional clauses after purity: 0
% 0.14/0.65 % Propositional unsat core size : 0
% 0.14/0.65 % Propositional preprocessing time : 0.000
% 0.14/0.65 % Propositional encoding time : 0.000
% 0.14/0.65 % Propositional solver time : 0.000
% 0.14/0.65 % Success case prop preproc time : 0.000
% 0.14/0.65 % Success case prop encoding time : 0.000
% 0.14/0.65 % Success case prop solver time : 0.000
% 0.14/0.65 % Current number of processed clauses : 16
% 0.14/0.65 % Positive orientable unit clauses : 0
% 0.14/0.65 % Positive unorientable unit clauses: 0
% 0.14/0.65 % Negative unit clauses : 2
% 0.14/0.65 % Non-unit-clauses : 14
% 0.14/0.65 % Current number of unprocessed clauses: 9
% 0.14/0.65 % ...number of literals in the above : 19
% 0.14/0.65 % Current number of archived formulas : 0
% 0.14/0.65 % Current number of archived clauses : 37
% 0.14/0.65 % Clause-clause subsumption calls (NU) : 246
% 0.14/0.65 % Rec. Clause-clause subsumption calls : 161
% 0.14/0.65 % Non-unit clause-clause subsumptions : 2
% 0.14/0.65 % Unit Clause-clause subsumption calls : 16
% 0.14/0.65 % Rewrite failures with RHS unbound : 0
% 0.14/0.65 % BW rewrite match attempts : 0
% 0.14/0.65 % BW rewrite match successes : 0
% 0.14/0.65 % Condensation attempts : 0
% 0.14/0.65 % Condensation successes : 0
% 0.14/0.65 % Termbank termtop insertions : 2934
% 0.14/0.65 % Search garbage collected termcells : 614
% 0.14/0.65
% 0.14/0.65 % -------------------------------------------------
% 0.14/0.65 % User time : 0.006 s
% 0.14/0.65 % System time : 0.004 s
% 0.14/0.65 % Total time : 0.010 s
% 0.14/0.65 % Maximum resident set size: 3608 pages
% 0.14/0.65
% 0.14/0.65 % -------------------------------------------------
% 0.14/0.65 % User time : 0.015 s
% 0.14/0.65 % System time : 0.017 s
% 0.14/0.65 % Total time : 0.032 s
% 0.14/0.65 % Maximum resident set size: 4608 pages
% 0.14/0.65 % E exiting
%------------------------------------------------------------------------------