%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS234+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 : n017.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 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% 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 : 71 ( 28 ~; 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 : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 8 sgn 38 !; 0 ?)
% 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(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',completeness) ).
fof(uns,axiom,
! [X1,X2] :
( ( ! [X4] : model(X4,not(X2))
& ! [X3] : model(X3,X1) )
<=> status(X1,X2,uns) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',uns) ).
fof(nevera_uns_thm,conjecture,
nevera(uns,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera_uns_thm) ).
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,plain,
! [X9,X10] :
~ ( model(X9,X10)
<=> model(X9,not(X10)) ),
inference(fof_simplification,[status(thm)],[completeness]) ).
fof(c_0_7,plain,
! [X25,X26,X29,X30,X31,X32] :
( ( ~ status(X29,X30,uns)
| model(X32,not(X30)) )
& ( ~ status(X29,X30,uns)
| model(X31,X29) )
& ( status(X25,X26,uns)
| ~ model(esk5_2(X25,X26),not(X26))
| ~ model(esk4_2(X25,X26),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)],[uns])])])])])])]) ).
fof(c_0_8,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_5])])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ nevera(uns,thm),
inference(assume_negation,[status(cth)],[nevera_uns_thm]) ).
fof(c_0_10,plain,
! [X54,X55] :
( ( model(X54,not(X55))
| model(X54,X55) )
& ( ~ model(X54,not(X55))
| ~ model(X54,X55) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( ~ status(X3,X2,uns)
| model(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( nevera(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,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_14,negated_conjecture,
~ nevera(uns,thm),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ model(X1,not(X2))
| ~ model(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( model(X2,not(esk2_2(uns,X1)))
| nevera(uns,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ model(X3,X1)
| ~ status(X1,X2,thm)
| model(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( nevera(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_19,negated_conjecture,
~ nevera(uns,thm),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ model(X2,esk2_2(uns,X1))
| nevera(uns,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ model(X2,esk1_2(X1,thm))
| model(X2,esk2_2(X1,thm))
| nevera(X1,thm) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ nevera(uns,thm),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( ~ status(X2,X3,uns)
| model(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,plain,
~ model(X1,esk1_2(uns,thm)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
( model(X2,esk1_2(uns,X1))
| nevera(uns,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS234+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n017.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 22:52:43 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.46 Running first-order theorem proving
% 0.12/0.46 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.22/0.55 % Version: 3.5.1
% 0.22/0.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 % Starting sh5l with 300s (1) cores
% 0.22/0.55 % new_bool_1 with pid 815374 completed with status 0
% 0.22/0.55 % Result found by new_bool_1
% 0.22/0.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.22/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.55 % SubtermCWHack with pid 815383 completed with status 0
% 0.22/0.55 % Result found by SubtermCWHack
% 0.22/0.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.22/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.55 % Preprocessing time : 0.002 s
% 0.22/0.55
% 0.22/0.55 % Proof found!
% 0.22/0.55 % SZS status Theorem
% 0.22/0.55 % SZS output start CNFRefutation
% See solution above
% 0.22/0.55 % Parsed axioms : 33
% 0.22/0.55 % Removed by relevancy pruning/SinE : 21
% 0.22/0.55 % Initial clauses : 29
% 0.22/0.55 % Removed in clause preprocessing : 0
% 0.22/0.55 % Initial clauses in saturation : 29
% 0.22/0.55 % Processed clauses : 91
% 0.22/0.55 % ...of these trivial : 1
% 0.22/0.55 % ...subsumed : 25
% 0.22/0.55 % ...remaining for further processing : 65
% 0.22/0.55 % Other redundant clauses eliminated : 0
% 0.22/0.55 % Clauses deleted for lack of memory : 0
% 0.22/0.55 % Backward-subsumed : 0
% 0.22/0.55 % Backward-rewritten : 7
% 0.22/0.55 % Generated clauses : 120
% 0.22/0.55 % ...of the previous two non-redundant : 106
% 0.22/0.55 % ...aggressively subsumed : 0
% 0.22/0.55 % Contextual simplify-reflections : 0
% 0.22/0.55 % Paramodulations : 120
% 0.22/0.55 % Factorizations : 0
% 0.22/0.55 % NegExts : 0
% 0.22/0.55 % Equation resolutions : 0
% 0.22/0.55 % Disequality decompositions : 0
% 0.22/0.55 % Total rewrite steps : 19
% 0.22/0.55 % ...of those cached : 2
% 0.22/0.55 % Propositional unsat checks : 0
% 0.22/0.55 % Propositional check models : 0
% 0.22/0.55 % Propositional check unsatisfiable : 0
% 0.22/0.55 % Propositional clauses : 0
% 0.22/0.55 % Propositional clauses after purity: 0
% 0.22/0.55 % Propositional unsat core size : 0
% 0.22/0.55 % Propositional preprocessing time : 0.000
% 0.22/0.55 % Propositional encoding time : 0.000
% 0.22/0.55 % Propositional solver time : 0.000
% 0.22/0.55 % Success case prop preproc time : 0.000
% 0.22/0.55 % Success case prop encoding time : 0.000
% 0.22/0.55 % Success case prop solver time : 0.000
% 0.22/0.55 % Current number of processed clauses : 58
% 0.22/0.55 % Positive orientable unit clauses : 15
% 0.22/0.55 % Positive unorientable unit clauses: 0
% 0.22/0.55 % Negative unit clauses : 9
% 0.22/0.55 % Non-unit-clauses : 34
% 0.22/0.55 % Current number of unprocessed clauses: 42
% 0.22/0.55 % ...number of literals in the above : 103
% 0.22/0.55 % Current number of archived formulas : 0
% 0.22/0.55 % Current number of archived clauses : 7
% 0.22/0.55 % Clause-clause subsumption calls (NU) : 59
% 0.22/0.55 % Rec. Clause-clause subsumption calls : 56
% 0.22/0.55 % Non-unit clause-clause subsumptions : 4
% 0.22/0.55 % Unit Clause-clause subsumption calls : 17
% 0.22/0.55 % Rewrite failures with RHS unbound : 0
% 0.22/0.55 % BW rewrite match attempts : 12
% 0.22/0.55 % BW rewrite match successes : 7
% 0.22/0.55 % Condensation attempts : 0
% 0.22/0.55 % Condensation successes : 0
% 0.22/0.55 % Termbank termtop insertions : 3136
% 0.22/0.55 % Search garbage collected termcells : 540
% 0.22/0.55
% 0.22/0.55 % -------------------------------------------------
% 0.22/0.55 % User time : 0.011 s
% 0.22/0.55 % System time : 0.006 s
% 0.22/0.55 % Total time : 0.018 s
% 0.22/0.55 % Maximum resident set size: 3680 pages
% 0.22/0.55
% 0.22/0.55 % -------------------------------------------------
% 0.22/0.55 % User time : 0.015 s
% 0.22/0.55 % System time : 0.013 s
% 0.22/0.55 % Total time : 0.027 s
% 0.22/0.55 % Maximum resident set size: 4864 pages
% 0.22/0.55 % E exiting
%------------------------------------------------------------------------------