%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS107+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 : n002.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:31 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 4 unt; 0 def)
% Number of atoms : 119 ( 7 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 138 ( 59 ~; 53 |; 18 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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 : 69 ( 2 sgn 33 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_7,axiom,
! [X4,X5,X7] :
( ( rrx(X4,X7)
& rrx(X4,X5) )
=> X5 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_17,axiom,
! [X4,X5] :
( rrx4(X4,X5)
=> rrx(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_17) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ca_Cx1(X4)
& ? [X5] :
( cc2(X5)
& rrx4(X4,X5) )
& ? [X5] :
( cc1(X5)
& rrx3(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4] :
( ca_Cx1xcomp(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_4,axiom,
! [X4] :
( ca_Cx1(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_20,axiom,
! [X4,X5] :
( rrx3(X4,X5)
=> rrx(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
fof(axiom_3,axiom,
! [X4] :
( ca_Ax2(X4)
<=> ( cc1(X4)
& cc2(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_5,axiom,
! [X4] :
( ca_Cx1xcomp(X4)
<=> ? [X5] :
( ca_Ax2(X5)
& rrx3(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_12,axiom,
cUnsatisfiable(i2003_11_14_17_21_01226),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(c_0_9,plain,
! [X115,X116,X117] :
( X116 = X117
| ~ rrx(X115,X117)
| ~ rrx(X115,X116) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
fof(c_0_10,plain,
! [X138,X139] :
( rrx(X138,X139)
| ~ rrx4(X138,X139) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_17])])]) ).
cnf(c_0_11,plain,
( ~ rrx(X1,X3)
| ~ rrx(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ rrx4(X1,X2)
| rrx(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X96,X99,X100,X101] :
( ( cUnsatisfiable(X99)
| ~ ca_Cx1(X99)
| ~ cc2(X101)
| ~ rrx4(X99,X101)
| ~ cc1(X100)
| ~ rrx3(X99,X100) )
& ( ~ cUnsatisfiable(X96)
| ca_Cx1(X96) )
& ( ~ cUnsatisfiable(X96)
| cc2(esk2_1(X96)) )
& ( ~ cUnsatisfiable(X96)
| rrx4(X96,esk2_1(X96)) )
& ( ~ cUnsatisfiable(X96)
| cc1(esk1_1(X96)) )
& ( ~ cUnsatisfiable(X96)
| rrx3(X96,esk1_1(X96)) ) ),
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_14,plain,
! [X111,X112,X113] :
( ( ca_Cx1xcomp(X113)
| ra_Px1(X113,esk5_1(X113)) )
& ( ~ ra_Px1(X111,X112)
| ~ ca_Cx1xcomp(X111) ) ),
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])])])])])]) ).
fof(c_0_15,plain,
! [X103,X105,X106] :
( ( ca_Cx1(X105)
| ~ ra_Px1(X105,X106) )
& ( ra_Px1(X103,esk3_1(X103))
| ~ ca_Cx1(X103) ) ),
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])])])])])]) ).
cnf(c_0_16,plain,
( ~ rrx(X3,X1)
| ~ rrx4(X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ cUnsatisfiable(X1)
| rrx4(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X144,X145] :
( rrx(X144,X145)
| ~ rrx3(X144,X145) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_20])])]) ).
cnf(c_0_19,plain,
( ~ ra_Px1(X1,X2)
| ~ ca_Cx1xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ ca_Cx1(X1)
| ra_Px1(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X102] :
( ( ca_Ax2(X102)
| ~ cc1(X102)
| ~ cc2(X102) )
& ( ~ ca_Ax2(X102)
| cc1(X102) )
& ( ~ ca_Ax2(X102)
| cc2(X102) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_22,plain,
( ~ cUnsatisfiable(X2)
| ~ rrx(X2,X1)
| X1 = esk2_1(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ rrx3(X1,X2)
| rrx(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X107,X109,X110] :
( ( ca_Cx1xcomp(X109)
| ~ ca_Ax2(X110)
| ~ rrx3(X109,X110) )
& ( ~ ca_Cx1xcomp(X107)
| ca_Ax2(esk4_1(X107)) )
& ( ~ ca_Cx1xcomp(X107)
| rrx3(X107,esk4_1(X107)) ) ),
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])])])])])])]) ).
cnf(c_0_25,plain,
( ~ ca_Cx1(X1)
| ~ ca_Cx1xcomp(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ cUnsatisfiable(X1)
| ca_Cx1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,plain,
( ~ cc1(X1)
| ~ cc2(X1)
| ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( ~ cUnsatisfiable(X1)
| cc2(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,plain,
( ~ cUnsatisfiable(X2)
| ~ rrx3(X2,X1)
| X1 = esk2_1(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( ~ cUnsatisfiable(X1)
| rrx3(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,plain,
( ~ ca_Ax2(X2)
| ~ rrx3(X1,X2)
| ca_Cx1xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Cx1xcomp(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( ~ cUnsatisfiable(X1)
| ~ cc1(esk2_1(X1))
| ca_Ax2(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) = esk1_1(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ cUnsatisfiable(X1)
| cc1(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_36,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Ax2(esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_30]),c_0_32]) ).
cnf(c_0_37,plain,
cUnsatisfiable(i2003_11_14_17_21_01226),
inference(split_conjunct,[status(thm)],[axiom_12]) ).
cnf(c_0_38,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[c_0_37,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS107+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.10/0.36 % Computer : n002.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:56:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1884955 completed with status 0
% 0.10/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.10/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.10/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 1884970 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Preprocessing time : 0.002 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Unsatisfiable
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 53
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 66
% 0.10/0.44 % Removed in clause preprocessing : 33
% 0.10/0.44 % Initial clauses in saturation : 33
% 0.10/0.44 % Processed clauses : 56
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 4
% 0.10/0.44 % ...remaining for further processing : 52
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 16
% 0.10/0.44 % Backward-rewritten : 0
% 0.10/0.44 % Generated clauses : 42
% 0.10/0.44 % ...of the previous two non-redundant : 32
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 3
% 0.10/0.44 % Paramodulations : 41
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 0
% 0.10/0.44 % ...of those cached : 0
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 35
% 0.10/0.44 % Positive orientable unit clauses : 0
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 2
% 0.10/0.44 % Non-unit-clauses : 33
% 0.10/0.44 % Current number of unprocessed clauses: 9
% 0.10/0.44 % ...number of literals in the above : 27
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 18
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 218
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 161
% 0.10/0.44 % Non-unit clause-clause subsumptions : 7
% 0.10/0.44 % Unit Clause-clause subsumption calls : 19
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 0
% 0.10/0.44 % BW rewrite match successes : 0
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 5011
% 0.10/0.44 % Search garbage collected termcells : 1069
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.010 s
% 0.10/0.44 % System time : 0.004 s
% 0.10/0.44 % Total time : 0.014 s
% 0.10/0.44 % Maximum resident set size: 3656 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.029 s
% 0.10/0.44 % System time : 0.014 s
% 0.10/0.44 % Total time : 0.043 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------