%------------------------------------------------------------------------------
% File : E---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 : n002.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:11 PM UTC 2026
% Result : Theorem 63.52s 9.78s
% Output : CNFRefutation 63.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 70 ( 27 ~; 26 |; 8 &)
% ( 5 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 4 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 : 54 ( 0 sgn 35 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(nevera_csa_thm,conjecture,
nevera(csa,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera_csa_thm) ).
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',completeness) ).
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(c_0_5,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_6,negated_conjecture,
~ nevera(csa,thm),
inference(assume_negation,[status(cth)],[nevera_csa_thm]) ).
fof(c_0_7,plain,
! [X9,X10] :
~ ( model(X9,X10)
<=> model(X9,not(X10)) ),
inference(fof_simplification,[status(thm)],[completeness]) ).
fof(c_0_8,plain,
! [X151,X152,X153,X154,X155] :
( ( ~ status(X154,X155,csa)
| model(esk38_2(X154,X155),not(X155)) )
& ( ~ status(X154,X155,csa)
| model(esk38_2(X154,X155),X154) )
& ( status(X151,X152,csa)
| ~ model(X153,not(X152))
| ~ model(X153,X151) ) ),
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,
! [X197,X198,X201,X202,X203,X204] :
( ( ~ status(X203,X204,X202)
| ~ status(X203,X204,X201)
| ~ nevera(X201,X202) )
& ( nevera(X197,X198)
| status(esk49_2(X197,X198),esk50_2(X197,X198),X198) )
& ( nevera(X197,X198)
| status(esk49_2(X197,X198),esk50_2(X197,X198),X197) ) ),
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_5])])])])])])]) ).
fof(c_0_10,plain,
! [X45,X46,X48,X49,X50] :
( ( model(X50,X49)
| ~ model(X50,X48)
| ~ status(X48,X49,thm) )
& ( status(X45,X46,thm)
| ~ model(esk10_2(X45,X46),X46) )
& ( status(X45,X46,thm)
| model(esk10_2(X45,X46),X45) ) ),
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_11,negated_conjecture,
~ nevera(csa,thm),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X215,X216] :
( ( model(X215,not(X216))
| model(X215,X216) )
& ( ~ model(X215,not(X216))
| ~ model(X215,X216) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_13,plain,
( ~ status(X1,X2,csa)
| model(esk38_2(X1,X2),not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( nevera(X1,X2)
| status(esk49_2(X1,X2),esk50_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ model(X3,X1)
| ~ status(X1,X2,thm)
| model(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( nevera(X1,X2)
| status(esk49_2(X1,X2),esk50_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ status(X1,X2,csa)
| model(esk38_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_18,negated_conjecture,
~ nevera(csa,thm),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ model(X1,not(X2))
| ~ model(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( model(esk38_2(esk49_2(csa,X1),esk50_2(csa,X1)),not(esk50_2(csa,X1)))
| nevera(csa,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( ~ model(X2,esk49_2(X1,thm))
| model(X2,esk50_2(X1,thm))
| nevera(X1,thm) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( model(esk38_2(esk49_2(csa,X1),esk50_2(csa,X1)),esk49_2(csa,X1))
| nevera(csa,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
~ nevera(csa,thm),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( ~ model(esk38_2(esk49_2(csa,X1),esk50_2(csa,X1)),esk50_2(csa,X1))
| nevera(csa,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
model(esk38_2(esk49_2(csa,thm),esk50_2(csa,thm)),esk50_2(csa,thm)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS233+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n002.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sun Sep 20 23:00:16 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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
% 63.52/9.78 % Version: 3.5.1
% 63.52/9.78 % Preprocessing class: FSMSSMSMSSSNFFN.
% 63.52/9.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.52/9.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 63.52/9.78 % Starting new_bool_3 with 300s (1) cores
% 63.52/9.78 % Starting new_bool_1 with 300s (1) cores
% 63.52/9.78 % Starting sh5l with 300s (1) cores
% 63.52/9.78 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1891972 completed with status 0
% 63.52/9.78 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 63.52/9.78 % Preprocessing class: FSMSSMSMSSSNFFN.
% 63.52/9.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.52/9.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 63.52/9.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 63.52/9.78 % No SInE strategy applied
% 63.52/9.78 % Search class: FGHNF-FFMM21-SFFFFFNN
% 63.52/9.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 63.52/9.78 % Starting SubtermCWHack with 136s (1) cores
% 63.52/9.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 63.52/9.78 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S with 191s (1) cores
% 63.52/9.78 % Starting new_bool_3 with 191s (1) cores
% 63.52/9.78 % Starting new_bool_1 with 191s (1) cores
% 63.52/9.78 % G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 1891981 completed with status 0
% 63.52/9.78 % Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S
% 63.52/9.78 % Preprocessing class: FSMSSMSMSSSNFFN.
% 63.52/9.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.52/9.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 63.52/9.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 63.52/9.78 % No SInE strategy applied
% 63.52/9.78 % Search class: FGHNF-FFMM21-SFFFFFNN
% 63.52/9.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 63.52/9.78 % Starting SubtermCWHack with 136s (1) cores
% 63.52/9.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 63.52/9.78 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S with 191s (1) cores
% 63.52/9.78 % Preprocessing time : 0.002 s
% 63.52/9.78 % Presaturation interreduction done
% 63.52/9.78
% 63.52/9.78 % Proof found!
% 63.52/9.78 % SZS status Theorem
% 63.52/9.78 % SZS output start CNFRefutation
% See solution above
% 63.52/9.78 % Parsed axioms : 33
% 63.52/9.78 % Removed by relevancy pruning/SinE : 0
% 63.52/9.78 % Initial clauses : 109
% 63.52/9.78 % Removed in clause preprocessing : 0
% 63.52/9.78 % Initial clauses in saturation : 109
% 63.52/9.78 % Processed clauses : 24687
% 63.52/9.78 % ...of these trivial : 5344
% 63.52/9.78 % ...subsumed : 11313
% 63.52/9.78 % ...remaining for further processing : 8030
% 63.52/9.78 % Other redundant clauses eliminated : 0
% 63.52/9.78 % Clauses deleted for lack of memory : 0
% 63.52/9.78 % Backward-subsumed : 309
% 63.52/9.78 % Backward-rewritten : 226
% 63.52/9.78 % Generated clauses : 660665
% 63.52/9.78 % ...of the previous two non-redundant : 488836
% 63.52/9.78 % ...aggressively subsumed : 0
% 63.52/9.78 % Contextual simplify-reflections : 13
% 63.52/9.78 % Paramodulations : 660279
% 63.52/9.78 % Factorizations : 386
% 63.52/9.78 % NegExts : 0
% 63.52/9.78 % Equation resolutions : 0
% 63.52/9.78 % Disequality decompositions : 0
% 63.52/9.78 % Total rewrite steps : 199529
% 63.52/9.78 % ...of those cached : 196420
% 63.52/9.78 % Propositional unsat checks : 0
% 63.52/9.78 % Propositional check models : 0
% 63.52/9.78 % Propositional check unsatisfiable : 0
% 63.52/9.78 % Propositional clauses : 0
% 63.52/9.78 % Propositional clauses after purity: 0
% 63.52/9.78 % Propositional unsat core size : 0
% 63.52/9.79 % Propositional preprocessing time : 0.000
% 63.52/9.79 % Propositional encoding time : 0.000
% 63.52/9.79 % Propositional solver time : 0.000
% 63.52/9.79 % Success case prop preproc time : 0.000
% 63.52/9.79 % Success case prop encoding time : 0.000
% 63.52/9.79 % Success case prop solver time : 0.000
% 63.52/9.79 % Current number of processed clauses : 7388
% 63.52/9.79 % Positive orientable unit clauses : 1572
% 63.52/9.79 % Positive unorientable unit clauses: 0
% 63.52/9.79 % Negative unit clauses : 784
% 63.52/9.79 % Non-unit-clauses : 5032
% 63.52/9.79 % Current number of unprocessed clauses: 453715
% 63.52/9.79 % ...number of literals in the above : 1696282
% 63.52/9.79 % Current number of archived formulas : 0
% 63.52/9.79 % Current number of archived clauses : 642
% 63.52/9.79 % Clause-clause subsumption calls (NU) : 4082176
% 63.52/9.79 % Rec. Clause-clause subsumption calls : 2956514
% 63.52/9.79 % Non-unit clause-clause subsumptions : 10816
% 63.52/9.79 % Unit Clause-clause subsumption calls : 620977
% 63.52/9.79 % Rewrite failures with RHS unbound : 0
% 63.52/9.79 % BW rewrite match attempts : 3610
% 63.52/9.79 % BW rewrite match successes : 204
% 63.52/9.79 % Condensation attempts : 0
% 63.52/9.79 % Condensation successes : 0
% 63.52/9.79 % Termbank termtop insertions : 8627565
% 63.52/9.79 % Search garbage collected termcells : 2399
% 63.52/9.79
% 63.52/9.79 % -------------------------------------------------
% 63.52/9.79 % User time : 8.815 s
% 63.52/9.79 % System time : 0.292 s
% 63.52/9.79 % Total time : 9.107 s
% 63.52/9.79 % Maximum resident set size: 3424 pages
% 63.52/9.79
% 63.52/9.79 % -------------------------------------------------
% 63.52/9.79 % User time : 43.584 s
% 63.52/9.79 % System time : 1.386 s
% 63.52/9.79 % Total time : 44.970 s
% 63.52/9.79 % Maximum resident set size: 4608 pages
% 63.52/9.79 % E exiting
%------------------------------------------------------------------------------