%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS265+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:14 PM UTC 2026
% Result : Theorem 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 46 ( 21 ~; 15 |; 6 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 4 sgn 26 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(contradiction,axiom,
? [X10] :
! [X9] : ~ model(X9,X10),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(mighta_cax_thm,conjecture,
mighta(cax,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_cax_thm) ).
fof(mighta,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X8)
& status(X1,X2,X7) )
<=> mighta(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',mighta) ).
fof(cax,axiom,
! [X1,X2] :
( ~ ? [X3] : model(X3,X1)
<=> status(X1,X2,cax) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',cax) ).
fof(c_0_5,plain,
? [X10] :
! [X9] : ~ model(X9,X10),
inference(fof_simplification,[status(thm)],[contradiction]) ).
fof(c_0_6,plain,
! [X37] : ~ model(X37,esk9_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,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_8,negated_conjecture,
~ mighta(cax,thm),
inference(assume_negation,[status(cth)],[mighta_cax_thm]) ).
fof(c_0_9,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ mighta(X15,X16)
| status(esk1_2(X15,X16),esk2_2(X15,X16),X16) )
& ( ~ mighta(X15,X16)
| status(esk1_2(X15,X16),esk2_2(X15,X16),X15) )
& ( mighta(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)],[mighta])])])])])])]) ).
cnf(c_0_10,plain,
~ model(X1,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( status(X1,X2,thm)
| model(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,negated_conjecture,
~ mighta(cax,thm),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ status(X1,X2,X4)
| ~ status(X1,X2,X3)
| mighta(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
status(esk9_0,X1,thm),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,plain,
! [X25,X27,X28,X29,X30] :
( ( ~ model(X30,X28)
| ~ status(X28,X29,cax) )
& ( status(X25,X27,cax)
| model(esk4_1(X25),X25) ) ),
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)],[cax])])])])])]) ).
fof(c_0_16,negated_conjecture,
~ mighta(cax,thm),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ status(esk9_0,X2,X1)
| mighta(X1,thm) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( status(X1,X2,cax)
| model(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ mighta(cax,thm),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KRS265+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n006.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Sun Sep 20 23:00:13 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.23/0.57 % Version: 3.5.1
% 0.23/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % sh5l with pid 1444934 completed with status 0
% 0.23/0.57 % Result found by sh5l
% 0.23/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.57 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.57 % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.23/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.57 % SubtermCWHack with pid 1444935 completed with status 0
% 0.23/0.57 % Result found by SubtermCWHack
% 0.23/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.57 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.57 % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.23/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.57 % Preprocessing time : 0.002 s
% 0.23/0.57
% 0.23/0.57 % Proof found!
% 0.23/0.57 % SZS status Theorem
% 0.23/0.57 % SZS output start CNFRefutation
% See solution above
% 0.23/0.57 % Parsed axioms : 33
% 0.23/0.57 % Removed by relevancy pruning/SinE : 23
% 0.23/0.57 % Initial clauses : 24
% 0.23/0.57 % Removed in clause preprocessing : 0
% 0.23/0.57 % Initial clauses in saturation : 24
% 0.23/0.57 % Processed clauses : 65
% 0.23/0.57 % ...of these trivial : 5
% 0.23/0.57 % ...subsumed : 9
% 0.23/0.57 % ...remaining for further processing : 51
% 0.23/0.57 % Other redundant clauses eliminated : 0
% 0.23/0.57 % Clauses deleted for lack of memory : 0
% 0.23/0.57 % Backward-subsumed : 0
% 0.23/0.57 % Backward-rewritten : 0
% 0.23/0.57 % Generated clauses : 72
% 0.23/0.57 % ...of the previous two non-redundant : 57
% 0.23/0.57 % ...aggressively subsumed : 0
% 0.23/0.57 % Contextual simplify-reflections : 0
% 0.23/0.57 % Paramodulations : 72
% 0.23/0.57 % Factorizations : 0
% 0.23/0.57 % NegExts : 0
% 0.23/0.57 % Equation resolutions : 0
% 0.23/0.57 % Disequality decompositions : 0
% 0.23/0.57 % Total rewrite steps : 15
% 0.23/0.57 % ...of those cached : 3
% 0.23/0.57 % Propositional unsat checks : 0
% 0.23/0.57 % Propositional check models : 0
% 0.23/0.57 % Propositional check unsatisfiable : 0
% 0.23/0.57 % Propositional clauses : 0
% 0.23/0.57 % Propositional clauses after purity: 0
% 0.23/0.57 % Propositional unsat core size : 0
% 0.23/0.57 % Propositional preprocessing time : 0.000
% 0.23/0.57 % Propositional encoding time : 0.000
% 0.23/0.57 % Propositional solver time : 0.000
% 0.23/0.57 % Success case prop preproc time : 0.000
% 0.23/0.57 % Success case prop encoding time : 0.000
% 0.23/0.57 % Success case prop solver time : 0.000
% 0.23/0.57 % Current number of processed clauses : 51
% 0.23/0.57 % Positive orientable unit clauses : 22
% 0.23/0.57 % Positive unorientable unit clauses: 0
% 0.23/0.57 % Negative unit clauses : 8
% 0.23/0.57 % Non-unit-clauses : 21
% 0.23/0.57 % Current number of unprocessed clauses: 14
% 0.23/0.57 % ...number of literals in the above : 38
% 0.23/0.57 % Current number of archived formulas : 0
% 0.23/0.57 % Current number of archived clauses : 0
% 0.23/0.57 % Clause-clause subsumption calls (NU) : 24
% 0.23/0.57 % Rec. Clause-clause subsumption calls : 21
% 0.23/0.57 % Non-unit clause-clause subsumptions : 7
% 0.23/0.57 % Unit Clause-clause subsumption calls : 24
% 0.23/0.57 % Rewrite failures with RHS unbound : 0
% 0.23/0.57 % BW rewrite match attempts : 6
% 0.23/0.57 % BW rewrite match successes : 0
% 0.23/0.57 % Condensation attempts : 0
% 0.23/0.57 % Condensation successes : 0
% 0.23/0.57 % Termbank termtop insertions : 2236
% 0.23/0.57 % Search garbage collected termcells : 490
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.007 s
% 0.23/0.57 % System time : 0.004 s
% 0.23/0.57 % Total time : 0.011 s
% 0.23/0.57 % Maximum resident set size: 3936 pages
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.009 s
% 0.23/0.57 % System time : 0.010 s
% 0.23/0.57 % Total time : 0.020 s
% 0.23/0.57 % Maximum resident set size: 4864 pages
% 0.23/0.57 % E exiting
%------------------------------------------------------------------------------