TSTP Solution File: NUM523+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM523+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 300s
% DateTime : Tue May 21 01:14:28 EDT 2024
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 94 ( 15 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 112 ( 46 ~; 36 |; 25 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 15 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__2987,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp)
& xn != sz00
& xm != sz00
& xp != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2987) ).
fof(m__,conjecture,
( doDivides0(xp,sdtasdt0(xn,xn))
& doDivides0(xp,xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__3014,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3014) ).
fof(mPDP,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( isPrime0(X3)
& doDivides0(X3,sdtasdt0(X1,X2)) )
=> ( doDivides0(X3,X1)
| doDivides0(X3,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mPDP) ).
fof(m__3025,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3025) ).
fof(c_0_7,plain,
! [X44,X45,X47] :
( ( aNaturalNumber0(esk3_2(X44,X45))
| ~ doDivides0(X44,X45)
| ~ aNaturalNumber0(X44)
| ~ aNaturalNumber0(X45) )
& ( X45 = sdtasdt0(X44,esk3_2(X44,X45))
| ~ doDivides0(X44,X45)
| ~ aNaturalNumber0(X44)
| ~ aNaturalNumber0(X45) )
& ( ~ aNaturalNumber0(X47)
| X45 != sdtasdt0(X44,X47)
| doDivides0(X44,X45)
| ~ aNaturalNumber0(X44)
| ~ aNaturalNumber0(X45) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])]) ).
fof(c_0_8,plain,
! [X34,X35] :
( ~ aNaturalNumber0(X34)
| ~ aNaturalNumber0(X35)
| aNaturalNumber0(sdtasdt0(X34,X35)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_9,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp)
& xn != sz00
& xm != sz00
& xp != sz00 ),
inference(fof_simplification,[status(thm)],[m__2987]) ).
cnf(c_0_10,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp)
& xn != sz00
& xm != sz00
& xp != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ ( doDivides0(xp,sdtasdt0(xn,xn))
& doDivides0(xp,xn) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_14,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_15,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
inference(split_conjunct,[status(thm)],[m__3014]) ).
cnf(c_0_16,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,negated_conjecture,
( ~ doDivides0(xp,sdtasdt0(xn,xn))
| ~ doDivides0(xp,xn) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
cnf(c_0_18,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X27,X28,X29] :
( ~ aNaturalNumber0(X27)
| ~ aNaturalNumber0(X28)
| ~ aNaturalNumber0(X29)
| ~ isPrime0(X29)
| ~ doDivides0(X29,sdtasdt0(X27,X28))
| doDivides0(X29,X27)
| doDivides0(X29,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mPDP])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ doDivides0(xp,sdtasdt0(xn,xn))
| ~ doDivides0(xp,xn) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
doDivides0(xp,sdtasdt0(xn,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_19])]) ).
cnf(c_0_23,plain,
( doDivides0(X3,X1)
| doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ isPrime0(X3)
| ~ doDivides0(X3,sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__3025]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
~ doDivides0(xp,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_24]),c_0_16]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : NUM523+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n026.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 05:38:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.17/0.46 # Version: 3.1.0
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_1 with pid 26741 completed with status 0
% 0.17/0.46 # Result found by new_bool_1
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 26743 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.46 # Preprocessing time : 0.002 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 44
% 0.17/0.46 # Removed by relevancy pruning/SinE : 3
% 0.17/0.46 # Initial clauses : 74
% 0.17/0.46 # Removed in clause preprocessing : 3
% 0.17/0.46 # Initial clauses in saturation : 71
% 0.17/0.46 # Processed clauses : 218
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 52
% 0.17/0.46 # ...remaining for further processing : 166
% 0.17/0.46 # Other redundant clauses eliminated : 13
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 2
% 0.17/0.46 # Backward-rewritten : 10
% 0.17/0.46 # Generated clauses : 375
% 0.17/0.46 # ...of the previous two non-redundant : 324
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 2
% 0.17/0.46 # Paramodulations : 356
% 0.17/0.46 # Factorizations : 2
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 17
% 0.17/0.46 # Disequality decompositions : 0
% 0.17/0.46 # Total rewrite steps : 298
% 0.17/0.46 # ...of those cached : 283
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 83
% 0.17/0.46 # Positive orientable unit clauses : 14
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 7
% 0.17/0.46 # Non-unit-clauses : 62
% 0.17/0.46 # Current number of unprocessed clauses: 234
% 0.17/0.46 # ...number of literals in the above : 1024
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 78
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 613
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 233
% 0.17/0.46 # Non-unit clause-clause subsumptions : 55
% 0.17/0.46 # Unit Clause-clause subsumption calls : 33
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 5
% 0.17/0.46 # BW rewrite match successes : 5
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 12149
% 0.17/0.46 # Search garbage collected termcells : 1272
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.018 s
% 0.17/0.46 # System time : 0.001 s
% 0.17/0.46 # Total time : 0.019 s
% 0.17/0.46 # Maximum resident set size: 1912 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.020 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.023 s
% 0.17/0.46 # Maximum resident set size: 1744 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E exiting
%------------------------------------------------------------------------------