%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS084+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 : n018.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:43 PM UTC 2026
% Result : Unsatisfiable 0.15s 10.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 4 unt; 0 def)
% Number of atoms : 128 ( 5 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 156 ( 65 ~; 57 |; 24 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 71 ( 1 sgn 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
! [X4] :
( cd(X4)
<=> ( cc(X4)
& ? [X5] :
( ~ cc(X5)
& rf(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ~ cc(X4)
& ! [X5] :
( rinvR(X4,X5)
=> ? [X6] :
( cd(X6)
& rinvF(X5,X6) ) )
& ? [X5] :
( cd(X5)
& rinvF(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
! [X4,X5,X6] :
( ( rf(X4,X6)
& rf(X4,X5) )
=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_6,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rf(X4,X5)
=> rr(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_19_35232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_7,plain,
! [X4] :
( cd(X4)
<=> ( cc(X4)
& ? [X5] :
( ~ cc(X5)
& rf(X4,X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_8,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ~ cc(X4)
& ! [X5] :
( rinvR(X4,X5)
=> ? [X6] :
( cd(X6)
& rinvF(X5,X6) ) )
& ? [X5] :
( cd(X5)
& rinvF(X4,X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_9,plain,
! [X59,X60,X61] :
( X60 = X61
| ~ rf(X59,X61)
| ~ rf(X59,X60) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_10,plain,
! [X55,X57,X58] :
( ( cd(X57)
| ~ cc(X57)
| cc(X58)
| ~ rf(X57,X58) )
& ( ~ cd(X55)
| cc(X55) )
& ( ~ cd(X55)
| ~ cc(esk4_1(X55)) )
& ( ~ cd(X55)
| rf(X55,esk4_1(X55)) ) ),
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)],[c_0_7])])])])])])]) ).
fof(c_0_11,plain,
! [X62,X63] :
( ( rinvF(X62,X63)
| ~ rf(X63,X62) )
& ( rf(X63,X62)
| ~ rinvF(X62,X63) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
fof(c_0_12,plain,
! [X47,X49,X51,X52,X54] :
( ( cUnsatisfiable(X51)
| cc(X51)
| ~ cd(X52)
| ~ rinvF(X51,X52)
| ~ cd(X54)
| ~ rinvF(esk3_1(X51),X54) )
& ( cUnsatisfiable(X51)
| cc(X51)
| ~ cd(X52)
| ~ rinvF(X51,X52)
| rinvR(X51,esk3_1(X51)) )
& ( ~ cUnsatisfiable(X47)
| ~ cc(X47) )
& ( ~ cUnsatisfiable(X47)
| ~ rinvR(X47,X49)
| cd(esk2_2(X47,X49)) )
& ( ~ cUnsatisfiable(X47)
| ~ rinvR(X47,X49)
| rinvF(X49,esk2_2(X47,X49)) )
& ( ~ cUnsatisfiable(X47)
| cd(esk1_1(X47)) )
& ( ~ cUnsatisfiable(X47)
| rinvF(X47,esk1_1(X47)) ) ),
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)],[c_0_8])])])])])])]) ).
cnf(c_0_13,plain,
( ~ rf(X1,X3)
| ~ rf(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ cd(X1)
| rf(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ rinvF(X1,X2)
| rf(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X2)
| ~ rinvR(X2,X1)
| rinvF(X1,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ cd(X2)
| ~ rf(X2,X1)
| X1 = esk4_1(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2)
| rf(esk2_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2)
| cd(esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ cd(X1)
| ~ cc(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2)
| esk4_1(esk2_2(X1,X2)) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
fof(c_0_22,plain,
! [X64,X65] :
( ( rinvR(X64,X65)
| ~ rr(X65,X64) )
& ( rr(X65,X64)
| ~ rinvR(X64,X65) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).
cnf(c_0_23,plain,
( ~ cUnsatisfiable(X1)
| ~ cc(X2)
| ~ rinvR(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]) ).
cnf(c_0_24,plain,
( ~ rr(X1,X2)
| rinvR(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X69,X70] :
( rr(X69,X70)
| ~ rf(X69,X70) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])])]) ).
cnf(c_0_26,plain,
( ~ cUnsatisfiable(X2)
| ~ cc(X1)
| ~ rr(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ rf(X1,X2)
| rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
( ~ cUnsatisfiable(X1)
| rinvF(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( ~ cUnsatisfiable(X2)
| ~ cc(X1)
| ~ rf(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ cUnsatisfiable(X1)
| rf(esk1_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_31,plain,
( ~ cUnsatisfiable(X1)
| ~ cc(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
( ~ cd(X1)
| cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_33,plain,
( ~ cUnsatisfiable(X1)
| cd(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,plain,
cUnsatisfiable(i2003_11_14_17_19_35232),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_35,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[c_0_34,c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS084+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.11/10.38 % Computer : n018.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Sun Sep 20 22:55:24 UTC 2026
% 0.11/10.38 % CPUTime :
% 0.11/10.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 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.15/10.46 % Version: 3.5.1
% 0.15/10.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.46 % Starting sh5l with 300s (1) cores
% 0.15/10.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 375751 completed with status 0
% 0.15/10.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/10.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.46 % No SInE strategy applied
% 0.15/10.46 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/10.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/10.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/10.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/10.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 375766 completed with status 0
% 0.15/10.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/10.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.46 % No SInE strategy applied
% 0.15/10.46 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/10.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/10.46 % Preprocessing time : 0.001 s
% 0.15/10.46 % Presaturation interreduction done
% 0.15/10.46
% 0.15/10.46 % Proof found!
% 0.15/10.46 % SZS status Unsatisfiable
% 0.15/10.46 % SZS output start CNFRefutation
% See solution above
% 0.15/10.46 % Parsed axioms : 25
% 0.15/10.46 % Removed by relevancy pruning/SinE : 0
% 0.15/10.46 % Initial clauses : 38
% 0.15/10.46 % Removed in clause preprocessing : 16
% 0.15/10.46 % Initial clauses in saturation : 22
% 0.15/10.46 % Processed clauses : 78
% 0.15/10.46 % ...of these trivial : 0
% 0.15/10.46 % ...subsumed : 7
% 0.15/10.46 % ...remaining for further processing : 71
% 0.15/10.46 % Other redundant clauses eliminated : 0
% 0.15/10.46 % Clauses deleted for lack of memory : 0
% 0.15/10.46 % Backward-subsumed : 22
% 0.15/10.46 % Backward-rewritten : 0
% 0.15/10.46 % Generated clauses : 68
% 0.15/10.46 % ...of the previous two non-redundant : 62
% 0.15/10.46 % ...aggressively subsumed : 0
% 0.15/10.46 % Contextual simplify-reflections : 5
% 0.15/10.46 % Paramodulations : 67
% 0.15/10.46 % Factorizations : 0
% 0.15/10.46 % NegExts : 0
% 0.15/10.46 % Equation resolutions : 0
% 0.15/10.46 % Disequality decompositions : 0
% 0.15/10.46 % Total rewrite steps : 0
% 0.15/10.46 % ...of those cached : 0
% 0.15/10.46 % Propositional unsat checks : 0
% 0.15/10.46 % Propositional check models : 0
% 0.15/10.46 % Propositional check unsatisfiable : 0
% 0.15/10.46 % Propositional clauses : 0
% 0.15/10.46 % Propositional clauses after purity: 0
% 0.15/10.46 % Propositional unsat core size : 0
% 0.15/10.46 % Propositional preprocessing time : 0.000
% 0.15/10.46 % Propositional encoding time : 0.000
% 0.15/10.46 % Propositional solver time : 0.000
% 0.15/10.46 % Success case prop preproc time : 0.000
% 0.15/10.46 % Success case prop encoding time : 0.000
% 0.15/10.46 % Success case prop solver time : 0.000
% 0.15/10.46 % Current number of processed clauses : 26
% 0.15/10.46 % Positive orientable unit clauses : 0
% 0.15/10.46 % Positive unorientable unit clauses: 0
% 0.15/10.46 % Negative unit clauses : 3
% 0.15/10.46 % Non-unit-clauses : 23
% 0.15/10.46 % Current number of unprocessed clauses: 28
% 0.15/10.46 % ...number of literals in the above : 130
% 0.15/10.46 % Current number of archived formulas : 0
% 0.15/10.46 % Current number of archived clauses : 46
% 0.15/10.46 % Clause-clause subsumption calls (NU) : 625
% 0.15/10.46 % Rec. Clause-clause subsumption calls : 364
% 0.15/10.46 % Non-unit clause-clause subsumptions : 12
% 0.15/10.46 % Unit Clause-clause subsumption calls : 25
% 0.15/10.46 % Rewrite failures with RHS unbound : 0
% 0.15/10.46 % BW rewrite match attempts : 0
% 0.15/10.46 % BW rewrite match successes : 0
% 0.15/10.46 % Condensation attempts : 0
% 0.15/10.46 % Condensation successes : 0
% 0.15/10.46 % Termbank termtop insertions : 3696
% 0.15/10.46 % Search garbage collected termcells : 617
% 0.15/10.46
% 0.15/10.46 % -------------------------------------------------
% 0.15/10.46 % User time : 0.007 s
% 0.15/10.46 % System time : 0.004 s
% 0.15/10.46 % Total time : 0.011 s
% 0.15/10.46 % Maximum resident set size: 3660 pages
% 0.15/10.46
% 0.15/10.46 % -------------------------------------------------
% 0.15/10.46 % User time : 0.026 s
% 0.15/10.46 % System time : 0.011 s
% 0.15/10.46 % Total time : 0.037 s
% 0.15/10.46 % Maximum resident set size: 4864 pages
% 0.15/10.46 % E exiting
%------------------------------------------------------------------------------