TSTP Solution File: NUM508+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM508+1 : TPTP v8.1.0. Released v4.0.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:33:12 EDT 2022
% Result : Theorem 0.28s 1.45s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 91 ( 6 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 103 ( 43 ~; 41 |; 13 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1799,hypothesis,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( isPrime0(X3)
& doDivides0(X3,sdtasdt0(X1,X2)) )
=> ( iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
=> ( doDivides0(X3,X1)
| doDivides0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1799) ).
fof(mIH_03,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIH_03) ).
fof(m__,conjecture,
( doDivides0(xr,xn)
| doDivides0(xr,xm) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__2478,hypothesis,
( sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp)
& sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2478) ).
fof(m__2342,hypothesis,
( aNaturalNumber0(xr)
& doDivides0(xr,xk)
& isPrime0(xr) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2342) ).
fof(m__2362,hypothesis,
( sdtlseqdt0(xr,xk)
& doDivides0(xr,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2362) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1837) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB) ).
fof(c_0_8,hypothesis,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ~ isPrime0(X6)
| ~ doDivides0(X6,sdtasdt0(X4,X5))
| ~ iLess0(sdtpldt0(sdtpldt0(X4,X5),X6),sdtpldt0(sdtpldt0(xn,xm),xp))
| doDivides0(X6,X4)
| doDivides0(X6,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1799])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| X3 = X4
| ~ sdtlseqdt0(X3,X4)
| iLess0(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIH_03])]) ).
fof(c_0_10,negated_conjecture,
~ ( doDivides0(xr,xn)
| doDivides0(xr,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_11,hypothesis,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ iLess0(sdtpldt0(sdtpldt0(X3,X2),X1),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ doDivides0(X1,sdtasdt0(X3,X2))
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( iLess0(X1,X2)
| X1 = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
( ~ doDivides0(xr,xn)
& ~ doDivides0(xr,xm) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtpldt0(xn,xm),xp)
| doDivides0(X3,X1)
| doDivides0(X3,X2)
| ~ isPrime0(X3)
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| ~ sdtlseqdt0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(X1,X2),X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(split_conjunct,[status(thm)],[m__2478]) ).
cnf(c_0_16,hypothesis,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_17,hypothesis,
doDivides0(xr,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__2362]) ).
cnf(c_0_18,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_20,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_21,hypothesis,
sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[m__2478]) ).
cnf(c_0_22,negated_conjecture,
~ doDivides0(xr,xn),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
~ doDivides0(xr,xm),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_24,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_25,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20])]) ).
cnf(c_0_28,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_29,hypothesis,
~ aNaturalNumber0(sdtpldt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_26]),c_0_28])]) ).
cnf(c_0_30,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_19]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : NUM508+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : run_ET %s %d
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jul 5 11:19:14 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.28/1.45 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.28/1.45 # Preprocessing time : 0.020 s
% 0.28/1.45
% 0.28/1.45 # Proof found!
% 0.28/1.45 # SZS status Theorem
% 0.28/1.45 # SZS output start CNFRefutation
% See solution above
% 0.28/1.45 # Proof object total steps : 31
% 0.28/1.45 # Proof object clause steps : 18
% 0.28/1.45 # Proof object formula steps : 13
% 0.28/1.45 # Proof object conjectures : 5
% 0.28/1.45 # Proof object clause conjectures : 2
% 0.28/1.45 # Proof object formula conjectures : 3
% 0.28/1.45 # Proof object initial clauses used : 13
% 0.28/1.45 # Proof object initial formulas used : 8
% 0.28/1.45 # Proof object generating inferences : 5
% 0.28/1.45 # Proof object simplifying inferences : 16
% 0.28/1.45 # Training examples: 0 positive, 0 negative
% 0.28/1.45 # Parsed axioms : 52
% 0.28/1.45 # Removed by relevancy pruning/SinE : 0
% 0.28/1.45 # Initial clauses : 98
% 0.28/1.45 # Removed in clause preprocessing : 3
% 0.28/1.45 # Initial clauses in saturation : 95
% 0.28/1.45 # Processed clauses : 1546
% 0.28/1.45 # ...of these trivial : 38
% 0.28/1.45 # ...subsumed : 781
% 0.28/1.45 # ...remaining for further processing : 727
% 0.28/1.45 # Other redundant clauses eliminated : 82
% 0.28/1.45 # Clauses deleted for lack of memory : 0
% 0.28/1.45 # Backward-subsumed : 35
% 0.28/1.45 # Backward-rewritten : 74
% 0.28/1.45 # Generated clauses : 21017
% 0.28/1.45 # ...of the previous two non-trivial : 20234
% 0.28/1.45 # Contextual simplify-reflections : 424
% 0.28/1.45 # Paramodulations : 20868
% 0.28/1.45 # Factorizations : 2
% 0.28/1.45 # Equation resolutions : 126
% 0.28/1.45 # Current number of processed clauses : 606
% 0.28/1.45 # Positive orientable unit clauses : 84
% 0.28/1.45 # Positive unorientable unit clauses: 0
% 0.28/1.45 # Negative unit clauses : 56
% 0.28/1.45 # Non-unit-clauses : 466
% 0.28/1.45 # Current number of unprocessed clauses: 17373
% 0.28/1.45 # ...number of literals in the above : 118493
% 0.28/1.45 # Current number of archived formulas : 0
% 0.28/1.45 # Current number of archived clauses : 114
% 0.28/1.45 # Clause-clause subsumption calls (NU) : 76043
% 0.28/1.45 # Rec. Clause-clause subsumption calls : 14469
% 0.28/1.45 # Non-unit clause-clause subsumptions : 823
% 0.28/1.45 # Unit Clause-clause subsumption calls : 4727
% 0.28/1.45 # Rewrite failures with RHS unbound : 0
% 0.28/1.45 # BW rewrite match attempts : 22
% 0.28/1.45 # BW rewrite match successes : 21
% 0.28/1.45 # Condensation attempts : 0
% 0.28/1.45 # Condensation successes : 0
% 0.28/1.45 # Termbank termtop insertions : 453129
% 0.28/1.45
% 0.28/1.45 # -------------------------------------------------
% 0.28/1.45 # User time : 0.358 s
% 0.28/1.45 # System time : 0.016 s
% 0.28/1.45 # Total time : 0.374 s
% 0.28/1.45 # Maximum resident set size: 22080 pages
% 0.28/23.44 eprover: CPU time limit exceeded, terminating
% 0.28/23.45 eprover: CPU time limit exceeded, terminating
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.28/23.51 eprover: No such file or directory
% 0.28/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.51 eprover: No such file or directory
% 0.28/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.52 eprover: No such file or directory
% 0.28/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.52 eprover: No such file or directory
%------------------------------------------------------------------------------