%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS119+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 : n008.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.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 126 ( 53 ~; 49 |; 16 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 63 ( 2 sgn 31 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_5,axiom,
! [X4] :
( ca_Ax2(X4)
<=> ( ! [X5] :
( rinvR(X4,X5)
=> cp1xcomp(X5) )
& cp1(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_10,axiom,
! [X4,X5,X8] :
( ( rr(X5,X8)
& rr(X4,X5) )
=> rr(X4,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_6,axiom,
! [X4] :
( ca_Vx3(X4)
<=> ? [X5] :
( ca_Ax2(X5)
& rr(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cp1xcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( ca_Vx3(X5)
& rr(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_21_44786),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_8,plain,
! [X71,X72,X73] :
( ( ca_Ax2(X73)
| ~ cp1(X73)
| ~ cp1xcomp(esk4_1(X73)) )
& ( ca_Ax2(X73)
| ~ cp1(X73)
| rinvR(X73,esk4_1(X73)) )
& ( ~ ca_Ax2(X71)
| cp1xcomp(X72)
| ~ rinvR(X71,X72) )
& ( ~ ca_Ax2(X71)
| cp1(X71) ) ),
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,
! [X84,X85] :
( ( rinvR(X84,X85)
| ~ rr(X85,X84) )
& ( rr(X85,X84)
| ~ rinvR(X84,X85) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])])]) ).
fof(c_0_10,plain,
! [X86,X87,X88] :
( rr(X86,X88)
| ~ rr(X87,X88)
| ~ rr(X86,X87) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])])]) ).
fof(c_0_11,plain,
! [X75,X77,X78] :
( ( ca_Vx3(X77)
| ~ ca_Ax2(X78)
| ~ rr(X77,X78) )
& ( ~ ca_Vx3(X75)
| ca_Ax2(esk5_1(X75)) )
& ( ~ ca_Vx3(X75)
| rr(X75,esk5_1(X75)) ) ),
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])])])])])])]) ).
fof(c_0_12,plain,
! [X63,X64,X65] :
( ( cp1(X65)
| ra_Px1(X65,esk2_1(X65)) )
& ( ~ ra_Px1(X63,X64)
| ~ cp1(X63) ) ),
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_13,plain,
! [X67,X69,X70] :
( ( cp1xcomp(X69)
| ~ ra_Px1(X69,X70) )
& ( ra_Px1(X67,esk3_1(X67))
| ~ cp1xcomp(X67) ) ),
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_14,plain,
( ~ ca_Ax2(X1)
| ~ rinvR(X1,X2)
| cp1xcomp(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ rr(X1,X2)
| rinvR(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ rr(X2,X3)
| ~ rr(X1,X2)
| rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ ca_Vx3(X1)
| rr(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ ra_Px1(X1,X2)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ cp1xcomp(X1)
| ra_Px1(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ ca_Ax2(X2)
| ~ rr(X1,X2)
| cp1xcomp(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ ca_Vx3(X1)
| ca_Ax2(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( ~ ca_Ax2(X2)
| ~ rr(X1,X2)
| ca_Vx3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
( ~ ca_Vx3(X2)
| ~ rr(X1,X2)
| rr(X1,esk5_1(X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_24,plain,
! [X59,X61,X62] :
( ( cUnsatisfiable(X61)
| ~ cp1(X61)
| ~ ca_Vx3(X62)
| ~ rr(X61,X62) )
& ( ~ cUnsatisfiable(X59)
| cp1(X59) )
& ( ~ cUnsatisfiable(X59)
| ca_Vx3(esk1_1(X59)) )
& ( ~ cUnsatisfiable(X59)
| rr(X59,esk1_1(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])])])])])])]) ).
cnf(c_0_25,plain,
( ~ cp1(X1)
| ~ cp1xcomp(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ ca_Vx3(X1)
| cp1xcomp(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_21]) ).
cnf(c_0_27,plain,
( ~ ca_Vx3(X2)
| ~ rr(X1,X2)
| ca_Vx3(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]) ).
cnf(c_0_28,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( ~ cUnsatisfiable(X1)
| ca_Vx3(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ ca_Vx3(X1)
| ~ cp1(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( ~ cUnsatisfiable(X1)
| ca_Vx3(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
( ~ cUnsatisfiable(X1)
| cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
cUnsatisfiable(i2003_11_14_17_21_44786),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
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 : KRS119+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.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 22:54:57 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.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.16/0.45 % Version: 3.5.1
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % Starting sh5l with 300s (1) cores
% 0.16/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3777023 completed with status 0
% 0.16/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.45 % No SInE strategy applied
% 0.16/0.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.16/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.16/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3777039 completed with status 0
% 0.16/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.45 % No SInE strategy applied
% 0.16/0.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.16/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45 % Preprocessing time : 0.001 s
% 0.16/0.45 % Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 % Proof found!
% 0.16/0.45 % SZS status Unsatisfiable
% 0.16/0.45 % SZS output start CNFRefutation
% See solution above
% 0.16/0.45 % Parsed axioms : 31
% 0.16/0.45 % Removed by relevancy pruning/SinE : 0
% 0.16/0.45 % Initial clauses : 45
% 0.16/0.45 % Removed in clause preprocessing : 20
% 0.16/0.45 % Initial clauses in saturation : 25
% 0.16/0.45 % Processed clauses : 70
% 0.16/0.45 % ...of these trivial : 0
% 0.16/0.45 % ...subsumed : 1
% 0.16/0.45 % ...remaining for further processing : 69
% 0.16/0.45 % Other redundant clauses eliminated : 0
% 0.16/0.45 % Clauses deleted for lack of memory : 0
% 0.16/0.45 % Backward-subsumed : 7
% 0.16/0.45 % Backward-rewritten : 0
% 0.16/0.45 % Generated clauses : 46
% 0.16/0.45 % ...of the previous two non-redundant : 33
% 0.16/0.45 % ...aggressively subsumed : 0
% 0.16/0.45 % Contextual simplify-reflections : 4
% 0.16/0.45 % Paramodulations : 45
% 0.16/0.45 % Factorizations : 0
% 0.16/0.45 % NegExts : 0
% 0.16/0.45 % Equation resolutions : 0
% 0.16/0.45 % Disequality decompositions : 0
% 0.16/0.45 % Total rewrite steps : 0
% 0.16/0.45 % ...of those cached : 0
% 0.16/0.45 % Propositional unsat checks : 0
% 0.16/0.45 % Propositional check models : 0
% 0.16/0.45 % Propositional check unsatisfiable : 0
% 0.16/0.45 % Propositional clauses : 0
% 0.16/0.45 % Propositional clauses after purity: 0
% 0.16/0.45 % Propositional unsat core size : 0
% 0.16/0.45 % Propositional preprocessing time : 0.000
% 0.16/0.45 % Propositional encoding time : 0.000
% 0.16/0.45 % Propositional solver time : 0.000
% 0.16/0.45 % Success case prop preproc time : 0.000
% 0.16/0.45 % Success case prop encoding time : 0.000
% 0.16/0.45 % Success case prop solver time : 0.000
% 0.16/0.45 % Current number of processed clauses : 36
% 0.16/0.45 % Positive orientable unit clauses : 1
% 0.16/0.45 % Positive unorientable unit clauses: 0
% 0.16/0.45 % Negative unit clauses : 2
% 0.16/0.45 % Non-unit-clauses : 33
% 0.16/0.45 % Current number of unprocessed clauses: 13
% 0.16/0.45 % ...number of literals in the above : 45
% 0.16/0.45 % Current number of archived formulas : 0
% 0.16/0.45 % Current number of archived clauses : 34
% 0.16/0.45 % Clause-clause subsumption calls (NU) : 311
% 0.16/0.45 % Rec. Clause-clause subsumption calls : 233
% 0.16/0.45 % Non-unit clause-clause subsumptions : 6
% 0.16/0.45 % Unit Clause-clause subsumption calls : 8
% 0.16/0.45 % Rewrite failures with RHS unbound : 0
% 0.16/0.45 % BW rewrite match attempts : 0
% 0.16/0.45 % BW rewrite match successes : 0
% 0.16/0.45 % Condensation attempts : 0
% 0.16/0.45 % Condensation successes : 0
% 0.16/0.45 % Termbank termtop insertions : 3658
% 0.16/0.45 % Search garbage collected termcells : 751
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.008 s
% 0.16/0.45 % System time : 0.004 s
% 0.16/0.45 % Total time : 0.012 s
% 0.16/0.45 % Maximum resident set size: 3620 pages
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.023 s
% 0.16/0.45 % System time : 0.013 s
% 0.16/0.45 % Total time : 0.036 s
% 0.16/0.45 % Maximum resident set size: 4608 pages
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------