%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM411+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 09:32:10 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 86 ( 36 ~; 32 |; 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 : 37 ( 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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t47_ordinal1) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_xboole_1) ).
fof(d8_ordinal1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2)
& transfinite_sequence(X2) )
=> ( transfinite_sequence_of(X2,X1)
<=> subset(relation_rng(X2),X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_ordinal1) ).
fof(dt_m1_ordinal1,axiom,
! [X1,X2] :
( transfinite_sequence_of(X2,X1)
=> ( relation(X2)
& function(X2)
& transfinite_sequence(X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_m1_ordinal1) ).
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,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(c_0_6,negated_conjecture,
( subset(esk1_0,esk2_0)
& transfinite_sequence_of(esk3_0,esk1_0)
& ~ transfinite_sequence_of(esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ( ~ transfinite_sequence_of(X4,X3)
| subset(relation_rng(X4),X3)
| ~ relation(X4)
| ~ function(X4)
| ~ transfinite_sequence(X4) )
& ( ~ subset(relation_rng(X4),X3)
| transfinite_sequence_of(X4,X3)
| ~ relation(X4)
| ~ function(X4)
| ~ transfinite_sequence(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_ordinal1])])]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ( relation(X4)
| ~ transfinite_sequence_of(X4,X3) )
& ( function(X4)
| ~ transfinite_sequence_of(X4,X3) )
& ( transfinite_sequence(X4)
| ~ transfinite_sequence_of(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_ordinal1])])]) ).
cnf(c_0_11,plain,
( transfinite_sequence_of(X1,X2)
| ~ transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ subset(relation_rng(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( subset(X1,esk2_0)
| ~ subset(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( transfinite_sequence(X1)
| ~ transfinite_sequence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
transfinite_sequence_of(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( relation(X1)
| ~ transfinite_sequence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( function(X1)
| ~ transfinite_sequence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( transfinite_sequence_of(X1,esk2_0)
| ~ subset(relation_rng(X1),esk1_0)
| ~ transfinite_sequence(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
transfinite_sequence(esk3_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
relation(esk3_0),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
function(esk3_0),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ transfinite_sequence_of(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( subset(relation_rng(X1),X2)
| ~ transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ transfinite_sequence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
~ subset(relation_rng(esk3_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_17,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_24,plain,
( subset(relation_rng(X1),X2)
| ~ transfinite_sequence_of(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_22,c_0_13]),c_0_15]),c_0_16]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM411+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jul 5 05:26:07 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.016 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 26
% 0.26/1.44 # Proof object clause steps : 17
% 0.26/1.44 # Proof object formula steps : 9
% 0.26/1.44 # Proof object conjectures : 13
% 0.26/1.44 # Proof object clause conjectures : 10
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 9
% 0.26/1.44 # Proof object initial formulas used : 4
% 0.26/1.44 # Proof object generating inferences : 7
% 0.26/1.44 # Proof object simplifying inferences : 9
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 43
% 0.26/1.44 # Removed by relevancy pruning/SinE : 25
% 0.26/1.44 # Initial clauses : 31
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 31
% 0.26/1.44 # Processed clauses : 66
% 0.26/1.44 # ...of these trivial : 1
% 0.26/1.44 # ...subsumed : 3
% 0.26/1.44 # ...remaining for further processing : 62
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 0
% 0.26/1.44 # Backward-rewritten : 6
% 0.26/1.44 # Generated clauses : 101
% 0.26/1.44 # ...of the previous two non-trivial : 79
% 0.26/1.44 # Contextual simplify-reflections : 3
% 0.26/1.44 # Paramodulations : 101
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 0
% 0.26/1.44 # Current number of processed clauses : 56
% 0.26/1.44 # Positive orientable unit clauses : 24
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 4
% 0.26/1.44 # Non-unit-clauses : 28
% 0.26/1.44 # Current number of unprocessed clauses: 40
% 0.26/1.44 # ...number of literals in the above : 138
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 6
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 117
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 83
% 0.26/1.44 # Non-unit clause-clause subsumptions : 6
% 0.26/1.44 # Unit Clause-clause subsumption calls : 30
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 2
% 0.26/1.44 # BW rewrite match successes : 2
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 2379
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.017 s
% 0.26/1.44 # System time : 0.002 s
% 0.26/1.44 # Total time : 0.019 s
% 0.26/1.44 # Maximum resident set size: 2988 pages
%------------------------------------------------------------------------------