%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS118+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:33 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.41s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 4 unt; 0 def)
% Number of atoms : 147 ( 5 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 172 ( 74 ~; 67 |; 21 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 84 ( 2 sgn 40 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
! [X4] :
( cc(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( ccxcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_8,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_6,axiom,
! [X4] :
( ca_Vx3(X4)
<=> ? [X5] :
( cd(X5)
& rinvF(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_5,axiom,
! [X4] :
( cd(X4)
<=> ( cc(X4)
& ? [X5] :
( ccxcomp(X5)
& rf(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
! [X4,X5,X7] :
( ( rf(X4,X7)
& rf(X4,X5) )
=> X5 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ccxcomp(X4)
& ? [X5] :
( cd(X5)
& rinvF(X4,X5) )
& ! [X5] :
( rinvR(X4,X5)
=> ca_Vx3(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_12,axiom,
! [X4,X5] :
( rf(X4,X5)
=> rr(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_21_4056),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_10,plain,
! [X64,X65,X66] :
( ( cc(X66)
| ra_Px1(X66,esk3_1(X66)) )
& ( ~ ra_Px1(X64,X65)
| ~ cc(X64) ) ),
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_11,plain,
! [X68,X70,X71] :
( ( ccxcomp(X70)
| ~ ra_Px1(X70,X71) )
& ( ra_Px1(X68,esk4_1(X68))
| ~ ccxcomp(X68) ) ),
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_12,plain,
! [X83,X84] :
( ( rinvF(X83,X84)
| ~ rf(X84,X83) )
& ( rf(X84,X83)
| ~ rinvF(X83,X84) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])])]) ).
fof(c_0_13,plain,
! [X76,X78,X79] :
( ( ca_Vx3(X78)
| ~ cd(X79)
| ~ rinvF(X78,X79) )
& ( ~ ca_Vx3(X76)
| cd(esk6_1(X76)) )
& ( ~ ca_Vx3(X76)
| rinvF(X76,esk6_1(X76)) ) ),
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_14,plain,
( ~ ra_Px1(X1,X2)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ ccxcomp(X1)
| ra_Px1(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X72,X74,X75] :
( ( cd(X74)
| ~ cc(X74)
| ~ ccxcomp(X75)
| ~ rf(X74,X75) )
& ( ~ cd(X72)
| cc(X72) )
& ( ~ cd(X72)
| ccxcomp(esk5_1(X72)) )
& ( ~ cd(X72)
| rf(X72,esk5_1(X72)) ) ),
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_17,plain,
! [X80,X81,X82] :
( X81 = X82
| ~ rf(X80,X82)
| ~ rf(X80,X81) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
cnf(c_0_18,plain,
( ~ rinvF(X1,X2)
| rf(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ ca_Vx3(X1)
| rinvF(X1,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X58,X59,X61,X63] :
( ( cUnsatisfiable(X61)
| ~ ccxcomp(X61)
| ~ cd(X63)
| ~ rinvF(X61,X63)
| ~ ca_Vx3(esk2_1(X61)) )
& ( cUnsatisfiable(X61)
| ~ ccxcomp(X61)
| ~ cd(X63)
| ~ rinvF(X61,X63)
| rinvR(X61,esk2_1(X61)) )
& ( ~ cUnsatisfiable(X58)
| ccxcomp(X58) )
& ( ~ cUnsatisfiable(X58)
| cd(esk1_1(X58)) )
& ( ~ cUnsatisfiable(X58)
| rinvF(X58,esk1_1(X58)) )
& ( ~ cUnsatisfiable(X58)
| ca_Vx3(X59)
| ~ rinvR(X58,X59) ) ),
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_21,plain,
! [X85,X86] :
( ( rinvR(X85,X86)
| ~ rr(X86,X85) )
& ( rr(X86,X85)
| ~ rinvR(X85,X86) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])])]) ).
cnf(c_0_22,plain,
( ~ cc(X1)
| ~ ccxcomp(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( ~ cd(X1)
| cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ rf(X1,X3)
| ~ rf(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ ca_Vx3(X1)
| rf(esk6_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2)
| ca_Vx3(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ rr(X1,X2)
| rinvR(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X90,X91] :
( rr(X90,X91)
| ~ rf(X90,X91) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_12])])]) ).
cnf(c_0_29,plain,
( ~ ccxcomp(X1)
| ~ cd(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( ~ cd(X1)
| ccxcomp(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,plain,
( ~ ca_Vx3(X2)
| ~ rf(esk6_1(X2),X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ cd(X1)
| rf(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,plain,
( ~ ca_Vx3(X1)
| cd(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,plain,
( ~ cUnsatisfiable(X2)
| ~ rr(X1,X2)
| ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( ~ rf(X1,X2)
| rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( ~ cd(X2)
| ~ rinvF(X1,X2)
| ca_Vx3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,plain,
( ~ cUnsatisfiable(X1)
| rinvF(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_38,plain,
( ~ cUnsatisfiable(X1)
| cd(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_39,plain,
( ~ cd(X1)
| ~ cd(esk5_1(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( ~ ca_Vx3(X1)
| esk5_1(esk6_1(X1)) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_41,plain,
( ~ cUnsatisfiable(X2)
| ~ rf(X1,X2)
| ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
( ~ cUnsatisfiable(X1)
| ca_Vx3(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_43,plain,
( ~ ca_Vx3(X1)
| ~ cd(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33]) ).
cnf(c_0_44,plain,
( ~ cUnsatisfiable(X1)
| ca_Vx3(esk6_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_42]) ).
cnf(c_0_45,plain,
( ~ cUnsatisfiable(X1)
| ~ cd(esk6_1(X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
cUnsatisfiable(i2003_11_14_17_21_4056),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_47,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_33]),c_0_42]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[c_0_46,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS118+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 22:54:07 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.12/0.41 % Version: 3.5.1
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.41 % Starting sh5l with 300s (1) cores
% 0.12/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2541186 completed with status 0
% 0.12/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41 % No SInE strategy applied
% 0.12/0.41 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.12/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.12/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2541202 completed with status 0
% 0.12/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41 % No SInE strategy applied
% 0.12/0.41 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.12/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.41 % Preprocessing time : 0.001 s
% 0.12/0.41 % Presaturation interreduction done
% 0.12/0.41
% 0.12/0.41 % Proof found!
% 0.12/0.41 % SZS status Unsatisfiable
% 0.12/0.41 % SZS output start CNFRefutation
% See solution above
% 0.12/0.41 % Parsed axioms : 32
% 0.12/0.41 % Removed by relevancy pruning/SinE : 0
% 0.12/0.41 % Initial clauses : 48
% 0.12/0.41 % Removed in clause preprocessing : 20
% 0.12/0.41 % Initial clauses in saturation : 28
% 0.12/0.41 % Processed clauses : 88
% 0.12/0.41 % ...of these trivial : 0
% 0.12/0.41 % ...subsumed : 6
% 0.12/0.41 % ...remaining for further processing : 82
% 0.12/0.41 % Other redundant clauses eliminated : 0
% 0.12/0.41 % Clauses deleted for lack of memory : 0
% 0.12/0.41 % Backward-subsumed : 15
% 0.12/0.41 % Backward-rewritten : 0
% 0.12/0.41 % Generated clauses : 60
% 0.12/0.41 % ...of the previous two non-redundant : 48
% 0.12/0.41 % ...aggressively subsumed : 0
% 0.12/0.41 % Contextual simplify-reflections : 6
% 0.12/0.41 % Paramodulations : 59
% 0.12/0.41 % Factorizations : 0
% 0.12/0.41 % NegExts : 0
% 0.12/0.41 % Equation resolutions : 0
% 0.12/0.41 % Disequality decompositions : 0
% 0.12/0.41 % Total rewrite steps : 0
% 0.12/0.41 % ...of those cached : 0
% 0.12/0.41 % Propositional unsat checks : 0
% 0.12/0.41 % Propositional check models : 0
% 0.12/0.41 % Propositional check unsatisfiable : 0
% 0.12/0.41 % Propositional clauses : 0
% 0.12/0.41 % Propositional clauses after purity: 0
% 0.12/0.41 % Propositional unsat core size : 0
% 0.12/0.41 % Propositional preprocessing time : 0.000
% 0.12/0.41 % Propositional encoding time : 0.000
% 0.12/0.41 % Propositional solver time : 0.000
% 0.12/0.41 % Success case prop preproc time : 0.000
% 0.12/0.41 % 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 : 38
% 0.12/0.42 % Positive orientable unit clauses : 0
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 3
% 0.12/0.42 % Non-unit-clauses : 35
% 0.12/0.42 % Current number of unprocessed clauses: 16
% 0.12/0.42 % ...number of literals in the above : 54
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 45
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 425
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 255
% 0.12/0.42 % Non-unit clause-clause subsumptions : 12
% 0.12/0.42 % Unit Clause-clause subsumption calls : 21
% 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 : 4045
% 0.12/0.42 % Search garbage collected termcells : 797
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.008 s
% 0.12/0.42 % System time : 0.003 s
% 0.12/0.42 % Total time : 0.011 s
% 0.12/0.42 % Maximum resident set size: 3612 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.020 s
% 0.12/0.42 % System time : 0.014 s
% 0.12/0.42 % Total time : 0.034 s
% 0.12/0.42 % Maximum resident set size: 4608 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------