TSTP Solution File: NUM404+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM404+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:08 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 4 unt; 0 def)
% Number of atoms : 135 ( 8 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 147 ( 56 ~; 61 |; 17 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 66 ( 5 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t37_ordinal1,conjecture,
! [X1] :
~ ! [X2] :
( in(X2,X1)
<=> ordinal(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t37_ordinal1) ).
fof(d3_ordinal1,axiom,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_ordinal1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(t23_ordinal1,axiom,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t23_ordinal1) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t24_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',antisymmetry_r2_hidden) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_transitive(X1)
& epsilon_connected(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc2_ordinal1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
~ ! [X2] :
( in(X2,X1)
<=> ordinal(X2) ),
inference(assume_negation,[status(cth)],[t37_ordinal1]) ).
fof(c_0_9,negated_conjecture,
! [X4,X4] :
( ( ~ in(X4,esk19_0)
| ordinal(X4) )
& ( ~ ordinal(X4)
| in(X4,esk19_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_10,plain,
! [X4,X5,X6,X4] :
( ( ~ epsilon_connected(X4)
| ~ in(X5,X4)
| ~ in(X6,X4)
| in(X5,X6)
| X5 = X6
| in(X6,X5) )
& ( in(esk2_1(X4),X4)
| epsilon_connected(X4) )
& ( in(esk3_1(X4),X4)
| epsilon_connected(X4) )
& ( ~ in(esk2_1(X4),esk3_1(X4))
| epsilon_connected(X4) )
& ( esk2_1(X4) != esk3_1(X4)
| epsilon_connected(X4) )
& ( ~ in(esk3_1(X4),esk2_1(X4))
| epsilon_connected(X4) ) ),
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)],[inference(fof_simplification,[status(thm)],[d3_ordinal1])])])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk4_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ ordinal(X4)
| ~ in(X3,X4)
| ordinal(X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_ordinal1])]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| in(X3,X4)
| X3 = X4
| in(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t24_ordinal1])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( ordinal(X1)
| ~ in(X1,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( epsilon_connected(X1)
| in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( in(X1,esk19_0)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ordinal(X1)
| ~ in(X1,X2)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,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_21,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden])])]) ).
cnf(c_0_22,plain,
( in(X1,X2)
| X2 = X1
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( epsilon_connected(esk19_0)
| ordinal(esk2_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_24,plain,
( epsilon_connected(X1)
| in(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
( subset(X1,esk19_0)
| ~ ordinal(esk4_2(X1,esk19_0)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
( subset(X1,X2)
| ordinal(esk4_2(X1,X2))
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( epsilon_transitive(X1)
| in(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_29,plain,
! [X2] :
( ~ epsilon_transitive(X2)
| ~ epsilon_connected(X2)
| ordinal(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])]) ).
cnf(c_0_30,negated_conjecture,
( X1 = esk2_1(esk19_0)
| epsilon_connected(esk19_0)
| in(esk2_1(esk19_0),X1)
| in(X1,esk2_1(esk19_0))
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( epsilon_connected(esk19_0)
| ordinal(esk3_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_32,plain,
( epsilon_connected(X1)
| ~ in(esk3_1(X1),esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_33,plain,
( epsilon_connected(X1)
| ~ in(esk2_1(X1),esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,plain,
( epsilon_connected(X1)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,plain,
( epsilon_transitive(X1)
| ~ subset(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_36,negated_conjecture,
( subset(X1,esk19_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_37,negated_conjecture,
( epsilon_transitive(esk19_0)
| ordinal(esk1_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_27]) ).
cnf(c_0_38,negated_conjecture,
( ~ ordinal(X1)
| ~ in(esk19_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_39,plain,
( ordinal(X1)
| ~ epsilon_connected(X1)
| ~ epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,negated_conjecture,
epsilon_connected(esk19_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
epsilon_transitive(esk19_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ ordinal(esk19_0),
inference(spm,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM404+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jul 6 08:21:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 44
% 0.24/1.42 # Proof object clause steps : 27
% 0.24/1.42 # Proof object formula steps : 17
% 0.24/1.42 # Proof object conjectures : 16
% 0.24/1.42 # Proof object clause conjectures : 13
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 15
% 0.24/1.42 # Proof object initial formulas used : 8
% 0.24/1.42 # Proof object generating inferences : 12
% 0.24/1.42 # Proof object simplifying inferences : 7
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 41
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 92
% 0.24/1.42 # Removed in clause preprocessing : 2
% 0.24/1.42 # Initial clauses in saturation : 90
% 0.24/1.42 # Processed clauses : 341
% 0.24/1.42 # ...of these trivial : 6
% 0.24/1.42 # ...subsumed : 121
% 0.24/1.42 # ...remaining for further processing : 214
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 3
% 0.24/1.42 # Backward-rewritten : 27
% 0.24/1.42 # Generated clauses : 1067
% 0.24/1.42 # ...of the previous two non-trivial : 912
% 0.24/1.42 # Contextual simplify-reflections : 92
% 0.24/1.42 # Paramodulations : 1067
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 184
% 0.24/1.42 # Positive orientable unit clauses : 38
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 5
% 0.24/1.42 # Non-unit-clauses : 141
% 0.24/1.42 # Current number of unprocessed clauses: 515
% 0.24/1.42 # ...number of literals in the above : 2114
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 30
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 3523
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 1750
% 0.24/1.42 # Non-unit clause-clause subsumptions : 183
% 0.24/1.42 # Unit Clause-clause subsumption calls : 82
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 6
% 0.24/1.42 # BW rewrite match successes : 6
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 17362
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.039 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.042 s
% 0.24/1.42 # Maximum resident set size: 4028 pages
% 0.24/23.49 eprover: CPU time limit exceeded, terminating
% 0.24/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.51 eprover: No such file or directory
% 0.24/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.52 eprover: No such file or directory
% 0.24/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.52 eprover: No such file or directory
% 0.24/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.52 eprover: No such file or directory
% 0.24/23.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.53 eprover: No such file or directory
% 0.24/23.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.53 eprover: No such file or directory
% 0.24/23.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.54 eprover: No such file or directory
% 0.24/23.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.54 eprover: No such file or directory
%------------------------------------------------------------------------------