TSTP Solution File: NUM405+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM405+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.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 3 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 43 ( 18 ~; 17 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 25 ( 2 sgn 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t38_ordinal1,conjecture,
! [X1] :
~ ! [X2] :
( ordinal(X2)
=> in(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t38_ordinal1) ).
fof(s1_xboole_0__e2_43__ordinal1,axiom,
! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& ordinal(X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_xboole_0__e2_43__ordinal1) ).
fof(t37_ordinal1,axiom,
! [X1] :
~ ! [X2] :
( in(X2,X1)
<=> ordinal(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t37_ordinal1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
~ ! [X2] :
( ordinal(X2)
=> in(X2,X1) ),
inference(assume_negation,[status(cth)],[t38_ordinal1]) ).
fof(c_0_4,plain,
! [X4,X6,X6] :
( ( in(X6,X4)
| ~ in(X6,esk2_1(X4)) )
& ( ordinal(X6)
| ~ in(X6,esk2_1(X4)) )
& ( ~ in(X6,X4)
| ~ ordinal(X6)
| in(X6,esk2_1(X4)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[s1_xboole_0__e2_43__ordinal1])])])])])]) ).
fof(c_0_5,plain,
! [X3] :
( ( ~ in(esk3_1(X3),X3)
| ~ ordinal(esk3_1(X3)) )
& ( in(esk3_1(X3),X3)
| ordinal(esk3_1(X3)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_ordinal1])])]) ).
fof(c_0_6,negated_conjecture,
! [X4] :
( ~ ordinal(X4)
| in(X4,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
( in(X1,esk2_1(X2))
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ordinal(esk3_1(X1))
| in(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( in(X1,esk1_0)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(esk3_1(X1),esk2_1(X2))
| in(esk3_1(X1),X1)
| ~ in(esk3_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( in(esk3_1(X1),esk1_0)
| in(esk3_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( in(esk3_1(X1),esk2_1(esk1_0))
| in(esk3_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( ordinal(X1)
| ~ in(X1,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
in(esk3_1(esk2_1(esk1_0)),esk2_1(esk1_0)),
inference(ef,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( ~ ordinal(esk3_1(X1))
| ~ in(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
ordinal(esk3_1(esk2_1(esk1_0))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM405+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 12:31:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.017 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 18
% 0.25/1.43 # Proof object clause steps : 11
% 0.25/1.43 # Proof object formula steps : 7
% 0.25/1.43 # Proof object conjectures : 9
% 0.25/1.43 # Proof object clause conjectures : 6
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 5
% 0.25/1.43 # Proof object initial formulas used : 3
% 0.25/1.43 # Proof object generating inferences : 6
% 0.25/1.43 # Proof object simplifying inferences : 2
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 33
% 0.25/1.43 # Removed by relevancy pruning/SinE : 22
% 0.25/1.43 # Initial clauses : 16
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 16
% 0.25/1.43 # Processed clauses : 52
% 0.25/1.43 # ...of these trivial : 2
% 0.25/1.43 # ...subsumed : 9
% 0.25/1.43 # ...remaining for further processing : 41
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 3
% 0.25/1.43 # Generated clauses : 72
% 0.25/1.43 # ...of the previous two non-trivial : 67
% 0.25/1.43 # Contextual simplify-reflections : 3
% 0.25/1.43 # Paramodulations : 68
% 0.25/1.43 # Factorizations : 4
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 38
% 0.25/1.43 # Positive orientable unit clauses : 8
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 5
% 0.25/1.43 # Non-unit-clauses : 25
% 0.25/1.43 # Current number of unprocessed clauses: 31
% 0.25/1.43 # ...number of literals in the above : 68
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 3
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 51
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 48
% 0.25/1.43 # Non-unit clause-clause subsumptions : 7
% 0.25/1.43 # Unit Clause-clause subsumption calls : 17
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 2
% 0.25/1.43 # BW rewrite match successes : 1
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 1711
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.015 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.019 s
% 0.25/1.43 # Maximum resident set size: 2944 pages
%------------------------------------------------------------------------------