%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM393+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:48:58 PM UTC 2026
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 65 ( 24 ~; 26 |; 7 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> inclusion_comparable(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_ordinal1) ).
fof(connectedness_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X2)
& ordinal(X1) )
=> ( ordinal_subset(X2,X1)
| ordinal_subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(d9_xboole_0,axiom,
! [X1,X2] :
( inclusion_comparable(X1,X2)
<=> ( subset(X2,X1)
| subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_xboole_0) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X2)
& ordinal(X1) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> inclusion_comparable(X1,X2) ) ),
inference(assume_negation,[status(cth)],[t25_ordinal1]) ).
fof(c_0_5,plain,
! [X16,X17] :
( ordinal_subset(X17,X16)
| ordinal_subset(X16,X17)
| ~ ordinal(X17)
| ~ ordinal(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_ordinal1])])]) ).
fof(c_0_6,negated_conjecture,
( ~ inclusion_comparable(esk1_0,esk2_0)
& ordinal(esk2_0)
& ordinal(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ordinal_subset(X2,X1)
| ordinal_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X6,X7] :
( ( inclusion_comparable(X6,X7)
| ~ subset(X7,X6) )
& ( inclusion_comparable(X6,X7)
| ~ subset(X6,X7) )
& ( subset(X7,X6)
| subset(X6,X7)
| ~ inclusion_comparable(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_xboole_0])])])]) ).
fof(c_0_10,plain,
! [X11,X12] :
( ( ~ ordinal(X12)
| ~ ordinal(X11)
| ordinal_subset(X11,X12)
| ~ subset(X11,X12) )
& ( ~ ordinal(X12)
| ~ ordinal(X11)
| subset(X11,X12)
| ~ ordinal_subset(X11,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ ordinal(X1)
| ordinal_subset(X1,esk2_0)
| ordinal_subset(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
~ inclusion_comparable(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ subset(X1,X2)
| inclusion_comparable(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ordinal_subset(esk2_0,esk1_0)
| ordinal_subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ subset(X1,X2)
| inclusion_comparable(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
ordinal_subset(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8]),c_0_12])]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ subset(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_12]),c_0_8])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM393+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:26:50 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.45 Running first-order theorem proving
% 0.10/0.45 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.21/0.53 % Version: 3.5.1
% 0.21/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 % Starting sh5l with 300s (1) cores
% 0.21/0.53 % new_bool_1 with pid 2943499 completed with status 0
% 0.21/0.53 % Result found by new_bool_1
% 0.21/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 % Search class: FGHNS-FFSF11-SFFFFFNN
% 0.21/0.53 % partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.21/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.53 % SubtermCWHack with pid 2943502 completed with status 0
% 0.21/0.53 % Result found by SubtermCWHack
% 0.21/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 % Search class: FGHNS-FFSF11-SFFFFFNN
% 0.21/0.53 % partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.21/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.53 % Preprocessing time : 0.002 s
% 0.21/0.53
% 0.21/0.53 % Proof found!
% 0.21/0.53 % SZS status Theorem
% 0.21/0.53 % SZS output start CNFRefutation
% See solution above
% 0.21/0.53 % Parsed axioms : 37
% 0.21/0.53 % Removed by relevancy pruning/SinE : 23
% 0.21/0.53 % Initial clauses : 20
% 0.21/0.53 % Removed in clause preprocessing : 0
% 0.21/0.53 % Initial clauses in saturation : 20
% 0.21/0.53 % Processed clauses : 38
% 0.21/0.53 % ...of these trivial : 0
% 0.21/0.53 % ...subsumed : 4
% 0.21/0.53 % ...remaining for further processing : 34
% 0.21/0.53 % Other redundant clauses eliminated : 0
% 0.21/0.53 % Clauses deleted for lack of memory : 0
% 0.21/0.53 % Backward-subsumed : 1
% 0.21/0.53 % Backward-rewritten : 1
% 0.21/0.53 % Generated clauses : 33
% 0.21/0.53 % ...of the previous two non-redundant : 21
% 0.21/0.53 % ...aggressively subsumed : 0
% 0.21/0.53 % Contextual simplify-reflections : 0
% 0.21/0.53 % Paramodulations : 33
% 0.21/0.53 % Factorizations : 0
% 0.21/0.53 % NegExts : 0
% 0.21/0.53 % Equation resolutions : 0
% 0.21/0.53 % Disequality decompositions : 0
% 0.21/0.53 % Total rewrite steps : 13
% 0.21/0.53 % ...of those cached : 5
% 0.21/0.53 % Propositional unsat checks : 0
% 0.21/0.53 % Propositional check models : 0
% 0.21/0.53 % Propositional check unsatisfiable : 0
% 0.21/0.53 % Propositional clauses : 0
% 0.21/0.53 % Propositional clauses after purity: 0
% 0.21/0.53 % Propositional unsat core size : 0
% 0.21/0.53 % Propositional preprocessing time : 0.000
% 0.21/0.53 % Propositional encoding time : 0.000
% 0.21/0.53 % Propositional solver time : 0.000
% 0.21/0.53 % Success case prop preproc time : 0.000
% 0.21/0.53 % Success case prop encoding time : 0.000
% 0.21/0.53 % Success case prop solver time : 0.000
% 0.21/0.53 % Current number of processed clauses : 32
% 0.21/0.53 % Positive orientable unit clauses : 9
% 0.21/0.53 % Positive unorientable unit clauses: 0
% 0.21/0.53 % Negative unit clauses : 3
% 0.21/0.53 % Non-unit-clauses : 20
% 0.21/0.53 % Current number of unprocessed clauses: 2
% 0.21/0.53 % ...number of literals in the above : 6
% 0.21/0.53 % Current number of archived formulas : 0
% 0.21/0.53 % Current number of archived clauses : 2
% 0.21/0.53 % Clause-clause subsumption calls (NU) : 33
% 0.21/0.53 % Rec. Clause-clause subsumption calls : 27
% 0.21/0.53 % Non-unit clause-clause subsumptions : 5
% 0.21/0.53 % Unit Clause-clause subsumption calls : 8
% 0.21/0.53 % Rewrite failures with RHS unbound : 0
% 0.21/0.53 % BW rewrite match attempts : 1
% 0.21/0.53 % BW rewrite match successes : 1
% 0.21/0.53 % Condensation attempts : 0
% 0.21/0.53 % Condensation successes : 0
% 0.21/0.53 % Termbank termtop insertions : 1800
% 0.21/0.53 % Search garbage collected termcells : 316
% 0.21/0.53
% 0.21/0.53 % -------------------------------------------------
% 0.21/0.53 % User time : 0.009 s
% 0.21/0.53 % System time : 0.004 s
% 0.21/0.53 % Total time : 0.013 s
% 0.21/0.53 % Maximum resident set size: 3656 pages
% 0.21/0.53
% 0.21/0.53 % -------------------------------------------------
% 0.21/0.53 % User time : 0.010 s
% 0.21/0.53 % System time : 0.012 s
% 0.21/0.53 % Total time : 0.023 s
% 0.21/0.53 % Maximum resident set size: 4864 pages
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------