TSTP Solution File: NUM478+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM478+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:52 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 15 unt; 0 def)
% Number of atoms : 88 ( 43 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 92 ( 36 ~; 31 |; 17 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 16 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtasdt0(X1,X2) = sdtasdt0(X1,X3)
| sdtasdt0(X2,X1) = sdtasdt0(X3,X1) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulCanc) ).
fof(m__1524_04,hypothesis,
( xl != sz00
& ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1) )
& doDivides0(xl,xm) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1524_04) ).
fof(m__,conjecture,
( ( aNaturalNumber0(sdtsldt0(xm,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl)) )
=> ( sdtasdt0(xn,xm) = sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))
| sdtasdt0(xn,sdtsldt0(xm,xl)) = sdtsldt0(sdtasdt0(xn,xm),xl) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1524,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1524) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulComm) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulAsso) ).
fof(m__1553,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1553) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,X5) != sdtasdt0(X4,X6)
| X5 = X6
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| X4 = sz00
| ~ aNaturalNumber0(X4) )
& ( sdtasdt0(X5,X4) != sdtasdt0(X6,X4)
| X5 = X6
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| X4 = sz00
| ~ aNaturalNumber0(X4) ) ),
inference(distribute,[status(thm)],[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)],[mMulCanc])])])])])]) ).
fof(c_0_8,hypothesis,
( xl != sz00
& aNaturalNumber0(esk1_0)
& xm = sdtasdt0(xl,esk1_0)
& doDivides0(xl,xm) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__1524_04])])])]) ).
fof(c_0_9,negated_conjecture,
~ ( ( aNaturalNumber0(sdtsldt0(xm,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl)) )
=> ( sdtasdt0(xn,xm) = sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))
| sdtasdt0(xn,sdtsldt0(xm,xl)) = sdtsldt0(sdtasdt0(xn,xm),xl) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_10,plain,
( X1 = sz00
| X3 = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtasdt0(X1,X3) != sdtasdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
xm = sdtasdt0(xl,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
aNaturalNumber0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_14,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,negated_conjecture,
( aNaturalNumber0(sdtsldt0(xm,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& sdtasdt0(xn,xm) != sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))
& sdtasdt0(xn,sdtsldt0(xm,xl)) != sdtsldt0(sdtasdt0(xn,xm),xl) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
( X1 = esk1_0
| sdtasdt0(xl,X1) != xm
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[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])]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
xm = sdtasdt0(xl,sdtsldt0(xm,xl)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
aNaturalNumber0(sdtsldt0(xm,xl)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
sdtasdt0(xn,xm) != sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
sdtsldt0(xm,xl) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| sdtasdt0(sdtasdt0(X4,X5),X6) = sdtasdt0(X4,sdtasdt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
cnf(c_0_23,negated_conjecture,
sdtasdt0(xl,sdtasdt0(xn,esk1_0)) != sdtasdt0(xn,xm),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1553]) ).
cnf(c_0_26,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
sdtasdt0(xl,sdtasdt0(esk1_0,xn)) != sdtasdt0(xn,xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_12]),c_0_25])]) ).
cnf(c_0_28,hypothesis,
( sdtasdt0(xl,sdtasdt0(esk1_0,X1)) = sdtasdt0(xm,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_29,negated_conjecture,
sdtasdt0(xm,xn) != sdtasdt0(xn,xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25])]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_24]),c_0_25]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM478+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 : Tue Jul 5 10:16:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.018 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 32
% 0.23/1.40 # Proof object clause steps : 19
% 0.23/1.40 # Proof object formula steps : 13
% 0.23/1.40 # Proof object conjectures : 11
% 0.23/1.40 # Proof object clause conjectures : 8
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 12
% 0.23/1.40 # Proof object initial formulas used : 7
% 0.23/1.40 # Proof object generating inferences : 6
% 0.23/1.40 # Proof object simplifying inferences : 18
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 39
% 0.23/1.40 # Removed by relevancy pruning/SinE : 6
% 0.23/1.40 # Initial clauses : 59
% 0.23/1.40 # Removed in clause preprocessing : 1
% 0.23/1.40 # Initial clauses in saturation : 58
% 0.23/1.40 # Processed clauses : 151
% 0.23/1.40 # ...of these trivial : 1
% 0.23/1.40 # ...subsumed : 42
% 0.23/1.40 # ...remaining for further processing : 108
% 0.23/1.40 # Other redundant clauses eliminated : 6
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 4
% 0.23/1.40 # Generated clauses : 568
% 0.23/1.40 # ...of the previous two non-trivial : 511
% 0.23/1.40 # Contextual simplify-reflections : 12
% 0.23/1.40 # Paramodulations : 553
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 15
% 0.23/1.40 # Current number of processed clauses : 103
% 0.23/1.40 # Positive orientable unit clauses : 14
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 5
% 0.23/1.40 # Non-unit-clauses : 84
% 0.23/1.40 # Current number of unprocessed clauses: 398
% 0.23/1.40 # ...number of literals in the above : 2134
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 4
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 1017
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 494
% 0.23/1.40 # Non-unit clause-clause subsumptions : 52
% 0.23/1.40 # Unit Clause-clause subsumption calls : 60
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 1
% 0.23/1.40 # BW rewrite match successes : 1
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 12601
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.033 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.036 s
% 0.23/1.40 # Maximum resident set size: 3344 pages
%------------------------------------------------------------------------------