%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS216+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 : n007.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:10 PM UTC 2026
% Result : Theorem 0.16s 0.53s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 17 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 75 ( 32 ~; 26 |; 10 &)
% ( 5 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 5 sgn 39 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',completeness) ).
fof(contradiction,axiom,
? [X10] :
! [X9] : ~ model(X9,X10),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',contradiction) ).
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(tautology,axiom,
? [X10] :
! [X9] : model(X9,X10),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',tautology) ).
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(nota_uns_thm,conjecture,
nota(uns,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_uns_thm) ).
fof(nota,axiom,
! [X7,X8] :
( ? [X1,X2] :
( ~ status(X1,X2,X8)
& status(X1,X2,X7) )
<=> nota(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).
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,
? [X10] :
! [X9] : ~ model(X9,X10),
inference(fof_simplification,[status(thm)],[contradiction]) ).
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,
! [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_7])])]) ).
fof(c_0_11,plain,
! [X39] : ~ model(X39,esk10_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])]) ).
cnf(c_0_12,plain,
( ~ model(esk3_2(X1,X2),X2)
| status(X1,X2,thm) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( model(X1,not(X2))
| model(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
~ model(X1,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( model(esk3_2(X1,not(X2)),X2)
| status(X1,not(X2),thm) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ model(X3,X1)
| ~ status(X1,X2,thm)
| model(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
status(X1,not(esk10_0),thm),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X34] : model(X34,esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[tautology])]) ).
fof(c_0_19,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])])])])])])]) ).
cnf(c_0_20,plain,
( ~ model(X1,X2)
| model(X1,not(esk10_0)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
model(X1,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,negated_conjecture,
~ nota(uns,thm),
inference(assume_negation,[status(cth)],[nota_uns_thm]) ).
fof(c_0_23,plain,
! [X7,X8] :
( ? [X1,X2] :
( ~ status(X1,X2,X8)
& status(X1,X2,X7) )
<=> nota(X7,X8) ),
inference(fof_simplification,[status(thm)],[nota]) ).
cnf(c_0_24,plain,
( ~ model(esk5_2(X1,X2),not(X2))
| ~ model(esk4_2(X1,X2),X1)
| status(X1,X2,uns) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
model(X1,not(esk10_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,negated_conjecture,
~ nota(uns,thm),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_27,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ nota(X15,X16)
| ~ status(esk1_2(X15,X16),esk2_2(X15,X16),X16) )
& ( ~ nota(X15,X16)
| status(esk1_2(X15,X16),esk2_2(X15,X16),X15) )
& ( nota(X11,X12)
| status(X13,X14,X12)
| ~ status(X13,X14,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_23])])])])])])]) ).
cnf(c_0_28,plain,
( ~ model(esk4_2(X1,esk10_0),X1)
| status(X1,esk10_0,uns) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,negated_conjecture,
~ nota(uns,thm),
inference(fof_nnf,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
( ~ status(X1,X2,X3)
| nota(X3,X4)
| status(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
status(esk6_0,esk10_0,uns),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_32,negated_conjecture,
~ nota(uns,thm),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
( status(esk6_0,esk10_0,X1)
| nota(uns,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
status(esk6_0,esk10_0,thm),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_34]),c_0_21])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KRS216+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.13/0.36 % Computer : n007.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8046.5625MB
% 0.13/0.36 % OS : Linux 6.8.0-71-generic
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun Sep 20 22:55:05 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.46 Running first-order theorem proving
% 0.16/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.16/0.53 % Version: 3.5.1
% 0.16/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 % Starting sh5l with 300s (1) cores
% 0.16/0.53 % new_bool_1 with pid 3769046 completed with status 0
% 0.16/0.53 % Result found by new_bool_1
% 0.16/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.53 % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.16/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.53 % SubtermCWHack with pid 3769048 completed with status 0
% 0.16/0.53 % Result found by SubtermCWHack
% 0.16/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.53 % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.16/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.53 % Preprocessing time : 0.002 s
% 0.16/0.53
% 0.16/0.53 % Proof found!
% 0.16/0.53 % SZS status Theorem
% 0.16/0.53 % SZS output start CNFRefutation
% See solution above
% 0.16/0.53 % Parsed axioms : 33
% 0.16/0.53 % Removed by relevancy pruning/SinE : 21
% 0.16/0.53 % Initial clauses : 29
% 0.16/0.53 % Removed in clause preprocessing : 0
% 0.16/0.53 % Initial clauses in saturation : 29
% 0.16/0.53 % Processed clauses : 101
% 0.16/0.53 % ...of these trivial : 2
% 0.16/0.53 % ...subsumed : 26
% 0.16/0.53 % ...remaining for further processing : 73
% 0.16/0.53 % Other redundant clauses eliminated : 0
% 0.16/0.53 % Clauses deleted for lack of memory : 0
% 0.16/0.53 % Backward-subsumed : 0
% 0.16/0.53 % Backward-rewritten : 7
% 0.16/0.53 % Generated clauses : 159
% 0.16/0.53 % ...of the previous two non-redundant : 110
% 0.16/0.53 % ...aggressively subsumed : 0
% 0.16/0.53 % Contextual simplify-reflections : 0
% 0.16/0.53 % Paramodulations : 153
% 0.16/0.53 % Factorizations : 6
% 0.16/0.53 % NegExts : 0
% 0.16/0.53 % Equation resolutions : 0
% 0.16/0.53 % Disequality decompositions : 0
% 0.16/0.53 % Total rewrite steps : 56
% 0.16/0.53 % ...of those cached : 26
% 0.16/0.53 % Propositional unsat checks : 0
% 0.16/0.53 % Propositional check models : 0
% 0.16/0.53 % Propositional check unsatisfiable : 0
% 0.16/0.53 % Propositional clauses : 0
% 0.16/0.53 % Propositional clauses after purity: 0
% 0.16/0.53 % Propositional unsat core size : 0
% 0.16/0.53 % Propositional preprocessing time : 0.000
% 0.16/0.53 % Propositional encoding time : 0.000
% 0.16/0.53 % Propositional solver time : 0.000
% 0.16/0.53 % Success case prop preproc time : 0.000
% 0.16/0.53 % Success case prop encoding time : 0.000
% 0.16/0.53 % Success case prop solver time : 0.000
% 0.16/0.53 % Current number of processed clauses : 66
% 0.16/0.53 % Positive orientable unit clauses : 20
% 0.16/0.53 % Positive unorientable unit clauses: 0
% 0.16/0.53 % Negative unit clauses : 8
% 0.16/0.53 % Non-unit-clauses : 38
% 0.16/0.53 % Current number of unprocessed clauses: 34
% 0.16/0.53 % ...number of literals in the above : 91
% 0.16/0.53 % Current number of archived formulas : 0
% 0.16/0.53 % Current number of archived clauses : 7
% 0.16/0.53 % Clause-clause subsumption calls (NU) : 116
% 0.16/0.53 % Rec. Clause-clause subsumption calls : 95
% 0.16/0.53 % Non-unit clause-clause subsumptions : 17
% 0.16/0.53 % Unit Clause-clause subsumption calls : 31
% 0.16/0.53 % Rewrite failures with RHS unbound : 0
% 0.16/0.53 % BW rewrite match attempts : 14
% 0.16/0.53 % BW rewrite match successes : 7
% 0.16/0.53 % Condensation attempts : 0
% 0.16/0.53 % Condensation successes : 0
% 0.16/0.53 % Termbank termtop insertions : 3390
% 0.16/0.53 % Search garbage collected termcells : 536
% 0.16/0.53
% 0.16/0.53 % -------------------------------------------------
% 0.16/0.53 % User time : 0.013 s
% 0.16/0.53 % System time : 0.005 s
% 0.16/0.53 % Total time : 0.018 s
% 0.16/0.53 % Maximum resident set size: 3636 pages
% 0.16/0.53
% 0.16/0.53 % -------------------------------------------------
% 0.16/0.53 % User time : 0.016 s
% 0.16/0.53 % System time : 0.011 s
% 0.16/0.53 % Total time : 0.028 s
% 0.16/0.53 % Maximum resident set size: 4608 pages
% 0.16/0.53 % E exiting
%------------------------------------------------------------------------------