TSTP Solution File: NUM386+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM386+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 6 unt; 0 def)
% Number of atoms : 108 ( 45 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 124 ( 49 ~; 59 |; 10 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 58 ( 11 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_ordinal1,conjecture,
! [X1,X2] :
( in(X1,succ(X2))
<=> ( in(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t13_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_ordinal1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( in(X1,succ(X2))
<=> ( in(X1,X2)
| X1 = X2 ) ),
inference(assume_negation,[status(cth)],[t13_ordinal1]) ).
fof(c_0_5,negated_conjecture,
( ( ~ in(esk14_0,esk15_0)
| ~ in(esk14_0,succ(esk15_0)) )
& ( esk14_0 != esk15_0
| ~ in(esk14_0,succ(esk15_0)) )
& ( in(esk14_0,succ(esk15_0))
| in(esk14_0,esk15_0)
| esk14_0 = esk15_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_7,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| in(X8,X5)
| in(X8,X6)
| X7 != set_union2(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(X8,X6)
| in(X8,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(esk2_3(X5,X6,X7),X5)
| ~ in(esk2_3(X5,X6,X7),X7)
| X7 = set_union2(X5,X6) )
& ( ~ in(esk2_3(X5,X6,X7),X6)
| ~ in(esk2_3(X5,X6,X7),X7)
| X7 = set_union2(X5,X6) )
& ( in(esk2_3(X5,X6,X7),X7)
| in(esk2_3(X5,X6,X7),X5)
| in(esk2_3(X5,X6,X7),X6)
| X7 = set_union2(X5,X6) ) ),
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_xboole_0])])])])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ in(esk14_0,succ(esk15_0))
| ~ in(esk14_0,esk15_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( esk14_0 = esk15_0
| in(esk14_0,esk15_0)
| in(esk14_0,succ(esk15_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ in(esk14_0,esk15_0)
| ~ in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( esk15_0 = esk14_0
| in(esk14_0,esk15_0)
| in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
inference(rw,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ in(esk14_0,esk15_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( ~ in(esk14_0,succ(esk15_0))
| esk14_0 != esk15_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_19,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) = X4
| X5 = singleton(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)],[d1_tarski])])])])])])]) ).
cnf(c_0_20,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( esk14_0 = esk15_0
| in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( esk15_0 != esk14_0
| ~ in(esk14_0,set_union2(esk15_0,singleton(esk15_0))) ),
inference(rw,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_23,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( esk14_0 = esk15_0
| in(esk14_0,singleton(esk15_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16]) ).
cnf(c_0_27,negated_conjecture,
( esk14_0 != esk15_0
| ~ in(esk14_0,singleton(esk15_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( in(X1,X2)
| X2 != singleton(X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( esk14_0 = esk15_0
| X1 = esk14_0
| singleton(esk15_0) != singleton(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( singleton(esk14_0) != singleton(esk15_0)
| esk14_0 != esk15_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
esk14_0 = esk15_0,
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM386+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jul 7 06:22:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.009 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 33
% 0.23/1.42 # Proof object clause steps : 24
% 0.23/1.42 # Proof object formula steps : 9
% 0.23/1.42 # Proof object conjectures : 17
% 0.23/1.42 # Proof object clause conjectures : 14
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 9
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 9
% 0.23/1.42 # Proof object simplifying inferences : 9
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 34
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 61
% 0.23/1.42 # Removed in clause preprocessing : 3
% 0.23/1.42 # Initial clauses in saturation : 58
% 0.23/1.42 # Processed clauses : 160
% 0.23/1.42 # ...of these trivial : 4
% 0.23/1.42 # ...subsumed : 36
% 0.23/1.42 # ...remaining for further processing : 120
% 0.23/1.42 # Other redundant clauses eliminated : 10
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 7
% 0.23/1.42 # Backward-rewritten : 40
% 0.23/1.42 # Generated clauses : 258
% 0.23/1.42 # ...of the previous two non-trivial : 214
% 0.23/1.42 # Contextual simplify-reflections : 12
% 0.23/1.42 # Paramodulations : 230
% 0.23/1.42 # Factorizations : 6
% 0.23/1.42 # Equation resolutions : 20
% 0.23/1.42 # Current number of processed clauses : 70
% 0.23/1.42 # Positive orientable unit clauses : 27
% 0.23/1.42 # Positive unorientable unit clauses: 1
% 0.23/1.42 # Negative unit clauses : 5
% 0.23/1.42 # Non-unit-clauses : 37
% 0.23/1.42 # Current number of unprocessed clauses: 89
% 0.23/1.42 # ...number of literals in the above : 259
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 50
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 806
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 676
% 0.23/1.42 # Non-unit clause-clause subsumptions : 41
% 0.23/1.42 # Unit Clause-clause subsumption calls : 179
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 11
% 0.23/1.42 # BW rewrite match successes : 10
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 4214
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.012 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.014 s
% 0.23/1.42 # Maximum resident set size: 3204 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------