%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS261+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 : n018.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:13 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 106 ( 37 ~; 42 |; 20 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 69 ( 9 sgn 30 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(eth,axiom,
! [X1,X2] :
( ( ! [X5] :
( model(X5,X1)
<=> model(X5,X2) )
& ? [X4] : ~ model(X4,X1)
& ? [X3] : model(X3,X1) )
<=> status(X1,X2,eth) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',eth) ).
fof(non_thm_spt,axiom,
? [X3,X1,X2] :
( ? [X4] : model(X4,X2)
& ~ model(X3,X2)
& model(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',non_thm_spt) ).
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_eth_thm,conjecture,
mighta(eth,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_eth_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(c_0_5,plain,
! [X1,X2] :
( ( ! [X5] :
( model(X5,X1)
<=> model(X5,X2) )
& ? [X4] : ~ model(X4,X1)
& ? [X3] : model(X3,X1) )
<=> status(X1,X2,eth) ),
inference(fof_simplification,[status(thm)],[eth]) ).
fof(c_0_6,plain,
? [X3,X1,X2] :
( ? [X4] : model(X4,X2)
& ~ model(X3,X2)
& model(X3,X1) ),
inference(fof_simplification,[status(thm)],[non_thm_spt]) ).
fof(c_0_7,plain,
! [X25,X26,X27,X28,X30,X31,X34,X35] :
( ( ~ status(X30,X31,eth)
| model(X35,X30)
| ~ model(X35,X31) )
& ( ~ status(X30,X31,eth)
| model(X34,X31)
| ~ model(X34,X30) )
& ( ~ status(X30,X31,eth)
| ~ model(esk6_2(X30,X31),X30) )
& ( ~ status(X30,X31,eth)
| model(esk5_2(X30,X31),X30) )
& ( status(X25,X26,eth)
| model(X28,X25)
| ~ model(X27,X25)
| model(esk4_2(X25,X26),X26)
| model(esk4_2(X25,X26),X25) )
& ( status(X25,X26,eth)
| model(X28,X25)
| ~ model(X27,X25)
| ~ model(esk4_2(X25,X26),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)],[c_0_5])])])])])])]) ).
fof(c_0_8,plain,
( model(esk24_0,esk23_0)
& ~ model(esk21_0,esk23_0)
& model(esk21_0,esk22_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])]) ).
cnf(c_0_9,plain,
( ~ model(X3,X1)
| status(X1,X2,eth)
| model(X4,X1)
| model(esk4_2(X1,X2),X2)
| model(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
model(esk24_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,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])])])])])])]) ).
cnf(c_0_12,plain,
( model(X2,esk23_0)
| model(esk4_2(esk23_0,X1),X1)
| model(esk4_2(esk23_0,X1),esk23_0)
| status(esk23_0,X1,eth) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,negated_conjecture,
~ mighta(eth,thm),
inference(assume_negation,[status(cth)],[mighta_eth_thm]) ).
fof(c_0_14,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_15,plain,
( ~ model(esk3_2(X1,X2),X2)
| status(X1,X2,thm) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( status(X1,X2,thm)
| model(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ model(X3,X1)
| ~ model(esk4_2(X1,X2),X2)
| ~ model(esk4_2(X1,X2),X1)
| status(X1,X2,eth)
| model(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( model(esk4_2(esk23_0,esk23_0),esk23_0)
| status(esk23_0,esk23_0,eth) ),
inference(ef,[status(thm)],[c_0_12]) ).
fof(c_0_19,negated_conjecture,
~ mighta(eth,thm),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ status(X1,X2,X4)
| ~ status(X1,X2,X3)
| mighta(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
status(X1,X1,thm),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ model(X2,esk23_0)
| model(X1,esk23_0)
| status(esk23_0,esk23_0,eth) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
fof(c_0_23,negated_conjecture,
~ mighta(eth,thm),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( ~ status(X2,X2,X1)
| mighta(X1,thm) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( model(X1,esk23_0)
| status(esk23_0,esk23_0,eth) ),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ mighta(eth,thm),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
~ model(esk21_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
model(X1,esk23_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS261+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n018.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 23:02:28 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % sh5l with pid 390046 completed with status 0
% 0.09/0.44 % Result found by sh5l
% 0.09/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.44 % Search class: FGHNF-FFSM22-SFFFFFNN
% 0.09/0.44 % partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % SubtermCWHack with pid 390047 completed with status 0
% 0.09/0.44 % Result found by SubtermCWHack
% 0.09/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.44 % Search class: FGHNF-FFSM22-SFFFFFNN
% 0.09/0.44 % partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % Preprocessing time : 0.002 s
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Theorem
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 33
% 0.09/0.44 % Removed by relevancy pruning/SinE : 23
% 0.09/0.44 % Initial clauses : 28
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 28
% 0.09/0.44 % Processed clauses : 147
% 0.09/0.44 % ...of these trivial : 2
% 0.09/0.44 % ...subsumed : 49
% 0.09/0.44 % ...remaining for further processing : 96
% 0.09/0.44 % Other redundant clauses eliminated : 0
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 17
% 0.09/0.44 % Backward-rewritten : 4
% 0.09/0.44 % Generated clauses : 367
% 0.09/0.44 % ...of the previous two non-redundant : 323
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 1
% 0.09/0.44 % Paramodulations : 297
% 0.09/0.44 % Factorizations : 70
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 0
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 22
% 0.09/0.44 % ...of those cached : 12
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 75
% 0.09/0.44 % Positive orientable unit clauses : 13
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 9
% 0.09/0.44 % Non-unit-clauses : 53
% 0.09/0.44 % Current number of unprocessed clauses: 174
% 0.09/0.44 % ...number of literals in the above : 884
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 21
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 1211
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 629
% 0.09/0.44 % Non-unit clause-clause subsumptions : 65
% 0.09/0.44 % Unit Clause-clause subsumption calls : 60
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 9
% 0.09/0.44 % BW rewrite match successes : 5
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 7245
% 0.09/0.44 % Search garbage collected termcells : 599
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.013 s
% 0.09/0.44 % System time : 0.003 s
% 0.09/0.44 % Total time : 0.016 s
% 0.09/0.44 % Maximum resident set size: 3680 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.015 s
% 0.09/0.44 % System time : 0.007 s
% 0.09/0.44 % Total time : 0.023 s
% 0.09/0.44 % Maximum resident set size: 4608 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------