TSTP Solution File: NUM488+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM488+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:59 EDT 2022
% Result : Theorem 0.38s 24.57s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 16 unt; 0 def)
% Number of atoms : 143 ( 23 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 184 ( 80 ~; 76 |; 19 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 1 sgn 28 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDiff) ).
fof(mDivMin,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X1,sdtpldt0(X2,X3)) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDivMin) ).
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAMDistr) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).
fof(m__,conjecture,
doDivides0(xp,sdtasdt0(xr,xm)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1883,hypothesis,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1883) ).
fof(m__1870,hypothesis,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1870) ).
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(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDiv) ).
fof(m__1860,hypothesis,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1860) ).
fof(c_0_10,plain,
! [X4,X5,X6,X6] :
( ( aNaturalNumber0(X6)
| X6 != sdtmndt0(X5,X4)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( sdtpldt0(X4,X6) = X5
| X6 != sdtmndt0(X5,X4)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| sdtpldt0(X4,X6) != X5
| X6 = sdtmndt0(X5,X4)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
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)],[mDefDiff])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ~ doDivides0(X4,X5)
| ~ doDivides0(X4,sdtpldt0(X5,X6))
| doDivides0(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivMin])]) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) )
& ( sdtasdt0(sdtpldt0(X5,X6),X4) = sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_14,plain,
( sdtpldt0(X2,X3) = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| X3 != sdtmndt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| X3 != sdtmndt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xr,xm)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_17,plain,
( doDivides0(X1,X2)
| ~ doDivides0(X1,sdtpldt0(X3,X2))
| ~ doDivides0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( sdtasdt0(sdtpldt0(X2,X1),X3) = sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X1,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( sdtpldt0(X1,sdtmndt0(X2,X1)) = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
xr = sdtmndt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_22,hypothesis,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[m__1870]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_25,plain,
( aNaturalNumber0(sdtmndt0(X1,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
fof(c_0_26,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xr,xm)),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( doDivides0(X1,sdtasdt0(X2,X3))
| ~ doDivides0(X1,sdtasdt0(sdtpldt0(X4,X2),X3))
| ~ doDivides0(X1,sdtasdt0(X4,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_28,hypothesis,
sdtpldt0(xp,xr) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xr),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
fof(c_0_30,plain,
! [X4,X5,X7] :
( ( aNaturalNumber0(esk2_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( X5 = sdtasdt0(X4,esk2_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X7)
| X5 != sdtasdt0(X4,X7)
| doDivides0(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)],[mDefDiv])])])])])])]) ).
cnf(c_0_31,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xr,xm)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,hypothesis,
( doDivides0(X1,sdtasdt0(xr,X2))
| ~ doDivides0(X1,sdtasdt0(xn,X2))
| ~ doDivides0(X1,sdtasdt0(xp,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23]),c_0_29])]) ).
cnf(c_0_33,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_35,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_23]),c_0_34])]) ).
cnf(c_0_37,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_35]),c_0_19]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM488+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.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 : Thu Jul 7 10:35:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.43 eprover: CPU time limit exceeded, terminating
% 0.38/24.57 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.38/24.57
% 0.38/24.57 # Failure: Resource limit exceeded (time)
% 0.38/24.57 # OLD status Res
% 0.38/24.57 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.38/24.57 # Preprocessing time : 0.019 s
% 0.38/24.57 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.38/24.57 # Preprocessing time : 0.021 s
% 0.38/24.57
% 0.38/24.57 # Proof found!
% 0.38/24.57 # SZS status Theorem
% 0.38/24.57 # SZS output start CNFRefutation
% See solution above
% 0.38/24.57 # Proof object total steps : 39
% 0.38/24.57 # Proof object clause steps : 22
% 0.38/24.57 # Proof object formula steps : 17
% 0.38/24.57 # Proof object conjectures : 6
% 0.38/24.57 # Proof object clause conjectures : 3
% 0.38/24.57 # Proof object formula conjectures : 3
% 0.38/24.57 # Proof object initial clauses used : 13
% 0.38/24.57 # Proof object initial formulas used : 10
% 0.38/24.57 # Proof object generating inferences : 9
% 0.38/24.57 # Proof object simplifying inferences : 21
% 0.38/24.57 # Training examples: 0 positive, 0 negative
% 0.38/24.57 # Parsed axioms : 45
% 0.38/24.57 # Removed by relevancy pruning/SinE : 0
% 0.38/24.57 # Initial clauses : 81
% 0.38/24.57 # Removed in clause preprocessing : 3
% 0.38/24.57 # Initial clauses in saturation : 78
% 0.38/24.57 # Processed clauses : 2622
% 0.38/24.57 # ...of these trivial : 32
% 0.38/24.57 # ...subsumed : 1694
% 0.38/24.57 # ...remaining for further processing : 896
% 0.38/24.57 # Other redundant clauses eliminated : 63
% 0.38/24.57 # Clauses deleted for lack of memory : 0
% 0.38/24.57 # Backward-subsumed : 134
% 0.38/24.57 # Backward-rewritten : 43
% 0.38/24.57 # Generated clauses : 14542
% 0.38/24.57 # ...of the previous two non-trivial : 13223
% 0.38/24.57 # Contextual simplify-reflections : 1362
% 0.38/24.57 # Paramodulations : 14411
% 0.38/24.57 # Factorizations : 5
% 0.38/24.57 # Equation resolutions : 118
% 0.38/24.57 # Current number of processed clauses : 710
% 0.38/24.57 # Positive orientable unit clauses : 40
% 0.38/24.57 # Positive unorientable unit clauses: 0
% 0.38/24.57 # Negative unit clauses : 30
% 0.38/24.57 # Non-unit-clauses : 640
% 0.38/24.57 # Current number of unprocessed clauses: 10165
% 0.38/24.57 # ...number of literals in the above : 67108
% 0.38/24.57 # Current number of archived formulas : 0
% 0.38/24.57 # Current number of archived clauses : 185
% 0.38/24.57 # Clause-clause subsumption calls (NU) : 318802
% 0.38/24.57 # Rec. Clause-clause subsumption calls : 74175
% 0.38/24.57 # Non-unit clause-clause subsumptions : 2597
% 0.38/24.57 # Unit Clause-clause subsumption calls : 5549
% 0.38/24.57 # Rewrite failures with RHS unbound : 0
% 0.38/24.57 # BW rewrite match attempts : 15
% 0.38/24.57 # BW rewrite match successes : 15
% 0.38/24.57 # Condensation attempts : 0
% 0.38/24.57 # Condensation successes : 0
% 0.38/24.57 # Termbank termtop insertions : 267884
% 0.38/24.57
% 0.38/24.57 # -------------------------------------------------
% 0.38/24.57 # User time : 0.341 s
% 0.38/24.57 # System time : 0.010 s
% 0.38/24.57 # Total time : 0.351 s
% 0.38/24.57 # Maximum resident set size: 14668 pages
%------------------------------------------------------------------------------