TSTP Solution File: NUM460+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM460+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:39 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 63 ( 17 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 61 ( 18 ~; 15 |; 24 &)
% ( 0 <=>; 4 =>; 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 : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 11 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xn )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xn,X1) = xl )
& sdtlseqdt0(xn,xl) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xl )
| sdtlseqdt0(xm,xl) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddAsso) ).
fof(m__773,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__773) ).
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(c_0_4,negated_conjecture,
~ ( ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xn )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xn,X1) = xl )
& sdtlseqdt0(xn,xl) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xl )
| sdtlseqdt0(xm,xl) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| sdtpldt0(sdtpldt0(X4,X5),X6) = sdtpldt0(X4,sdtpldt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
fof(c_0_6,negated_conjecture,
! [X4] :
( aNaturalNumber0(esk1_0)
& sdtpldt0(xm,esk1_0) = xn
& sdtlseqdt0(xm,xn)
& aNaturalNumber0(esk2_0)
& sdtpldt0(xn,esk2_0) = xl
& sdtlseqdt0(xn,xl)
& ( ~ aNaturalNumber0(X4)
| sdtpldt0(xm,X4) != xl )
& ~ sdtlseqdt0(xm,xl) ),
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)],[c_0_4])])])])])]) ).
cnf(c_0_7,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
sdtpldt0(xm,esk1_0) = xn,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
aNaturalNumber0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__773]) ).
cnf(c_0_11,negated_conjecture,
sdtpldt0(xn,esk2_0) = xl,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( sdtpldt0(xn,X1) = sdtpldt0(xm,sdtpldt0(esk1_0,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( sdtpldt0(xm,X1) != xl
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
sdtpldt0(xm,sdtpldt0(esk1_0,esk2_0)) = xl,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_17,negated_conjecture,
~ aNaturalNumber0(sdtpldt0(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_13]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM460+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jul 7 10:23:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.016 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 20
% 0.22/1.41 # Proof object clause steps : 12
% 0.22/1.41 # Proof object formula steps : 8
% 0.22/1.41 # Proof object conjectures : 12
% 0.22/1.41 # Proof object clause conjectures : 9
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 8
% 0.22/1.41 # Proof object initial formulas used : 4
% 0.22/1.41 # Proof object generating inferences : 4
% 0.22/1.41 # Proof object simplifying inferences : 8
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 23
% 0.22/1.41 # Removed by relevancy pruning/SinE : 3
% 0.22/1.41 # Initial clauses : 37
% 0.22/1.41 # Removed in clause preprocessing : 1
% 0.22/1.41 # Initial clauses in saturation : 36
% 0.22/1.41 # Processed clauses : 101
% 0.22/1.41 # ...of these trivial : 2
% 0.22/1.41 # ...subsumed : 33
% 0.22/1.41 # ...remaining for further processing : 66
% 0.22/1.41 # Other redundant clauses eliminated : 3
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 1
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 328
% 0.22/1.41 # ...of the previous two non-trivial : 297
% 0.22/1.41 # Contextual simplify-reflections : 1
% 0.22/1.41 # Paramodulations : 320
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 8
% 0.22/1.41 # Current number of processed clauses : 65
% 0.22/1.41 # Positive orientable unit clauses : 16
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 9
% 0.22/1.41 # Non-unit-clauses : 40
% 0.22/1.41 # Current number of unprocessed clauses: 232
% 0.22/1.41 # ...number of literals in the above : 955
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 1
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 298
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 213
% 0.22/1.41 # Non-unit clause-clause subsumptions : 24
% 0.22/1.41 # Unit Clause-clause subsumption calls : 114
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 2
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 6520
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.024 s
% 0.22/1.41 # System time : 0.001 s
% 0.22/1.41 # Total time : 0.025 s
% 0.22/1.41 # Maximum resident set size: 3060 pages
%------------------------------------------------------------------------------