%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS128+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 : n026.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:49 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 110 ( 45 ~; 44 |; 15 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 2 sgn 18 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_9,axiom,
! [X1] :
( ca_Cx4xcomp(X1)
<=> ~ ? [X2] : ra_Px4(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_8,axiom,
! [X1] :
( ca_Cx4(X1)
<=> ? [X3] : ra_Px4(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ! [X2] :
( rr(X1,X2)
=> ca_Cx4(X2) )
& ! [X2] :
( rr(X1,X2)
=> cd(X2) )
& ? [X2] :
( cexcomp(X2)
& rr(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_10,axiom,
! [X1] :
( ca_Cx4xcomp(X1)
<=> ( cexcomp(X1)
& cd(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_22_31584),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_5,plain,
! [X35,X36,X37] :
( ( ca_Cx4xcomp(X37)
| ra_Px4(X37,esk9_1(X37)) )
& ( ~ ra_Px4(X35,X36)
| ~ ca_Cx4xcomp(X35) ) ),
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_9])])])])])]) ).
fof(c_0_6,plain,
! [X31,X33,X34] :
( ( ca_Cx4(X33)
| ~ ra_Px4(X33,X34) )
& ( ra_Px4(X31,esk8_1(X31))
| ~ ca_Cx4(X31) ) ),
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_8])])])])])]) ).
fof(c_0_7,plain,
! [X6,X8,X9,X10,X11] :
( ( cUnsatisfiable(X10)
| ~ cexcomp(X11)
| ~ rr(X10,X11)
| ~ cd(esk2_1(X10))
| ~ ca_Cx4(esk3_1(X10)) )
& ( cUnsatisfiable(X10)
| ~ cexcomp(X11)
| ~ rr(X10,X11)
| ~ cd(esk2_1(X10))
| rr(X10,esk3_1(X10)) )
& ( cUnsatisfiable(X10)
| ~ cexcomp(X11)
| ~ rr(X10,X11)
| rr(X10,esk2_1(X10))
| ~ ca_Cx4(esk3_1(X10)) )
& ( cUnsatisfiable(X10)
| ~ cexcomp(X11)
| ~ rr(X10,X11)
| rr(X10,esk2_1(X10))
| rr(X10,esk3_1(X10)) )
& ( ~ cUnsatisfiable(X6)
| ca_Cx4(X9)
| ~ rr(X6,X9) )
& ( ~ cUnsatisfiable(X6)
| cd(X8)
| ~ rr(X6,X8) )
& ( ~ cUnsatisfiable(X6)
| cexcomp(esk1_1(X6)) )
& ( ~ cUnsatisfiable(X6)
| rr(X6,esk1_1(X6)) ) ),
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_8,plain,
( ~ ra_Px4(X1,X2)
| ~ ca_Cx4xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ ca_Cx4(X1)
| ra_Px4(X1,esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ cUnsatisfiable(X1)
| ~ rr(X1,X2)
| ca_Cx4(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ ca_Cx4(X1)
| ~ ca_Cx4xcomp(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ cUnsatisfiable(X1)
| ca_Cx4(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X39] :
( ( ca_Cx4xcomp(X39)
| ~ cexcomp(X39)
| ~ cd(X39) )
& ( ~ ca_Cx4xcomp(X39)
| cexcomp(X39) )
& ( ~ ca_Cx4xcomp(X39)
| cd(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])])])]) ).
cnf(c_0_15,plain,
( ~ cUnsatisfiable(X1)
| ~ rr(X1,X2)
| cd(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Cx4xcomp(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ cexcomp(X1)
| ~ cd(X1)
| ca_Cx4xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( ~ cUnsatisfiable(X1)
| cexcomp(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( ~ cUnsatisfiable(X1)
| cd(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,plain,
cUnsatisfiable(i2003_11_14_17_22_31584),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_21,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS128+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 22:57:06 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 777368 completed with status 0
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 777378 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 12
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 29
% 0.11/0.44 % Removed in clause preprocessing : 1
% 0.11/0.44 % Initial clauses in saturation : 28
% 0.11/0.44 % Processed clauses : 35
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 0
% 0.11/0.44 % ...remaining for further processing : 35
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 7
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 24
% 0.11/0.44 % ...of the previous two non-redundant : 11
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 2
% 0.11/0.44 % Paramodulations : 23
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 0
% 0.11/0.44 % ...of those cached : 0
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 27
% 0.11/0.44 % Positive orientable unit clauses : 0
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 2
% 0.11/0.44 % Non-unit-clauses : 25
% 0.11/0.44 % Current number of unprocessed clauses: 4
% 0.11/0.44 % ...number of literals in the above : 20
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 9
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 200
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 117
% 0.11/0.44 % Non-unit clause-clause subsumptions : 2
% 0.11/0.44 % Unit Clause-clause subsumption calls : 7
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 0
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 1889
% 0.11/0.44 % Search garbage collected termcells : 453
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.005 s
% 0.11/0.44 % System time : 0.003 s
% 0.11/0.44 % Total time : 0.008 s
% 0.11/0.44 % Maximum resident set size: 3640 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.014 s
% 0.11/0.44 % System time : 0.011 s
% 0.11/0.44 % Total time : 0.025 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------