%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS233+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:01:56 PM UTC 2026
% Result : Theorem 111.18s 16.71s
% Output : CNFRefutation 111.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 6 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 75 ( 31 ~; 27 |; 8 &)
% ( 5 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 35 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',completeness) ).
fof(nevera,axiom,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
=> ~ status(X1,X2,X8) )
<=> nevera(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(csa,axiom,
! [X1,X2] :
( ? [X3] :
( model(X3,not(X2))
& model(X3,X1) )
<=> status(X1,X2,csa) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',csa) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(nevera_csa_thm,conjecture,
nevera(csa,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera_csa_thm) ).
fof(c_0_5,plain,
! [X9,X10] :
~ ( model(X9,X10)
<=> model(X9,not(X10)) ),
inference(fof_simplification,[status(thm)],[completeness]) ).
fof(c_0_6,plain,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
=> ~ status(X1,X2,X8) )
<=> nevera(X7,X8) ),
inference(fof_simplification,[status(thm)],[nevera]) ).
fof(c_0_7,plain,
! [X68,X69] :
( ( model(X68,not(X69))
| model(X68,X69) )
& ( ~ model(X68,not(X69))
| ~ model(X68,X69) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X25,X26,X27,X28,X29] :
( ( ~ status(X28,X29,csa)
| model(esk4_2(X28,X29),not(X29)) )
& ( ~ status(X28,X29,csa)
| model(esk4_2(X28,X29),X28) )
& ( status(X25,X26,csa)
| ~ model(X27,not(X26))
| ~ model(X27,X25) ) ),
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)],[csa])])])])])])]) ).
fof(c_0_9,plain,
! [X19,X20,X22,X23,X24] :
( ( model(X24,X23)
| ~ model(X24,X22)
| ~ status(X22,X23,thm) )
& ( status(X19,X20,thm)
| ~ model(esk3_2(X19,X20),X20) )
& ( status(X19,X20,thm)
| model(esk3_2(X19,X20),X19) ) ),
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)],[thm])])])])])])]) ).
fof(c_0_10,plain,
! [X11,X12,X15,X16,X17,X18] :
( ( ~ status(X17,X18,X16)
| ~ status(X17,X18,X15)
| ~ nevera(X15,X16) )
& ( nevera(X11,X12)
| status(esk1_2(X11,X12),esk2_2(X11,X12),X12) )
& ( nevera(X11,X12)
| status(esk1_2(X11,X12),esk2_2(X11,X12),X11) ) ),
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_6])])])])])])]) ).
cnf(c_0_11,plain,
( ~ model(X1,not(X2))
| ~ model(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ status(X1,X2,csa)
| model(esk4_2(X1,X2),not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ model(X3,X1)
| ~ status(X1,X2,thm)
| model(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( nevera(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
~ nevera(csa,thm),
inference(assume_negation,[status(cth)],[nevera_csa_thm]) ).
cnf(c_0_16,plain,
( ~ model(esk4_2(X1,X2),X2)
| ~ status(X1,X2,csa) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ model(X2,esk1_2(X1,thm))
| model(X2,esk2_2(X1,thm))
| nevera(X1,thm) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,negated_conjecture,
~ nevera(csa,thm),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ model(esk4_2(X2,esk2_2(X1,thm)),esk1_2(X1,thm))
| ~ status(X2,esk2_2(X1,thm),csa)
| nevera(X1,thm) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ status(X1,X2,csa)
| model(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_21,negated_conjecture,
~ nevera(csa,thm),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( ~ status(esk1_2(X1,thm),esk2_2(X1,thm),csa)
| nevera(X1,thm) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( nevera(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
~ nevera(csa,thm),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS233+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.34 % Computer : n010.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sun Sep 20 22:57:54 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 Running first-order theorem proving
% 0.11/0.38 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
% 111.18/16.71 % Version: 3.5.1
% 111.18/16.71 % Preprocessing class: FSMSSMSMSSSNFFN.
% 111.18/16.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 111.18/16.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 111.18/16.71 % Starting new_bool_3 with 300s (1) cores
% 111.18/16.71 % Starting new_bool_1 with 300s (1) cores
% 111.18/16.71 % Starting sh5l with 300s (1) cores
% 111.18/16.71 % sh5l with pid 3695302 completed with status 0
% 111.18/16.71 % Result found by sh5l
% 111.18/16.71 % Preprocessing class: FSMSSMSMSSSNFFN.
% 111.18/16.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 111.18/16.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 111.18/16.71 % Starting new_bool_3 with 300s (1) cores
% 111.18/16.71 % Starting new_bool_1 with 300s (1) cores
% 111.18/16.71 % Starting sh5l with 300s (1) cores
% 111.18/16.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 111.18/16.71 % SinE strategy is gf500_gu_R04_F100_L20000
% 111.18/16.71 % Search class: FGHNF-FFMM21-SFFFFFNN
% 111.18/16.71 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 111.18/16.71 % Starting SubtermCWHack with 31s (1) cores
% 111.18/16.71 % SubtermCWHack with pid 3695305 completed with status 0
% 111.18/16.71 % Result found by SubtermCWHack
% 111.18/16.71 % Preprocessing class: FSMSSMSMSSSNFFN.
% 111.18/16.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 111.18/16.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 111.18/16.71 % Starting new_bool_3 with 300s (1) cores
% 111.18/16.71 % Starting new_bool_1 with 300s (1) cores
% 111.18/16.71 % Starting sh5l with 300s (1) cores
% 111.18/16.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 111.18/16.71 % SinE strategy is gf500_gu_R04_F100_L20000
% 111.18/16.71 % Search class: FGHNF-FFMM21-SFFFFFNN
% 111.18/16.71 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 111.18/16.71 % Starting SubtermCWHack with 31s (1) cores
% 111.18/16.71 % Preprocessing time : 0.002 s
% 111.18/16.71
% 111.18/16.71 % Proof found!
% 111.18/16.71 % SZS status Theorem
% 111.18/16.71 % SZS output start CNFRefutation
% See solution above
% 111.18/16.71 % Parsed axioms : 33
% 111.18/16.71 % Removed by relevancy pruning/SinE : 19
% 111.18/16.71 % Initial clauses : 37
% 111.18/16.71 % Removed in clause preprocessing : 0
% 111.18/16.71 % Initial clauses in saturation : 37
% 111.18/16.71 % Processed clauses : 51887
% 111.18/16.71 % ...of these trivial : 728
% 111.18/16.71 % ...subsumed : 46746
% 111.18/16.71 % ...remaining for further processing : 4413
% 111.18/16.71 % Other redundant clauses eliminated : 0
% 111.18/16.71 % Clauses deleted for lack of memory : 0
% 111.18/16.71 % Backward-subsumed : 264
% 111.18/16.71 % Backward-rewritten : 87
% 111.18/16.71 % Generated clauses : 699825
% 111.18/16.71 % ...of the previous two non-redundant : 625319
% 111.18/16.71 % ...aggressively subsumed : 0
% 111.18/16.71 % Contextual simplify-reflections : 162
% 111.18/16.71 % Paramodulations : 699695
% 111.18/16.71 % Factorizations : 130
% 111.18/16.71 % NegExts : 0
% 111.18/16.71 % Equation resolutions : 0
% 111.18/16.71 % Disequality decompositions : 0
% 111.18/16.71 % Total rewrite steps : 82823
% 111.18/16.71 % ...of those cached : 81900
% 111.18/16.71 % Propositional unsat checks : 0
% 111.18/16.71 % Propositional check models : 0
% 111.18/16.71 % Propositional check unsatisfiable : 0
% 111.18/16.71 % Propositional clauses : 0
% 111.18/16.71 % Propositional clauses after purity: 0
% 111.18/16.71 % Propositional unsat core size : 0
% 111.18/16.71 % Propositional preprocessing time : 0.000
% 111.18/16.71 % Propositional encoding time : 0.000
% 111.18/16.71 % Propositional solver time : 0.000
% 111.18/16.71 % Success case prop preproc time : 0.000
% 111.18/16.71 % Success case prop encoding time : 0.000
% 111.18/16.71 % Success case prop solver time : 0.000
% 111.18/16.71 % Current number of processed clauses : 4062
% 111.18/16.71 % Positive orientable unit clauses : 521
% 111.18/16.71 % Positive unorientable unit clauses: 0
% 111.18/16.71 % Negative unit clauses : 131
% 111.18/16.71 % Non-unit-clauses : 3410
% 111.18/16.71 % Current number of unprocessed clauses: 571091
% 111.18/16.71 % ...number of literals in the above : 2281812
% 111.18/16.71 % Current number of archived formulas : 0
% 111.18/16.71 % Current number of archived clauses : 351
% 111.18/16.71 % Clause-clause subsumption calls (NU) : 2010019
% 111.18/16.71 % Rec. Clause-clause subsumption calls : 1079791
% 111.18/16.71 % Non-unit clause-clause subsumptions : 18043
% 111.18/16.71 % Unit Clause-clause subsumption calls : 13063
% 111.18/16.71 % Rewrite failures with RHS unbound : 0
% 111.18/16.71 % BW rewrite match attempts : 9313
% 111.18/16.71 % BW rewrite match successes : 41
% 111.18/16.71 % Condensation attempts : 0
% 111.18/16.71 % Condensation successes : 0
% 111.18/16.71 % Termbank termtop insertions : 10802839
% 111.18/16.71 % Search garbage collected termcells : 686
% 111.18/16.71
% 111.18/16.71 % -------------------------------------------------
% 111.18/16.71 % User time : 15.325 s
% 111.18/16.71 % System time : 0.515 s
% 111.18/16.71 % Total time : 15.840 s
% 111.18/16.71 % Maximum resident set size: 3680 pages
% 111.18/16.71
% 111.18/16.71 % -------------------------------------------------
% 111.18/16.71 % User time : 15.325 s
% 111.18/16.71 % System time : 0.520 s
% 111.18/16.71 % Total time : 15.846 s
% 111.18/16.71 % Maximum resident set size: 4864 pages
% 111.18/16.71 % E exiting
%------------------------------------------------------------------------------