%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM411+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 : n010.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:54:56 PM UTC 2026
% Result : Theorem 0.13s 0.46s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 77 ( 31 ~; 28 |; 10 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 36 ( 3 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t47_ordinal1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> ! [X3] :
( transfinite_sequence_of(X3,X1)
=> transfinite_sequence_of(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t47_ordinal1) ).
fof(d8_ordinal1,axiom,
! [X1,X2] :
( ( transfinite_sequence(X2)
& function(X2)
& relation(X2) )
=> ( transfinite_sequence_of(X2,X1)
<=> subset(relation_rng(X2),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_ordinal1) ).
fof(dt_m1_ordinal1,axiom,
! [X1,X2] :
( transfinite_sequence_of(X2,X1)
=> ( transfinite_sequence(X2)
& function(X2)
& relation(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m1_ordinal1) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> ! [X3] :
( transfinite_sequence_of(X3,X1)
=> transfinite_sequence_of(X3,X2) ) ),
inference(assume_negation,[status(cth)],[t47_ordinal1]) ).
fof(c_0_5,plain,
! [X12,X13] :
( ( ~ transfinite_sequence(X13)
| ~ function(X13)
| ~ relation(X13)
| transfinite_sequence_of(X13,X12)
| ~ subset(relation_rng(X13),X12) )
& ( ~ transfinite_sequence(X13)
| ~ function(X13)
| ~ relation(X13)
| subset(relation_rng(X13),X12)
| ~ transfinite_sequence_of(X13,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_ordinal1])])])]) ).
fof(c_0_6,plain,
! [X14,X15] :
( ( ~ transfinite_sequence_of(X15,X14)
| transfinite_sequence(X15) )
& ( ~ transfinite_sequence_of(X15,X14)
| function(X15) )
& ( ~ transfinite_sequence_of(X15,X14)
| relation(X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_ordinal1])])])]) ).
fof(c_0_7,plain,
! [X40,X41,X42] :
( subset(X40,X42)
| ~ subset(X41,X42)
| ~ subset(X40,X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_8,negated_conjecture,
( ~ transfinite_sequence_of(esk19_0,esk18_0)
& transfinite_sequence_of(esk19_0,esk17_0)
& subset(esk17_0,esk18_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_9,plain,
( ~ transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ transfinite_sequence_of(X1,X2)
| subset(relation_rng(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ transfinite_sequence_of(X1,X2)
| function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ transfinite_sequence_of(X1,X2)
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ transfinite_sequence_of(X1,X2)
| transfinite_sequence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
subset(esk17_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ transfinite_sequence_of(X1,X2)
| subset(relation_rng(X1),X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
transfinite_sequence_of(esk19_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(X1,esk17_0)
| subset(X1,esk18_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
subset(relation_rng(esk19_0),esk17_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ subset(relation_rng(X1),X2)
| transfinite_sequence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
subset(relation_rng(esk19_0),esk18_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
transfinite_sequence(esk19_0),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
relation(esk19_0),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
function(esk19_0),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
~ transfinite_sequence_of(esk19_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM411+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n010.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 02:27:39 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.13/0.46 % Version: 3.5.1
% 0.13/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.46 % Starting sh5l with 300s (1) cores
% 0.13/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4038359 completed with status 0
% 0.13/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.46 % No SInE strategy applied
% 0.13/0.46 % Search class: FGHSS-FFMM11-SFFFFFNN
% 0.13/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.46 % new_bool_1 with pid 4038367 completed with status 0
% 0.13/0.46 % Result found by new_bool_1
% 0.13/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.46 % No SInE strategy applied
% 0.13/0.46 % Search class: FGHSS-FFMM11-SFFFFFNN
% 0.13/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.46 % Preprocessing time : 0.002 s
% 0.13/0.46 % Presaturation interreduction done
% 0.13/0.46
% 0.13/0.46 % Proof found!
% 0.13/0.46 % SZS status Theorem
% 0.13/0.46 % SZS output start CNFRefutation
% See solution above
% 0.13/0.46 % Parsed axioms : 43
% 0.13/0.46 % Removed by relevancy pruning/SinE : 0
% 0.13/0.46 % Initial clauses : 90
% 0.13/0.46 % Removed in clause preprocessing : 2
% 0.13/0.46 % Initial clauses in saturation : 88
% 0.13/0.46 % Processed clauses : 200
% 0.13/0.46 % ...of these trivial : 6
% 0.13/0.46 % ...subsumed : 7
% 0.13/0.46 % ...remaining for further processing : 187
% 0.13/0.46 % Other redundant clauses eliminated : 0
% 0.13/0.46 % Clauses deleted for lack of memory : 0
% 0.13/0.46 % Backward-subsumed : 0
% 0.13/0.46 % Backward-rewritten : 13
% 0.13/0.46 % Generated clauses : 104
% 0.13/0.46 % ...of the previous two non-redundant : 74
% 0.13/0.46 % ...aggressively subsumed : 0
% 0.13/0.46 % Contextual simplify-reflections : 5
% 0.13/0.46 % Paramodulations : 104
% 0.13/0.46 % Factorizations : 0
% 0.13/0.46 % NegExts : 0
% 0.13/0.46 % Equation resolutions : 0
% 0.13/0.46 % Disequality decompositions : 0
% 0.13/0.46 % Total rewrite steps : 52
% 0.13/0.46 % ...of those cached : 29
% 0.13/0.46 % Propositional unsat checks : 0
% 0.13/0.46 % Propositional check models : 0
% 0.13/0.46 % Propositional check unsatisfiable : 0
% 0.13/0.46 % Propositional clauses : 0
% 0.13/0.46 % Propositional clauses after purity: 0
% 0.13/0.46 % Propositional unsat core size : 0
% 0.13/0.46 % Propositional preprocessing time : 0.000
% 0.13/0.46 % Propositional encoding time : 0.000
% 0.13/0.46 % Propositional solver time : 0.000
% 0.13/0.46 % Success case prop preproc time : 0.000
% 0.13/0.46 % Success case prop encoding time : 0.000
% 0.13/0.46 % Success case prop solver time : 0.000
% 0.13/0.46 % Current number of processed clauses : 92
% 0.13/0.46 % Positive orientable unit clauses : 50
% 0.13/0.46 % Positive unorientable unit clauses: 0
% 0.13/0.46 % Negative unit clauses : 4
% 0.13/0.46 % Non-unit-clauses : 38
% 0.13/0.46 % Current number of unprocessed clauses: 42
% 0.13/0.46 % ...number of literals in the above : 148
% 0.13/0.46 % Current number of archived formulas : 0
% 0.13/0.46 % Current number of archived clauses : 95
% 0.13/0.46 % Clause-clause subsumption calls (NU) : 320
% 0.13/0.46 % Rec. Clause-clause subsumption calls : 176
% 0.13/0.46 % Non-unit clause-clause subsumptions : 12
% 0.13/0.46 % Unit Clause-clause subsumption calls : 14
% 0.13/0.46 % Rewrite failures with RHS unbound : 0
% 0.13/0.46 % BW rewrite match attempts : 10
% 0.13/0.46 % BW rewrite match successes : 4
% 0.13/0.46 % Condensation attempts : 0
% 0.13/0.46 % Condensation successes : 0
% 0.13/0.46 % Termbank termtop insertions : 4561
% 0.13/0.46 % Search garbage collected termcells : 533
% 0.13/0.46
% 0.13/0.46 % -------------------------------------------------
% 0.13/0.46 % User time : 0.011 s
% 0.13/0.46 % System time : 0.004 s
% 0.13/0.46 % Total time : 0.015 s
% 0.13/0.46 % Maximum resident set size: 3664 pages
% 0.13/0.46
% 0.13/0.46 % -------------------------------------------------
% 0.13/0.46 % User time : 0.045 s
% 0.13/0.46 % System time : 0.014 s
% 0.13/0.46 % Total time : 0.059 s
% 0.13/0.46 % Maximum resident set size: 4864 pages
% 0.13/0.46 % E exiting
%------------------------------------------------------------------------------