TSTP Solution File: NUM508+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM508+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:56:06 EDT 2023
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 82 ( 5 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 87 ( 37 ~; 31 |; 13 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 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 : 21 ( 0 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( doDivides0(xr,xn)
| doDivides0(xr,xm) ),
file('/export/starexec/sandbox/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p',m__) ).
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/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p',m__1799) ).
fof(mIH_03,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p',mIH_03) ).
fof(m__2362,hypothesis,
( sdtlseqdt0(xr,xk)
& doDivides0(xr,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p',m__2362) ).
fof(m__2342,hypothesis,
( aNaturalNumber0(xr)
& doDivides0(xr,xk)
& isPrime0(xr) ),
file('/export/starexec/sandbox/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p',m__2342) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p',m__1837) ).
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/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p',m__2478) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p',mSortsB) ).
fof(c_0_8,negated_conjecture,
~ ( doDivides0(xr,xn)
| doDivides0(xr,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,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_10,negated_conjecture,
( ~ doDivides0(xr,xn)
& ~ doDivides0(xr,xm) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X22,X23] :
( ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23)
| X22 = X23
| ~ sdtlseqdt0(X22,X23)
| iLess0(X22,X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIH_03])]) ).
cnf(c_0_12,hypothesis,
( doDivides0(X3,X1)
| doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ isPrime0(X3)
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| ~ iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
doDivides0(xr,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__2362]) ).
cnf(c_0_14,hypothesis,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_15,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_16,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_17,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_18,negated_conjecture,
~ doDivides0(xr,xm),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
~ doDivides0(xr,xn),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(split_conjunct,[status(thm)],[m__2478]) ).
cnf(c_0_22,hypothesis,
sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[m__2478]) ).
cnf(c_0_23,hypothesis,
~ iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
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(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17])]),c_0_18]),c_0_19]) ).
fof(c_0_24,plain,
! [X24,X25] :
( ~ aNaturalNumber0(X24)
| ~ aNaturalNumber0(X25)
| aNaturalNumber0(sdtpldt0(X24,X25)) ),
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(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_28,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))
| ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_29,hypothesis,
~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_16]),c_0_17])]) ).
cnf(c_0_30,hypothesis,
~ aNaturalNumber0(sdtpldt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_15])]) ).
cnf(c_0_31,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM508+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n009.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 13:23:29 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.qD8wCJOv2s/E---3.1_5573.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # new_bool_3 with pid 5652 completed with status 0
% 0.15/0.45 # Result found by new_bool_3
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.15/0.45 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 5657 completed with status 0
% 0.15/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.15/0.45 # Preprocessing time : 0.002 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Theorem
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 52
% 0.15/0.45 # Removed by relevancy pruning/SinE : 1
% 0.15/0.45 # Initial clauses : 95
% 0.15/0.45 # Removed in clause preprocessing : 3
% 0.15/0.45 # Initial clauses in saturation : 92
% 0.15/0.45 # Processed clauses : 461
% 0.15/0.45 # ...of these trivial : 2
% 0.15/0.45 # ...subsumed : 106
% 0.15/0.45 # ...remaining for further processing : 353
% 0.15/0.45 # Other redundant clauses eliminated : 21
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 21
% 0.15/0.45 # Backward-rewritten : 13
% 0.15/0.45 # Generated clauses : 1080
% 0.15/0.45 # ...of the previous two non-redundant : 946
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 9
% 0.15/0.45 # Paramodulations : 1053
% 0.15/0.45 # Factorizations : 2
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 25
% 0.15/0.45 # Total rewrite steps : 1279
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 226
% 0.15/0.45 # Positive orientable unit clauses : 48
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 23
% 0.15/0.45 # Non-unit-clauses : 155
% 0.15/0.45 # Current number of unprocessed clauses: 644
% 0.15/0.45 # ...number of literals in the above : 2692
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 119
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 3071
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 1226
% 0.15/0.45 # Non-unit clause-clause subsumptions : 121
% 0.15/0.45 # Unit Clause-clause subsumption calls : 184
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 8
% 0.15/0.45 # BW rewrite match successes : 8
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 24457
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.035 s
% 0.15/0.45 # System time : 0.002 s
% 0.15/0.45 # Total time : 0.037 s
% 0.15/0.45 # Maximum resident set size: 2044 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.038 s
% 0.15/0.45 # System time : 0.003 s
% 0.15/0.45 # Total time : 0.041 s
% 0.15/0.45 # Maximum resident set size: 1740 pages
% 0.15/0.45 % E---3.1 exiting
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------