TSTP Solution File: NUM469+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM469+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:54:47 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 12 unt; 0 def)
% Number of atoms : 95 ( 43 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 82 ( 22 ~; 23 |; 32 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 9 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
| doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox2/tmp/tmp.4OIde9U9hd/E---3.1_4703.p',m__) ).
fof(m__1298,hypothesis,
( xl != sz00
=> ( aNaturalNumber0(sdtsldt0(xm,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xn,xl))
& xn = sdtasdt0(xl,sdtsldt0(xn,xl))
& sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4OIde9U9hd/E---3.1_4703.p',m__1298) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4OIde9U9hd/E---3.1_4703.p',mSortsB) ).
fof(m__1240_04,hypothesis,
( ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xl,X1) )
& doDivides0(xl,xn) ),
file('/export/starexec/sandbox2/tmp/tmp.4OIde9U9hd/E---3.1_4703.p',m__1240_04) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4OIde9U9hd/E---3.1_4703.p',m_MulZero) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4OIde9U9hd/E---3.1_4703.p',m_AddZero) ).
fof(m__1240,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/tmp/tmp.4OIde9U9hd/E---3.1_4703.p',m__1240) ).
fof(c_0_7,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
| doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,hypothesis,
( xl != sz00
=> ( aNaturalNumber0(sdtsldt0(xm,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xn,xl))
& xn = sdtasdt0(xl,sdtsldt0(xn,xl))
& sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ) ),
inference(fof_simplification,[status(thm)],[m__1298]) ).
fof(c_0_9,negated_conjecture,
! [X6] :
( ( ~ aNaturalNumber0(X6)
| sdtpldt0(xm,xn) != sdtasdt0(xl,X6) )
& ~ doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,hypothesis,
( ( aNaturalNumber0(sdtsldt0(xm,xl))
| xl = sz00 )
& ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
| xl = sz00 )
& ( aNaturalNumber0(sdtsldt0(xn,xl))
| xl = sz00 )
& ( xn = sdtasdt0(xl,sdtsldt0(xn,xl))
| xl = sz00 )
& ( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
| xl = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(xm,xn) != sdtasdt0(xl,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
| xl = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X36,X37] :
( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X37)
| aNaturalNumber0(sdtpldt0(X36,X37)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_14,hypothesis,
( aNaturalNumber0(esk1_0)
& xm = sdtasdt0(xl,esk1_0)
& doDivides0(xl,xm)
& aNaturalNumber0(esk2_0)
& xn = sdtasdt0(xl,esk2_0)
& doDivides0(xl,xn) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1240_04])]) ).
cnf(c_0_15,negated_conjecture,
( xl = sz00
| ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
( aNaturalNumber0(sdtsldt0(xm,xl))
| xl = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
( aNaturalNumber0(sdtsldt0(xn,xl))
| xl = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_19,plain,
! [X22] :
( ( sdtasdt0(X22,sz00) = sz00
| ~ aNaturalNumber0(X22) )
& ( sz00 = sdtasdt0(sz00,X22)
| ~ aNaturalNumber0(X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])])]) ).
cnf(c_0_20,hypothesis,
xn = sdtasdt0(xl,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
xl = sz00,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( sz00 = sdtasdt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,hypothesis,
sdtasdt0(sz00,esk2_0) = xn,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
~ doDivides0(sz00,sdtpldt0(xm,xn)),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,hypothesis,
xn = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
fof(c_0_28,plain,
! [X43] :
( ( sdtpldt0(X43,sz00) = X43
| ~ aNaturalNumber0(X43) )
& ( X43 = sdtpldt0(sz00,X43)
| ~ aNaturalNumber0(X43) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
cnf(c_0_29,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
~ doDivides0(sz00,sdtpldt0(xm,sz00)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,hypothesis,
doDivides0(sz00,xm),
inference(rw,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_33,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1240]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM469+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 09:07:04 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.4OIde9U9hd/E---3.1_4703.p
% 0.22/0.53 # Version: 3.1.0
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # new_bool_3 with pid 4853 completed with status 0
% 0.22/0.53 # Result found by new_bool_3
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.22/0.53 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4861 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.22/0.53 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.53 # Preprocessing time : 0.003 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 36
% 0.22/0.53 # Removed by relevancy pruning/SinE : 6
% 0.22/0.53 # Initial clauses : 61
% 0.22/0.53 # Removed in clause preprocessing : 1
% 0.22/0.53 # Initial clauses in saturation : 60
% 0.22/0.53 # Processed clauses : 113
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 5
% 0.22/0.53 # ...remaining for further processing : 108
% 0.22/0.53 # Other redundant clauses eliminated : 10
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 18
% 0.22/0.53 # Generated clauses : 86
% 0.22/0.53 # ...of the previous two non-redundant : 75
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 8
% 0.22/0.53 # Paramodulations : 74
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 12
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 76
% 0.22/0.53 # ...of those cached : 67
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 29
% 0.22/0.53 # Positive orientable unit clauses : 7
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 2
% 0.22/0.53 # Non-unit-clauses : 20
% 0.22/0.53 # Current number of unprocessed clauses: 75
% 0.22/0.53 # ...number of literals in the above : 292
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 73
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 432
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 128
% 0.22/0.53 # Non-unit clause-clause subsumptions : 13
% 0.22/0.53 # Unit Clause-clause subsumption calls : 1
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 2
% 0.22/0.53 # BW rewrite match successes : 2
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 5957
% 0.22/0.53 # Search garbage collected termcells : 943
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.019 s
% 0.22/0.53 # System time : 0.006 s
% 0.22/0.53 # Total time : 0.024 s
% 0.22/0.53 # Maximum resident set size: 1876 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.022 s
% 0.22/0.53 # System time : 0.008 s
% 0.22/0.53 # Total time : 0.030 s
% 0.22/0.53 # Maximum resident set size: 1732 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------