TSTP Solution File: NUM496+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM496+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 09:06:21 EDT 2024
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 14 unt; 0 def)
% Number of atoms : 140 ( 26 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 167 ( 71 ~; 67 |; 20 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 23 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( doDivides0(xp,xn)
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',m__) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',mDefDiff) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',mSortsB_02) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',mSortsC_01) ).
fof(mDivSum,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X1,X3) )
=> doDivides0(X1,sdtpldt0(X2,X3)) ) ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',mDivSum) ).
fof(m__2027,hypothesis,
( doDivides0(xp,xr)
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',m__2027) ).
fof(m__1870,hypothesis,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',m__1870) ).
fof(m__1883,hypothesis,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',m__1883) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',m__1837) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p',m_MulUnit) ).
fof(c_0_11,negated_conjecture,
~ ( doDivides0(xp,xn)
| doDivides0(xp,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,plain,
! [X81,X82,X83] :
( ( aNaturalNumber0(X83)
| X83 != sdtmndt0(X82,X81)
| ~ sdtlseqdt0(X81,X82)
| ~ aNaturalNumber0(X81)
| ~ aNaturalNumber0(X82) )
& ( sdtpldt0(X81,X83) = X82
| X83 != sdtmndt0(X82,X81)
| ~ sdtlseqdt0(X81,X82)
| ~ aNaturalNumber0(X81)
| ~ aNaturalNumber0(X82) )
& ( ~ aNaturalNumber0(X83)
| sdtpldt0(X81,X83) != X82
| X83 = sdtmndt0(X82,X81)
| ~ sdtlseqdt0(X81,X82)
| ~ aNaturalNumber0(X81)
| ~ aNaturalNumber0(X82) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])]) ).
fof(c_0_13,negated_conjecture,
( ~ doDivides0(xp,xn)
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
cnf(c_0_14,plain,
( aNaturalNumber0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ sdtlseqdt0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X8,X9,X11] :
( ( aNaturalNumber0(esk1_2(X8,X9))
| ~ doDivides0(X8,X9)
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9) )
& ( X9 = sdtasdt0(X8,esk1_2(X8,X9))
| ~ doDivides0(X8,X9)
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9) )
& ( ~ aNaturalNumber0(X11)
| X9 != sdtasdt0(X8,X11)
| doDivides0(X8,X9)
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9) ) ),
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_16,plain,
! [X50,X51] :
( ~ aNaturalNumber0(X50)
| ~ aNaturalNumber0(X51)
| aNaturalNumber0(sdtasdt0(X50,X51)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_17,plain,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
inference(fof_simplification,[status(thm)],[mSortsC_01]) ).
fof(c_0_18,plain,
! [X15,X16,X17] :
( ~ aNaturalNumber0(X15)
| ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X17)
| ~ doDivides0(X15,X16)
| ~ doDivides0(X15,X17)
| doDivides0(X15,sdtpldt0(X16,X17)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivSum])])]) ).
cnf(c_0_19,hypothesis,
( doDivides0(xp,xr)
| doDivides0(xp,xm) ),
inference(split_conjunct,[status(thm)],[m__2027]) ).
cnf(c_0_20,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( aNaturalNumber0(sdtmndt0(X1,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[m__1870]) ).
cnf(c_0_23,hypothesis,
xr = sdtmndt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_26,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_28,plain,
! [X84] :
( ( sdtasdt0(X84,sz10) = X84
| ~ aNaturalNumber0(X84) )
& ( X84 = sdtasdt0(sz10,X84)
| ~ aNaturalNumber0(X84) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])])]) ).
fof(c_0_29,plain,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
( doDivides0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,hypothesis,
doDivides0(xp,xr),
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_32,hypothesis,
aNaturalNumber0(xr),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_33,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_27]) ).
cnf(c_0_34,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( sdtpldt0(X1,X2) = X3
| X2 != sdtmndt0(X3,X1)
| ~ sdtlseqdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,hypothesis,
( doDivides0(xp,sdtpldt0(X1,xr))
| ~ doDivides0(xp,X1)
| ~ aNaturalNumber0(X1) ),
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_24])]) ).
cnf(c_0_38,plain,
( doDivides0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_39,plain,
( sdtpldt0(X1,sdtmndt0(X2,X1)) = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,hypothesis,
doDivides0(xp,sdtpldt0(xp,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24])]) ).
cnf(c_0_41,hypothesis,
sdtpldt0(xp,xr) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_22]),c_0_23]),c_0_25]),c_0_24])]) ).
cnf(c_0_42,negated_conjecture,
~ doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM496+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n008.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri May 3 09:36:12 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.jleLA4S9CI/E---3.1_17847.p
% 0.17/0.47 # Version: 3.1.0
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_1 with pid 17926 completed with status 0
% 0.17/0.47 # Result found by new_bool_1
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 17928 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.47 # Preprocessing time : 0.002 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 47
% 0.17/0.47 # Removed by relevancy pruning/SinE : 2
% 0.17/0.47 # Initial clauses : 80
% 0.17/0.47 # Removed in clause preprocessing : 3
% 0.17/0.47 # Initial clauses in saturation : 77
% 0.17/0.47 # Processed clauses : 293
% 0.17/0.47 # ...of these trivial : 3
% 0.17/0.47 # ...subsumed : 48
% 0.17/0.47 # ...remaining for further processing : 242
% 0.17/0.47 # Other redundant clauses eliminated : 16
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 4
% 0.17/0.48 # Backward-rewritten : 5
% 0.17/0.48 # Generated clauses : 555
% 0.17/0.48 # ...of the previous two non-redundant : 462
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 6
% 0.17/0.48 # Paramodulations : 533
% 0.17/0.48 # Factorizations : 2
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 20
% 0.17/0.48 # Disequality decompositions : 0
% 0.17/0.48 # Total rewrite steps : 612
% 0.17/0.48 # ...of those cached : 586
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 153
% 0.17/0.48 # Positive orientable unit clauses : 39
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 7
% 0.17/0.48 # Non-unit-clauses : 107
% 0.17/0.48 # Current number of unprocessed clauses: 317
% 0.17/0.48 # ...number of literals in the above : 1185
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 81
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 1336
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 603
% 0.17/0.48 # Non-unit clause-clause subsumptions : 55
% 0.17/0.48 # Unit Clause-clause subsumption calls : 116
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 4
% 0.17/0.48 # BW rewrite match successes : 4
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 15021
% 0.17/0.48 # Search garbage collected termcells : 1265
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.018 s
% 0.17/0.48 # System time : 0.003 s
% 0.17/0.48 # Total time : 0.022 s
% 0.17/0.48 # Maximum resident set size: 2040 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.019 s
% 0.17/0.48 # System time : 0.006 s
% 0.17/0.48 # Total time : 0.025 s
% 0.17/0.48 # Maximum resident set size: 1744 pages
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------