%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:03 EDT 2022
% Result : Theorem 0.21s 1.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 91 ( 33 ~; 30 |; 14 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 52 ( 4 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_ordinal1) ).
fof(t19_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ! [X3] :
( epsilon_transitive(X3)
=> ( ( in(X3,X1)
& in(X1,X2) )
=> in(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t19_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc1_ordinal1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| element(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_8,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
cnf(c_0_9,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X3,X4,X3] :
( ( ~ epsilon_transitive(X3)
| ~ in(X4,X3)
| subset(X4,X3) )
& ( in(esk1_1(X3),X3)
| epsilon_transitive(X3) )
& ( ~ subset(esk1_1(X3),X3)
| epsilon_transitive(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_ordinal1])])])])])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ! [X3] :
( epsilon_transitive(X3)
=> ( ( in(X3,X1)
& in(X1,X2) )
=> in(X3,X2) ) ) ) ),
inference(assume_negation,[status(cth)],[t19_ordinal1]) ).
cnf(c_0_13,plain,
( element(X1,X2)
| ~ subset(X3,X2)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ in(X1,X2)
| ~ epsilon_transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
( ordinal(esk14_0)
& ordinal(esk15_0)
& epsilon_transitive(esk16_0)
& in(esk16_0,esk14_0)
& in(esk14_0,esk15_0)
& ~ in(esk16_0,esk15_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_12])])])])]) ).
fof(c_0_16,plain,
! [X2] :
( ( epsilon_transitive(X2)
| ~ ordinal(X2) )
& ( epsilon_connected(X2)
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
cnf(c_0_17,plain,
( element(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X3)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
in(esk16_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
ordinal(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_23,negated_conjecture,
( element(esk16_0,X1)
| ~ epsilon_transitive(X1)
| ~ in(esk14_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
epsilon_transitive(esk15_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
in(esk14_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
element(esk16_0,esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
~ empty(esk15_0),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ in(esk16_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.32 % Computer : n017.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Thu Jul 7 09:54:30 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.21/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.39 # Preprocessing time : 0.016 s
% 0.21/1.39
% 0.21/1.39 # Failure: Out of unprocessed clauses!
% 0.21/1.39 # OLD status GaveUp
% 0.21/1.39 # Parsed axioms : 32
% 0.21/1.39 # Removed by relevancy pruning/SinE : 17
% 0.21/1.39 # Initial clauses : 25
% 0.21/1.39 # Removed in clause preprocessing : 0
% 0.21/1.39 # Initial clauses in saturation : 25
% 0.21/1.39 # Processed clauses : 36
% 0.21/1.39 # ...of these trivial : 0
% 0.21/1.39 # ...subsumed : 1
% 0.21/1.39 # ...remaining for further processing : 35
% 0.21/1.39 # Other redundant clauses eliminated : 0
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 0
% 0.21/1.39 # Backward-rewritten : 3
% 0.21/1.39 # Generated clauses : 13
% 0.21/1.39 # ...of the previous two non-trivial : 11
% 0.21/1.39 # Contextual simplify-reflections : 0
% 0.21/1.39 # Paramodulations : 13
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 0
% 0.21/1.39 # Current number of processed clauses : 32
% 0.21/1.39 # Positive orientable unit clauses : 13
% 0.21/1.39 # Positive unorientable unit clauses: 0
% 0.21/1.39 # Negative unit clauses : 7
% 0.21/1.39 # Non-unit-clauses : 12
% 0.21/1.39 # Current number of unprocessed clauses: 0
% 0.21/1.39 # ...number of literals in the above : 0
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 3
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 4
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 4
% 0.21/1.39 # Non-unit clause-clause subsumptions : 1
% 0.21/1.39 # Unit Clause-clause subsumption calls : 27
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 1
% 0.21/1.39 # BW rewrite match successes : 1
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 1181
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.014 s
% 0.21/1.39 # System time : 0.003 s
% 0.21/1.39 # Total time : 0.017 s
% 0.21/1.39 # Maximum resident set size: 2692 pages
% 0.21/1.39 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.39 # Preprocessing time : 0.017 s
% 0.21/1.39
% 0.21/1.39 # Proof found!
% 0.21/1.39 # SZS status Theorem
% 0.21/1.39 # SZS output start CNFRefutation
% See solution above
% 0.21/1.39 # Proof object total steps : 32
% 0.21/1.39 # Proof object clause steps : 17
% 0.21/1.39 # Proof object formula steps : 15
% 0.21/1.39 # Proof object conjectures : 12
% 0.21/1.39 # Proof object clause conjectures : 9
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 10
% 0.21/1.39 # Proof object initial formulas used : 7
% 0.21/1.39 # Proof object generating inferences : 7
% 0.21/1.39 # Proof object simplifying inferences : 4
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 32
% 0.21/1.39 # Removed by relevancy pruning/SinE : 0
% 0.21/1.39 # Initial clauses : 60
% 0.21/1.39 # Removed in clause preprocessing : 2
% 0.21/1.39 # Initial clauses in saturation : 58
% 0.21/1.39 # Processed clauses : 92
% 0.21/1.39 # ...of these trivial : 4
% 0.21/1.39 # ...subsumed : 6
% 0.21/1.39 # ...remaining for further processing : 82
% 0.21/1.39 # Other redundant clauses eliminated : 0
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 0
% 0.21/1.39 # Backward-rewritten : 6
% 0.21/1.39 # Generated clauses : 63
% 0.21/1.39 # ...of the previous two non-trivial : 56
% 0.21/1.39 # Contextual simplify-reflections : 4
% 0.21/1.39 # Paramodulations : 63
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 0
% 0.21/1.39 # Current number of processed clauses : 76
% 0.21/1.39 # Positive orientable unit clauses : 35
% 0.21/1.39 # Positive unorientable unit clauses: 0
% 0.21/1.39 # Negative unit clauses : 7
% 0.21/1.39 # Non-unit-clauses : 34
% 0.21/1.39 # Current number of unprocessed clauses: 19
% 0.21/1.39 # ...number of literals in the above : 52
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 6
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 238
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 195
% 0.21/1.39 # Non-unit clause-clause subsumptions : 10
% 0.21/1.39 # Unit Clause-clause subsumption calls : 46
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 4
% 0.21/1.39 # BW rewrite match successes : 3
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 2701
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.017 s
% 0.21/1.39 # System time : 0.003 s
% 0.21/1.39 # Total time : 0.020 s
% 0.21/1.39 # Maximum resident set size: 2924 pages
%------------------------------------------------------------------------------