%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS112+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 : n017.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:00:47 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 4 unt; 0 def)
% Number of atoms : 145 ( 12 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 165 ( 70 ~; 65 |; 19 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 92 ( 2 sgn 46 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_7,axiom,
! [X4,X5,X7] :
( ( rf(X4,X7)
& rf(X4,X5) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( cp(X5)
& rf(X4,X5) )
& ? [X5] :
( ca_Ax2(X5)
& rf1(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X4] :
( ca_Ax2(X4)
<=> ( ! [X5] :
( rinvF1(X4,X5)
=> ca_Vx3(X5) )
& cpxcomp(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_10,axiom,
! [X4,X5] :
( rinvF1(X4,X5)
<=> rf1(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_14,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
fof(axiom_3,axiom,
! [X4] :
( cp(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cpxcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_8,axiom,
! [X4,X5,X7] :
( ( rf1(X4,X7)
& rf1(X4,X5) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_6,axiom,
! [X4] :
( ca_Vx3(X4)
<=> ? [X5] :
( cowlThing(X5)
& rs(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_15,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_15) ).
fof(axiom_13,axiom,
cUnsatisfiable(i2003_11_14_17_21_19256),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(c_0_11,plain,
! [X92,X93,X94] :
( X93 = X94
| ~ rf(X92,X94)
| ~ rf(X92,X93) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
fof(c_0_12,plain,
! [X70,X73,X74,X75] :
( ( cUnsatisfiable(X73)
| ~ cp(X75)
| ~ rf(X73,X75)
| ~ ca_Ax2(X74)
| ~ rf1(X73,X74) )
& ( ~ cUnsatisfiable(X70)
| cp(esk2_1(X70)) )
& ( ~ cUnsatisfiable(X70)
| rf(X70,esk2_1(X70)) )
& ( ~ cUnsatisfiable(X70)
| ca_Ax2(esk1_1(X70)) )
& ( ~ cUnsatisfiable(X70)
| rf1(X70,esk1_1(X70)) ) ),
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_13,plain,
! [X84,X85,X86] :
( ( ca_Ax2(X86)
| ~ cpxcomp(X86)
| ~ ca_Vx3(esk5_1(X86)) )
& ( ca_Ax2(X86)
| ~ cpxcomp(X86)
| rinvF1(X86,esk5_1(X86)) )
& ( ~ ca_Ax2(X84)
| ca_Vx3(X85)
| ~ rinvF1(X84,X85) )
& ( ~ ca_Ax2(X84)
| cpxcomp(X84) ) ),
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_5])])])])])])]) ).
fof(c_0_14,plain,
! [X100,X101] :
( ( rinvF1(X100,X101)
| ~ rf1(X101,X100) )
& ( rf1(X101,X100)
| ~ rinvF1(X100,X101) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])])]) ).
cnf(c_0_15,plain,
( ~ rf(X1,X3)
| ~ rf(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X1)
| rf(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X107,X108] :
( rf(X107,X108)
| ~ rs(X107,X108) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_14])])]) ).
cnf(c_0_18,plain,
( ~ ca_Ax2(X1)
| ~ rinvF1(X1,X2)
| ca_Vx3(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ rf1(X1,X2)
| rinvF1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X76,X77,X78] :
( ( cp(X78)
| ra_Px1(X78,esk3_1(X78)) )
& ( ~ ra_Px1(X76,X77)
| ~ cp(X76) ) ),
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_3])])])])])]) ).
fof(c_0_21,plain,
! [X80,X82,X83] :
( ( cpxcomp(X82)
| ~ ra_Px1(X82,X83) )
& ( ra_Px1(X80,esk4_1(X80))
| ~ cpxcomp(X80) ) ),
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_22,plain,
! [X95,X96,X97] :
( X96 = X97
| ~ rf1(X95,X97)
| ~ rf1(X95,X96) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])])]) ).
cnf(c_0_23,plain,
( ~ cUnsatisfiable(X2)
| ~ rf(X2,X1)
| X1 = esk2_1(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( ~ rs(X1,X2)
| rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X88,X90,X91] :
( ( ca_Vx3(X90)
| ~ cowlThing(X91)
| ~ rs(X90,X91) )
& ( ~ ca_Vx3(X88)
| cowlThing(esk6_1(X88)) )
& ( ~ ca_Vx3(X88)
| rs(X88,esk6_1(X88)) ) ),
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_6])])])])])])]) ).
cnf(c_0_26,plain,
( ~ ca_Ax2(X2)
| ~ rf1(X1,X2)
| ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( ~ cUnsatisfiable(X1)
| rf1(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,plain,
( ~ cUnsatisfiable(X1)
| ca_Ax2(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( ~ ra_Px1(X1,X2)
| ~ cp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( ~ cpxcomp(X1)
| ra_Px1(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( ~ rf1(X1,X3)
| ~ rf1(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_32,plain,
! [X109,X110] :
( rf1(X109,X110)
| ~ rs(X109,X110) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_15])])]) ).
cnf(c_0_33,plain,
( ~ cUnsatisfiable(X2)
| ~ rs(X2,X1)
| X1 = esk2_1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,plain,
( ~ ca_Vx3(X1)
| rs(X1,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( ~ cUnsatisfiable(X1)
| ca_Vx3(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_36,plain,
( ~ cp(X1)
| ~ cpxcomp(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( ~ cUnsatisfiable(X1)
| cp(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_38,plain,
( ~ cUnsatisfiable(X2)
| ~ rf1(X2,X1)
| X1 = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_39,plain,
( ~ rs(X1,X2)
| rf1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( ~ cUnsatisfiable(X1)
| esk6_1(X1) = esk2_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_41,plain,
( ~ cUnsatisfiable(X1)
| ~ cpxcomp(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( ~ ca_Ax2(X1)
| cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,plain,
( ~ cUnsatisfiable(X2)
| ~ rs(X2,X1)
| X1 = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( ~ cUnsatisfiable(X1)
| rs(X1,esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_40]),c_0_35]) ).
cnf(c_0_45,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Ax2(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) = esk1_1(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
cUnsatisfiable(i2003_11_14_17_21_19256),
inference(split_conjunct,[status(thm)],[axiom_13]) ).
cnf(c_0_48,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_28]) ).
cnf(c_0_49,plain,
$false,
inference(sr,[status(thm)],[c_0_47,c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS112+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n017.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:48:58 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 806354 completed with status 0
% 0.13/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 806369 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Unsatisfiable
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 39
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 55
% 0.13/0.42 % Removed in clause preprocessing : 25
% 0.13/0.42 % Initial clauses in saturation : 30
% 0.13/0.42 % Processed clauses : 57
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 3
% 0.13/0.42 % ...remaining for further processing : 54
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 17
% 0.13/0.42 % Backward-rewritten : 0
% 0.13/0.42 % Generated clauses : 57
% 0.13/0.42 % ...of the previous two non-redundant : 44
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 5
% 0.13/0.42 % Paramodulations : 56
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 0
% 0.13/0.42 % ...of those cached : 0
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 36
% 0.13/0.42 % Positive orientable unit clauses : 0
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 2
% 0.13/0.42 % Non-unit-clauses : 34
% 0.13/0.42 % Current number of unprocessed clauses: 17
% 0.13/0.42 % ...number of literals in the above : 53
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 19
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 410
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 303
% 0.13/0.42 % Non-unit clause-clause subsumptions : 8
% 0.13/0.42 % Unit Clause-clause subsumption calls : 17
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 0
% 0.13/0.42 % BW rewrite match successes : 0
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 4256
% 0.13/0.42 % Search garbage collected termcells : 898
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.008 s
% 0.13/0.42 % System time : 0.002 s
% 0.13/0.42 % Total time : 0.011 s
% 0.13/0.42 % Maximum resident set size: 3676 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.018 s
% 0.13/0.42 % System time : 0.013 s
% 0.13/0.42 % Total time : 0.031 s
% 0.13/0.42 % Maximum resident set size: 4608 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------