%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS108+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 : n016.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:46 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 123 ( 6 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 147 ( 60 ~; 56 |; 23 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 56 ( 2 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_15,axiom,
! [X4] :
( ca_Ax14(X4)
<=> ( ! [X6,X7] :
( ( rr(X4,X7)
& rr(X4,X6) )
=> X6 = X7 )
& ? [X5] :
( cp1(X5)
& rr(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15) ).
fof(axiom_25,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_25) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp2(X4)
& ? [X5] :
( ca_Ax14(X5)
& rinvR(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4] :
( cp2xcomp(X4)
<=> ~ ? [X5] : ra_Px5(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_4,axiom,
! [X4] :
( cp2(X4)
<=> ? [X6] : ra_Px5(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_16,axiom,
! [X4] :
( ca_Cx1(X4)
<=> ( cp4xcomp(X4)
& cp3xcomp(X4)
& cp5xcomp(X4)
& cp2xcomp(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_16) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ca_Cx1(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_26,axiom,
cUnsatisfiable(i2003_11_14_17_21_04740),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_26) ).
fof(c_0_8,plain,
! [X146,X148,X149,X150,X151] :
( ( ca_Ax14(X150)
| ~ cp1(X151)
| ~ rr(X150,X151)
| esk11_1(X150) != esk12_1(X150) )
& ( ca_Ax14(X150)
| ~ cp1(X151)
| ~ rr(X150,X151)
| rr(X150,esk12_1(X150)) )
& ( ca_Ax14(X150)
| ~ cp1(X151)
| ~ rr(X150,X151)
| rr(X150,esk11_1(X150)) )
& ( ~ ca_Ax14(X146)
| X148 = X149
| ~ rr(X146,X149)
| ~ rr(X146,X148) )
& ( ~ ca_Ax14(X146)
| cp1(esk10_1(X146)) )
& ( ~ ca_Ax14(X146)
| rr(X146,esk10_1(X146)) ) ),
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_15])])])])])])]) ).
fof(c_0_9,plain,
! [X181,X182] :
( ( rinvR(X181,X182)
| ~ rr(X182,X181) )
& ( rr(X182,X181)
| ~ rinvR(X181,X182) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_25])])]) ).
fof(c_0_10,plain,
! [X106,X108,X109] :
( ( cUnsatisfiable(X108)
| ~ cp2(X108)
| ~ ca_Ax14(X109)
| ~ rinvR(X108,X109) )
& ( ~ cUnsatisfiable(X106)
| cp2(X106) )
& ( ~ cUnsatisfiable(X106)
| ca_Ax14(esk1_1(X106)) )
& ( ~ cUnsatisfiable(X106)
| rinvR(X106,esk1_1(X106)) ) ),
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_11,plain,
! [X116,X117,X118] :
( ( cp2xcomp(X118)
| ra_Px5(X118,esk3_1(X118)) )
& ( ~ ra_Px5(X116,X117)
| ~ cp2xcomp(X116) ) ),
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_12,plain,
! [X111,X113,X114] :
( ( cp2(X113)
| ~ ra_Px5(X113,X114) )
& ( ra_Px5(X111,esk2_1(X111))
| ~ cp2(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_4])])])])])]) ).
cnf(c_0_13,plain,
( ~ ca_Ax14(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ ca_Ax14(X1)
| rr(X1,esk10_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ rinvR(X1,X2)
| rr(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X1)
| rinvR(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ ra_Px5(X1,X2)
| ~ cp2xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ cp2(X1)
| ra_Px5(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X154] :
( ( ca_Cx1(X154)
| ~ cp4xcomp(X154)
| ~ cp3xcomp(X154)
| ~ cp5xcomp(X154)
| ~ cp2xcomp(X154) )
& ( ~ ca_Cx1(X154)
| cp4xcomp(X154) )
& ( ~ ca_Cx1(X154)
| cp3xcomp(X154) )
& ( ~ ca_Cx1(X154)
| cp5xcomp(X154) )
& ( ~ ca_Cx1(X154)
| cp2xcomp(X154) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_16])])])]) ).
cnf(c_0_20,plain,
( ~ ca_Ax14(X2)
| ~ rr(X2,X1)
| X1 = esk10_1(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( ~ cUnsatisfiable(X1)
| rr(esk1_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ cUnsatisfiable(X1)
| ca_Ax14(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( ~ cp2(X1)
| ~ cp2xcomp(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( ~ ca_Cx1(X1)
| cp2xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,plain,
! [X110] :
( ca_Cx1(X110)
| ~ cp1(X110) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_26,plain,
( ~ ca_Ax14(X1)
| cp1(esk10_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,plain,
( ~ cUnsatisfiable(X1)
| esk10_1(esk1_1(X1)) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,plain,
( ~ ca_Cx1(X1)
| ~ cp2(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ cUnsatisfiable(X1)
| cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
( ~ cp1(X1)
| ca_Cx1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( ~ cUnsatisfiable(X1)
| cp1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]) ).
cnf(c_0_32,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Cx1(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
cUnsatisfiable(i2003_11_14_17_21_04740),
inference(split_conjunct,[status(thm)],[axiom_26]) ).
cnf(c_0_34,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS108+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.38 % Computer : n016.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Sun Sep 20 22:58:46 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.46 % Version: 3.5.1
% 0.15/5.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 978416 completed with status 0
% 0.15/5.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/5.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.46 % No SInE strategy applied
% 0.15/5.46 % Search class: FGHSF-FFMF11-SFFFFFNN
% 0.15/5.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.15/5.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/5.46 % new_bool_3 with pid 978436 completed with status 0
% 0.15/5.46 % Result found by new_bool_3
% 0.15/5.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.46 % No SInE strategy applied
% 0.15/5.46 % Search class: FGHSF-FFMF11-SFFFFFNN
% 0.15/5.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.15/5.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.46 % Preprocessing time : 0.001 s
% 0.15/5.46 % Presaturation interreduction done
% 0.15/5.46
% 0.15/5.46 % Proof found!
% 0.15/5.46 % SZS status Unsatisfiable
% 0.15/5.46 % SZS output start CNFRefutation
% See solution above
% 0.15/5.46 % Parsed axioms : 66
% 0.15/5.46 % Removed by relevancy pruning/SinE : 0
% 0.15/5.46 % Initial clauses : 100
% 0.15/5.46 % Removed in clause preprocessing : 40
% 0.15/5.46 % Initial clauses in saturation : 60
% 0.15/5.46 % Processed clauses : 158
% 0.15/5.46 % ...of these trivial : 0
% 0.15/5.46 % ...subsumed : 5
% 0.15/5.46 % ...remaining for further processing : 153
% 0.15/5.46 % Other redundant clauses eliminated : 0
% 0.15/5.46 % Clauses deleted for lack of memory : 0
% 0.15/5.46 % Backward-subsumed : 8
% 0.15/5.46 % Backward-rewritten : 0
% 0.15/5.46 % Generated clauses : 78
% 0.15/5.46 % ...of the previous two non-redundant : 46
% 0.15/5.46 % ...aggressively subsumed : 0
% 0.15/5.46 % Contextual simplify-reflections : 5
% 0.15/5.46 % Paramodulations : 77
% 0.15/5.46 % Factorizations : 0
% 0.15/5.46 % NegExts : 0
% 0.15/5.46 % Equation resolutions : 0
% 0.15/5.46 % Disequality decompositions : 0
% 0.15/5.46 % Total rewrite steps : 0
% 0.15/5.46 % ...of those cached : 0
% 0.15/5.46 % Propositional unsat checks : 0
% 0.15/5.46 % Propositional check models : 0
% 0.15/5.46 % Propositional check unsatisfiable : 0
% 0.15/5.46 % Propositional clauses : 0
% 0.15/5.46 % Propositional clauses after purity: 0
% 0.15/5.46 % Propositional unsat core size : 0
% 0.15/5.46 % Propositional preprocessing time : 0.000
% 0.15/5.46 % Propositional encoding time : 0.000
% 0.15/5.46 % Propositional solver time : 0.000
% 0.15/5.46 % Success case prop preproc time : 0.000
% 0.15/5.46 % Success case prop encoding time : 0.000
% 0.15/5.46 % Success case prop solver time : 0.000
% 0.15/5.46 % Current number of processed clauses : 84
% 0.15/5.46 % Positive orientable unit clauses : 3
% 0.15/5.46 % Positive unorientable unit clauses: 0
% 0.15/5.46 % Negative unit clauses : 3
% 0.15/5.46 % Non-unit-clauses : 78
% 0.15/5.46 % Current number of unprocessed clauses: 8
% 0.15/5.46 % ...number of literals in the above : 29
% 0.15/5.46 % Current number of archived formulas : 0
% 0.15/5.46 % Current number of archived clauses : 70
% 0.15/5.46 % Clause-clause subsumption calls (NU) : 1998
% 0.15/5.46 % Rec. Clause-clause subsumption calls : 1175
% 0.15/5.46 % Non-unit clause-clause subsumptions : 10
% 0.15/5.46 % Unit Clause-clause subsumption calls : 90
% 0.15/5.46 % Rewrite failures with RHS unbound : 0
% 0.15/5.46 % BW rewrite match attempts : 0
% 0.15/5.46 % BW rewrite match successes : 0
% 0.15/5.46 % Condensation attempts : 0
% 0.15/5.46 % Condensation successes : 0
% 0.15/5.46 % Termbank termtop insertions : 7639
% 0.15/5.46 % Search garbage collected termcells : 1641
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.010 s
% 0.15/5.46 % System time : 0.005 s
% 0.15/5.46 % Total time : 0.015 s
% 0.15/5.46 % Maximum resident set size: 3964 pages
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.029 s
% 0.15/5.46 % System time : 0.020 s
% 0.15/5.46 % Total time : 0.049 s
% 0.15/5.46 % Maximum resident set size: 4864 pages
% 0.15/5.46 % E exiting
%------------------------------------------------------------------------------