TSTP Solution File: NUM500+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM500+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Sat May 4 08:55:00 EDT 2024
% Result : Theorem 0.64s 0.57s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 152 ( 73 equ)
% Maximal formula atoms : 73 ( 8 avg)
% Number of connectives : 200 ( 67 ~; 87 |; 42 &)
% ( 0 <=>; 4 =>; 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 : 19 ( 0 sgn 7 !; 8 ?)
% 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/sandbox/tmp/tmp.9LkCDe7023/E---3.1_27539.p',m__) ).
fof(mPrimDiv,axiom,
! [X1] :
( ( aNaturalNumber0(X1)
& X1 != sz00
& X1 != sz10 )
=> ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& isPrime0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.9LkCDe7023/E---3.1_27539.p',mPrimDiv) ).
fof(m__2315,hypothesis,
~ ( xk = sz00
| xk = sz10 ),
file('/export/starexec/sandbox/tmp/tmp.9LkCDe7023/E---3.1_27539.p',m__2315) ).
fof(m__2306,hypothesis,
( aNaturalNumber0(xk)
& sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
& xk = sdtsldt0(sdtasdt0(xn,xm),xp) ),
file('/export/starexec/sandbox/tmp/tmp.9LkCDe7023/E---3.1_27539.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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_5,plain,
! [X1] :
( ( aNaturalNumber0(X1)
& X1 != sz00
& X1 != sz10 )
=> ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& isPrime0(X2) ) ),
inference(fof_simplification,[status(thm)],[mPrimDiv]) ).
fof(c_0_6,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(fof_nnf,[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_7,plain,
! [X89] :
( ( aNaturalNumber0(esk13_1(X89))
| ~ aNaturalNumber0(X89)
| X89 = sz00
| X89 = sz10 )
& ( doDivides0(esk13_1(X89),X89)
| ~ aNaturalNumber0(X89)
| X89 = sz00
| X89 = sz10 )
& ( isPrime0(esk13_1(X89))
| ~ aNaturalNumber0(X89)
| X89 = sz00
| X89 = sz10 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,hypothesis,
( xk != sz00
& xk != sz10 ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2315])]) ).
cnf(c_0_9,negated_conjecture,
( ~ isPrime0(X1)
| ~ doDivides0(X1,xk)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( doDivides0(esk13_1(X1),X1)
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_12,hypothesis,
xk != sz00,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
xk != sz10,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,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_9,c_0_10]),c_0_11])]),c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
( aNaturalNumber0(esk13_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,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_14,c_0_15]),c_0_11])]),c_0_12]),c_0_13]) ).
cnf(c_0_17,plain,
( isPrime0(esk13_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,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_16,c_0_17]),c_0_11])]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM500+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:23:19 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.9LkCDe7023/E---3.1_27539.p
% 0.64/0.57 # Version: 3.1.0
% 0.64/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.64/0.57 # Starting sh5l with 300s (1) cores
% 0.64/0.57 # new_bool_3 with pid 27664 completed with status 0
% 0.64/0.57 # Result found by new_bool_3
% 0.64/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.57 # Search class: FGHSF-FSLM32-SFFFFFNN
% 0.64/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 181s (1) cores
% 0.64/0.57 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with pid 27670 completed with status 0
% 0.64/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.64/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.57 # Search class: FGHSF-FSLM32-SFFFFFNN
% 0.64/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 181s (1) cores
% 0.64/0.57 # Preprocessing time : 0.005 s
% 0.64/0.57 # Presaturation interreduction done
% 0.64/0.57
% 0.64/0.57 # Proof found!
% 0.64/0.57 # SZS status Theorem
% 0.64/0.57 # SZS output start CNFRefutation
% See solution above
% 0.64/0.57 # Parsed axioms : 48
% 0.64/0.57 # Removed by relevancy pruning/SinE : 1
% 0.64/0.57 # Initial clauses : 237
% 0.64/0.57 # Removed in clause preprocessing : 3
% 0.64/0.57 # Initial clauses in saturation : 234
% 0.64/0.57 # Processed clauses : 333
% 0.64/0.57 # ...of these trivial : 1
% 0.64/0.57 # ...subsumed : 18
% 0.64/0.57 # ...remaining for further processing : 314
% 0.64/0.57 # Other redundant clauses eliminated : 14
% 0.64/0.57 # Clauses deleted for lack of memory : 0
% 0.64/0.57 # Backward-subsumed : 2
% 0.64/0.57 # Backward-rewritten : 0
% 0.64/0.57 # Generated clauses : 92
% 0.64/0.57 # ...of the previous two non-redundant : 67
% 0.64/0.57 # ...aggressively subsumed : 0
% 0.64/0.57 # Contextual simplify-reflections : 4
% 0.64/0.57 # Paramodulations : 74
% 0.64/0.57 # Factorizations : 2
% 0.64/0.57 # NegExts : 0
% 0.64/0.57 # Equation resolutions : 16
% 0.64/0.57 # Disequality decompositions : 0
% 0.64/0.57 # Total rewrite steps : 109
% 0.64/0.57 # ...of those cached : 97
% 0.64/0.57 # Propositional unsat checks : 0
% 0.64/0.57 # Propositional check models : 0
% 0.64/0.57 # Propositional check unsatisfiable : 0
% 0.64/0.57 # Propositional clauses : 0
% 0.64/0.57 # Propositional clauses after purity: 0
% 0.64/0.57 # Propositional unsat core size : 0
% 0.64/0.57 # Propositional preprocessing time : 0.000
% 0.64/0.57 # Propositional encoding time : 0.000
% 0.64/0.57 # Propositional solver time : 0.000
% 0.64/0.57 # Success case prop preproc time : 0.000
% 0.64/0.57 # Success case prop encoding time : 0.000
% 0.64/0.57 # Success case prop solver time : 0.000
% 0.64/0.57 # Current number of processed clauses : 77
% 0.64/0.57 # Positive orientable unit clauses : 24
% 0.64/0.57 # Positive unorientable unit clauses: 0
% 0.64/0.57 # Negative unit clauses : 14
% 0.64/0.57 # Non-unit-clauses : 39
% 0.64/0.57 # Current number of unprocessed clauses: 195
% 0.64/0.57 # ...number of literals in the above : 1589
% 0.64/0.57 # Current number of archived formulas : 0
% 0.64/0.57 # Current number of archived clauses : 229
% 0.64/0.57 # Clause-clause subsumption calls (NU) : 22842
% 0.64/0.57 # Rec. Clause-clause subsumption calls : 139
% 0.64/0.57 # Non-unit clause-clause subsumptions : 9
% 0.64/0.57 # Unit Clause-clause subsumption calls : 111
% 0.64/0.57 # Rewrite failures with RHS unbound : 0
% 0.64/0.57 # BW rewrite match attempts : 0
% 0.64/0.57 # BW rewrite match successes : 0
% 0.64/0.57 # Condensation attempts : 0
% 0.64/0.57 # Condensation successes : 0
% 0.64/0.57 # Termbank termtop insertions : 22878
% 0.64/0.57 # Search garbage collected termcells : 2410
% 0.64/0.57
% 0.64/0.57 # -------------------------------------------------
% 0.64/0.57 # User time : 0.053 s
% 0.64/0.57 # System time : 0.006 s
% 0.64/0.57 # Total time : 0.059 s
% 0.64/0.57 # Maximum resident set size: 2328 pages
% 0.64/0.57
% 0.64/0.57 # -------------------------------------------------
% 0.64/0.57 # User time : 0.055 s
% 0.64/0.57 # System time : 0.008 s
% 0.64/0.57 # Total time : 0.064 s
% 0.64/0.57 # Maximum resident set size: 1756 pages
% 0.64/0.57 % E---3.1 exiting
% 0.64/0.57 % E exiting
%------------------------------------------------------------------------------