%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS122+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 : n013.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:48 PM UTC 2026
% Result : Unsatisfiable 0.14s 5.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 4 unt; 0 def)
% Number of atoms : 101 ( 5 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 114 ( 48 ~; 44 |; 14 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 60 ( 2 sgn 31 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_5,axiom,
! [X4] :
( ca_Ax2(X4)
<=> ( ! [X5] :
( rinvF(X4,X5)
=> ca_Vx3(X5) )
& cp1(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_8,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
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_6,axiom,
! [X4] :
( ca_Vx3(X4)
<=> ? [X5] :
( cp1xcomp(X5)
& rf(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ? [X5] :
( ca_Ax2(X5)
& rf(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cp1xcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_21_55116),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_8,plain,
! [X70,X71,X72] :
( ( ca_Ax2(X72)
| ~ cp1(X72)
| ~ ca_Vx3(esk4_1(X72)) )
& ( ca_Ax2(X72)
| ~ cp1(X72)
| rinvF(X72,esk4_1(X72)) )
& ( ~ ca_Ax2(X70)
| ca_Vx3(X71)
| ~ rinvF(X70,X71) )
& ( ~ ca_Ax2(X70)
| cp1(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_5])])])])])])]) ).
fof(c_0_9,plain,
! [X81,X82] :
( ( rinvF(X81,X82)
| ~ rf(X82,X81) )
& ( rf(X82,X81)
| ~ rinvF(X81,X82) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])])]) ).
fof(c_0_10,plain,
! [X78,X79,X80] :
( X79 = X80
| ~ rf(X78,X80)
| ~ rf(X78,X79) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
fof(c_0_11,plain,
! [X74,X76,X77] :
( ( ca_Vx3(X76)
| ~ cp1xcomp(X77)
| ~ rf(X76,X77) )
& ( ~ ca_Vx3(X74)
| cp1xcomp(esk5_1(X74)) )
& ( ~ ca_Vx3(X74)
| rf(X74,esk5_1(X74)) ) ),
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_12,plain,
( ~ ca_Ax2(X1)
| ~ rinvF(X1,X2)
| ca_Vx3(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ rf(X1,X2)
| rinvF(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X58,X60,X61] :
( ( cUnsatisfiable(X60)
| ~ ca_Ax2(X61)
| ~ rf(X60,X61) )
& ( ~ cUnsatisfiable(X58)
| ca_Ax2(esk1_1(X58)) )
& ( ~ cUnsatisfiable(X58)
| rf(X58,esk1_1(X58)) ) ),
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])])])])])])]) ).
cnf(c_0_15,plain,
( ~ rf(X1,X3)
| ~ rf(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ ca_Vx3(X1)
| rf(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ ca_Ax2(X2)
| ~ rf(X1,X2)
| ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ cUnsatisfiable(X1)
| rf(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ cUnsatisfiable(X1)
| ca_Ax2(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X62,X63,X64] :
( ( cp1(X64)
| ra_Px1(X64,esk2_1(X64)) )
& ( ~ ra_Px1(X62,X63)
| ~ cp1(X62) ) ),
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,
! [X66,X68,X69] :
( ( cp1xcomp(X68)
| ~ ra_Px1(X68,X69) )
& ( ra_Px1(X66,esk3_1(X66))
| ~ cp1xcomp(X66) ) ),
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_22,plain,
( ~ ca_Vx3(X2)
| ~ rf(X2,X1)
| X1 = esk5_1(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ cUnsatisfiable(X1)
| ca_Vx3(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
( ~ ra_Px1(X1,X2)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( ~ cp1xcomp(X1)
| ra_Px1(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ ca_Vx3(X1)
| cp1xcomp(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( ~ cUnsatisfiable(X1)
| esk5_1(X1) = esk1_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_23]) ).
cnf(c_0_28,plain,
( ~ cp1(X1)
| ~ cp1xcomp(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ cUnsatisfiable(X1)
| cp1xcomp(esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23]) ).
cnf(c_0_30,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
( ~ ca_Ax2(X1)
| cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,plain,
cUnsatisfiable(i2003_11_14_17_21_55116),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_33,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS122+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.10/5.37 % Computer : n013.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sun Sep 20 22:53:45 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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/5.45 % Version: 3.5.1
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % Starting sh5l with 300s (1) cores
% 0.14/5.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3584991 completed with status 0
% 0.14/5.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.45 % No SInE strategy applied
% 0.14/5.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.14/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.14/5.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 136s (1) cores
% 0.14/5.45 % SubtermCWHack with pid 3585006 completed with status 0
% 0.14/5.45 % Result found by SubtermCWHack
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.45 % No SInE strategy applied
% 0.14/5.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.14/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.45 % Preprocessing time : 0.001 s
% 0.14/5.45
% 0.14/5.45 % Proof found!
% 0.14/5.45 % SZS status Unsatisfiable
% 0.14/5.45 % SZS output start CNFRefutation
% See solution above
% 0.14/5.45 % Parsed axioms : 31
% 0.14/5.45 % Removed by relevancy pruning/SinE : 0
% 0.14/5.45 % Initial clauses : 44
% 0.14/5.45 % Removed in clause preprocessing : 20
% 0.14/5.45 % Initial clauses in saturation : 24
% 0.14/5.45 % Processed clauses : 41
% 0.14/5.45 % ...of these trivial : 0
% 0.14/5.45 % ...subsumed : 2
% 0.14/5.45 % ...remaining for further processing : 39
% 0.14/5.45 % Other redundant clauses eliminated : 0
% 0.14/5.45 % Clauses deleted for lack of memory : 0
% 0.14/5.45 % Backward-subsumed : 8
% 0.14/5.45 % Backward-rewritten : 0
% 0.14/5.45 % Generated clauses : 38
% 0.14/5.45 % ...of the previous two non-redundant : 25
% 0.14/5.45 % ...aggressively subsumed : 0
% 0.14/5.45 % Contextual simplify-reflections : 4
% 0.14/5.45 % Paramodulations : 37
% 0.14/5.45 % Factorizations : 0
% 0.14/5.45 % NegExts : 0
% 0.14/5.45 % Equation resolutions : 0
% 0.14/5.45 % Disequality decompositions : 0
% 0.14/5.45 % Total rewrite steps : 0
% 0.14/5.45 % ...of those cached : 0
% 0.14/5.45 % Propositional unsat checks : 0
% 0.14/5.45 % Propositional check models : 0
% 0.14/5.45 % Propositional check unsatisfiable : 0
% 0.14/5.45 % Propositional clauses : 0
% 0.14/5.45 % Propositional clauses after purity: 0
% 0.14/5.45 % Propositional unsat core size : 0
% 0.14/5.45 % Propositional preprocessing time : 0.000
% 0.14/5.45 % Propositional encoding time : 0.000
% 0.14/5.45 % Propositional solver time : 0.000
% 0.14/5.45 % Success case prop preproc time : 0.000
% 0.14/5.45 % Success case prop encoding time : 0.000
% 0.14/5.45 % Success case prop solver time : 0.000
% 0.14/5.45 % Current number of processed clauses : 30
% 0.14/5.45 % Positive orientable unit clauses : 1
% 0.14/5.45 % Positive unorientable unit clauses: 0
% 0.14/5.45 % Negative unit clauses : 2
% 0.14/5.45 % Non-unit-clauses : 27
% 0.14/5.45 % Current number of unprocessed clauses: 7
% 0.14/5.45 % ...number of literals in the above : 24
% 0.14/5.45 % Current number of archived formulas : 0
% 0.14/5.45 % Current number of archived clauses : 10
% 0.14/5.45 % Clause-clause subsumption calls (NU) : 108
% 0.14/5.45 % Rec. Clause-clause subsumption calls : 84
% 0.14/5.45 % Non-unit clause-clause subsumptions : 7
% 0.14/5.45 % Unit Clause-clause subsumption calls : 38
% 0.14/5.45 % Rewrite failures with RHS unbound : 0
% 0.14/5.45 % BW rewrite match attempts : 0
% 0.14/5.45 % BW rewrite match successes : 0
% 0.14/5.45 % Condensation attempts : 0
% 0.14/5.45 % Condensation successes : 0
% 0.14/5.45 % Termbank termtop insertions : 3291
% 0.14/5.45 % Search garbage collected termcells : 725
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.009 s
% 0.14/5.45 % System time : 0.003 s
% 0.14/5.45 % Total time : 0.012 s
% 0.14/5.45 % Maximum resident set size: 3664 pages
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.023 s
% 0.14/5.45 % System time : 0.014 s
% 0.14/5.45 % Total time : 0.037 s
% 0.14/5.45 % Maximum resident set size: 4864 pages
% 0.14/5.45 % E exiting
%------------------------------------------------------------------------------