TSTP Solution File: NUM500+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM500+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:03 EDT 2023
% Result : Theorem 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 146 ( 71 equ)
% Maximal formula atoms : 73 ( 8 avg)
% Number of connectives : 193 ( 65 ~; 87 |; 38 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn; 6 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xk = sdtasdt0(X1,X2) )
| doDivides0(X1,xk) )
& ( ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& ? [X3] :
( aNaturalNumber0(X3)
& X1 = sdtasdt0(X2,X3) )
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) )
| isPrime0(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TTPKcKku5y/E---3.1_30535.p',m__) ).
fof(mPrimDiv,axiom,
! [X1] :
( ( aNaturalNumber0(X1)
& X1 != sz00
& X1 != sz10 )
=> ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& isPrime0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TTPKcKku5y/E---3.1_30535.p',mPrimDiv) ).
fof(m__2315,hypothesis,
~ ( xk = sz00
| xk = sz10 ),
file('/export/starexec/sandbox2/tmp/tmp.TTPKcKku5y/E---3.1_30535.p',m__2315) ).
fof(m__2306,hypothesis,
( aNaturalNumber0(xk)
& sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
& xk = sdtsldt0(sdtasdt0(xn,xm),xp) ),
file('/export/starexec/sandbox2/tmp/tmp.TTPKcKku5y/E---3.1_30535.p',m__2306) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xk = sdtasdt0(X1,X2) )
| doDivides0(X1,xk) )
& ( ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& ? [X3] :
( aNaturalNumber0(X3)
& X1 = sdtasdt0(X2,X3) )
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) )
| isPrime0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X21,X22] :
( ( aNaturalNumber0(esk8_1(X21))
| X21 = sz00
| X21 = sz10
| ~ aNaturalNumber0(X22)
| xk != sdtasdt0(X21,X22)
| ~ aNaturalNumber0(X21) )
& ( aNaturalNumber0(esk9_1(X21))
| X21 = sz00
| X21 = sz10
| ~ aNaturalNumber0(X22)
| xk != sdtasdt0(X21,X22)
| ~ aNaturalNumber0(X21) )
& ( X21 = sdtasdt0(esk8_1(X21),esk9_1(X21))
| X21 = sz00
| X21 = sz10
| ~ aNaturalNumber0(X22)
| xk != sdtasdt0(X21,X22)
| ~ aNaturalNumber0(X21) )
& ( doDivides0(esk8_1(X21),X21)
| X21 = sz00
| X21 = sz10
| ~ aNaturalNumber0(X22)
| xk != sdtasdt0(X21,X22)
| ~ aNaturalNumber0(X21) )
& ( esk8_1(X21) != sz10
| X21 = sz00
| X21 = sz10
| ~ aNaturalNumber0(X22)
| xk != sdtasdt0(X21,X22)
| ~ aNaturalNumber0(X21) )
& ( esk8_1(X21) != X21
| X21 = sz00
| X21 = sz10
| ~ aNaturalNumber0(X22)
| xk != sdtasdt0(X21,X22)
| ~ aNaturalNumber0(X21) )
& ( ~ isPrime0(X21)
| ~ aNaturalNumber0(X22)
| xk != sdtasdt0(X21,X22)
| ~ aNaturalNumber0(X21) )
& ( aNaturalNumber0(esk8_1(X21))
| X21 = sz00
| X21 = sz10
| ~ doDivides0(X21,xk)
| ~ aNaturalNumber0(X21) )
& ( aNaturalNumber0(esk9_1(X21))
| X21 = sz00
| X21 = sz10
| ~ doDivides0(X21,xk)
| ~ aNaturalNumber0(X21) )
& ( X21 = sdtasdt0(esk8_1(X21),esk9_1(X21))
| X21 = sz00
| X21 = sz10
| ~ doDivides0(X21,xk)
| ~ aNaturalNumber0(X21) )
& ( doDivides0(esk8_1(X21),X21)
| X21 = sz00
| X21 = sz10
| ~ doDivides0(X21,xk)
| ~ aNaturalNumber0(X21) )
& ( esk8_1(X21) != sz10
| X21 = sz00
| X21 = sz10
| ~ doDivides0(X21,xk)
| ~ aNaturalNumber0(X21) )
& ( esk8_1(X21) != X21
| X21 = sz00
| X21 = sz10
| ~ doDivides0(X21,xk)
| ~ aNaturalNumber0(X21) )
& ( ~ isPrime0(X21)
| ~ doDivides0(X21,xk)
| ~ aNaturalNumber0(X21) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_6,plain,
! [X86] :
( ( aNaturalNumber0(esk13_1(X86))
| ~ aNaturalNumber0(X86)
| X86 = sz00
| X86 = sz10 )
& ( doDivides0(esk13_1(X86),X86)
| ~ aNaturalNumber0(X86)
| X86 = sz00
| X86 = sz10 )
& ( isPrime0(esk13_1(X86))
| ~ aNaturalNumber0(X86)
| X86 = sz00
| X86 = sz10 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mPrimDiv])])])]) ).
fof(c_0_7,hypothesis,
( xk != sz00
& xk != sz10 ),
inference(fof_nnf,[status(thm)],[m__2315]) ).
cnf(c_0_8,negated_conjecture,
( ~ isPrime0(X1)
| ~ doDivides0(X1,xk)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( doDivides0(esk13_1(X1),X1)
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_11,hypothesis,
xk != sz00,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
xk != sz10,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( ~ isPrime0(esk13_1(xk))
| ~ aNaturalNumber0(esk13_1(xk)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]),c_0_12]) ).
cnf(c_0_14,plain,
( aNaturalNumber0(esk13_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
~ isPrime0(esk13_1(xk)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10])]),c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
( isPrime0(esk13_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10])]),c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : NUM500+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 14:49:45 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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/tmp/tmp.TTPKcKku5y/E---3.1_30535.p
% 0.18/0.52 # Version: 3.1pre001
% 0.18/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 # Starting sh5l with 300s (1) cores
% 0.18/0.52 # new_bool_1 with pid 30615 completed with status 0
% 0.18/0.52 # Result found by new_bool_1
% 0.18/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 # Search class: FGHSF-FSLM32-SFFFFFNN
% 0.18/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 163s (1) cores
% 0.18/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with pid 30623 completed with status 0
% 0.18/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.18/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 # Search class: FGHSF-FSLM32-SFFFFFNN
% 0.18/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 163s (1) cores
% 0.18/0.52 # Preprocessing time : 0.005 s
% 0.18/0.52 # Presaturation interreduction done
% 0.18/0.52
% 0.18/0.52 # Proof found!
% 0.18/0.52 # SZS status Theorem
% 0.18/0.52 # SZS output start CNFRefutation
% See solution above
% 0.18/0.52 # Parsed axioms : 48
% 0.18/0.52 # Removed by relevancy pruning/SinE : 1
% 0.18/0.52 # Initial clauses : 237
% 0.18/0.52 # Removed in clause preprocessing : 3
% 0.18/0.52 # Initial clauses in saturation : 234
% 0.18/0.52 # Processed clauses : 333
% 0.18/0.52 # ...of these trivial : 1
% 0.18/0.52 # ...subsumed : 18
% 0.18/0.52 # ...remaining for further processing : 314
% 0.18/0.52 # Other redundant clauses eliminated : 14
% 0.18/0.52 # Clauses deleted for lack of memory : 0
% 0.18/0.52 # Backward-subsumed : 2
% 0.18/0.52 # Backward-rewritten : 0
% 0.18/0.52 # Generated clauses : 92
% 0.18/0.52 # ...of the previous two non-redundant : 67
% 0.18/0.52 # ...aggressively subsumed : 0
% 0.18/0.52 # Contextual simplify-reflections : 4
% 0.18/0.52 # Paramodulations : 74
% 0.18/0.52 # Factorizations : 2
% 0.18/0.52 # NegExts : 0
% 0.18/0.52 # Equation resolutions : 16
% 0.18/0.52 # Total rewrite steps : 109
% 0.18/0.52 # Propositional unsat checks : 0
% 0.18/0.52 # Propositional check models : 0
% 0.18/0.52 # Propositional check unsatisfiable : 0
% 0.18/0.52 # Propositional clauses : 0
% 0.18/0.52 # Propositional clauses after purity: 0
% 0.18/0.52 # Propositional unsat core size : 0
% 0.18/0.52 # Propositional preprocessing time : 0.000
% 0.18/0.52 # Propositional encoding time : 0.000
% 0.18/0.52 # Propositional solver time : 0.000
% 0.18/0.52 # Success case prop preproc time : 0.000
% 0.18/0.52 # Success case prop encoding time : 0.000
% 0.18/0.52 # Success case prop solver time : 0.000
% 0.18/0.52 # Current number of processed clauses : 77
% 0.18/0.52 # Positive orientable unit clauses : 24
% 0.18/0.52 # Positive unorientable unit clauses: 0
% 0.18/0.52 # Negative unit clauses : 14
% 0.18/0.52 # Non-unit-clauses : 39
% 0.18/0.52 # Current number of unprocessed clauses: 195
% 0.18/0.52 # ...number of literals in the above : 1589
% 0.18/0.52 # Current number of archived formulas : 0
% 0.18/0.52 # Current number of archived clauses : 229
% 0.18/0.52 # Clause-clause subsumption calls (NU) : 22842
% 0.18/0.52 # Rec. Clause-clause subsumption calls : 139
% 0.18/0.52 # Non-unit clause-clause subsumptions : 9
% 0.18/0.52 # Unit Clause-clause subsumption calls : 111
% 0.18/0.52 # Rewrite failures with RHS unbound : 0
% 0.18/0.52 # BW rewrite match attempts : 0
% 0.18/0.52 # BW rewrite match successes : 0
% 0.18/0.52 # Condensation attempts : 0
% 0.18/0.52 # Condensation successes : 0
% 0.18/0.52 # Termbank termtop insertions : 21534
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.046 s
% 0.18/0.52 # System time : 0.006 s
% 0.18/0.52 # Total time : 0.052 s
% 0.18/0.52 # Maximum resident set size: 2324 pages
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.048 s
% 0.18/0.52 # System time : 0.007 s
% 0.18/0.52 # Total time : 0.055 s
% 0.18/0.52 # Maximum resident set size: 1736 pages
% 0.18/0.52 % E---3.1 exiting
% 0.64/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------