TSTP Solution File: NUM472+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM472+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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:48 EDT 2022
% Result : Theorem 0.23s 1.43s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 45 ( 4 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 53 ( 23 ~; 20 |; 7 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 9 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtlseqdt0(xm,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1324) ).
fof(c_0_4,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,plain,
! [X4,X5,X7] :
( ( aNaturalNumber0(esk2_2(X4,X5))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( sdtpldt0(X4,esk2_2(X4,X5)) = X5
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X7)
| sdtpldt0(X4,X7) != X5
| sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(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)],[mDefLE])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
fof(c_0_7,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X3) != X1
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( sdtlseqdt0(X1,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_8]),c_0_9]) ).
cnf(c_0_12,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM472+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n011.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 : Thu Jul 7 09:59:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.43 # Preprocessing time : 0.018 s
% 0.23/1.43
% 0.23/1.43 # Proof found!
% 0.23/1.43 # SZS status Theorem
% 0.23/1.43 # SZS output start CNFRefutation
% See solution above
% 0.23/1.43 # Proof object total steps : 15
% 0.23/1.43 # Proof object clause steps : 7
% 0.23/1.43 # Proof object formula steps : 8
% 0.23/1.43 # Proof object conjectures : 5
% 0.23/1.43 # Proof object clause conjectures : 2
% 0.23/1.43 # Proof object formula conjectures : 3
% 0.23/1.43 # Proof object initial clauses used : 5
% 0.23/1.43 # Proof object initial formulas used : 4
% 0.23/1.43 # Proof object generating inferences : 2
% 0.23/1.43 # Proof object simplifying inferences : 4
% 0.23/1.43 # Training examples: 0 positive, 0 negative
% 0.23/1.43 # Parsed axioms : 39
% 0.23/1.43 # Removed by relevancy pruning/SinE : 6
% 0.23/1.43 # Initial clauses : 55
% 0.23/1.43 # Removed in clause preprocessing : 1
% 0.23/1.43 # Initial clauses in saturation : 54
% 0.23/1.43 # Processed clauses : 113
% 0.23/1.43 # ...of these trivial : 2
% 0.23/1.43 # ...subsumed : 19
% 0.23/1.43 # ...remaining for further processing : 92
% 0.23/1.43 # Other redundant clauses eliminated : 6
% 0.23/1.43 # Clauses deleted for lack of memory : 0
% 0.23/1.43 # Backward-subsumed : 1
% 0.23/1.43 # Backward-rewritten : 1
% 0.23/1.43 # Generated clauses : 405
% 0.23/1.43 # ...of the previous two non-trivial : 355
% 0.23/1.43 # Contextual simplify-reflections : 9
% 0.23/1.43 # Paramodulations : 385
% 0.23/1.43 # Factorizations : 0
% 0.23/1.43 # Equation resolutions : 20
% 0.23/1.43 # Current number of processed clauses : 89
% 0.23/1.43 # Positive orientable unit clauses : 14
% 0.23/1.43 # Positive unorientable unit clauses: 0
% 0.23/1.43 # Negative unit clauses : 3
% 0.23/1.43 # Non-unit-clauses : 72
% 0.23/1.43 # Current number of unprocessed clauses: 285
% 0.23/1.43 # ...number of literals in the above : 1637
% 0.23/1.43 # Current number of archived formulas : 0
% 0.23/1.43 # Current number of archived clauses : 2
% 0.23/1.43 # Clause-clause subsumption calls (NU) : 832
% 0.23/1.43 # Rec. Clause-clause subsumption calls : 399
% 0.23/1.43 # Non-unit clause-clause subsumptions : 28
% 0.23/1.43 # Unit Clause-clause subsumption calls : 22
% 0.23/1.43 # Rewrite failures with RHS unbound : 0
% 0.23/1.43 # BW rewrite match attempts : 1
% 0.23/1.43 # BW rewrite match successes : 1
% 0.23/1.43 # Condensation attempts : 0
% 0.23/1.43 # Condensation successes : 0
% 0.23/1.43 # Termbank termtop insertions : 10049
% 0.23/1.43
% 0.23/1.43 # -------------------------------------------------
% 0.23/1.43 # User time : 0.025 s
% 0.23/1.43 # System time : 0.005 s
% 0.23/1.43 # Total time : 0.030 s
% 0.23/1.43 # Maximum resident set size: 3328 pages
%------------------------------------------------------------------------------