TSTP Solution File: NUM488+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM488+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 19:07:21 EDT 2023
% Result : Theorem 33.76s 4.69s
% Output : CNFRefutation 33.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 142 ( 23 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 182 ( 78 ~; 76 |; 19 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn; 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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.oUg86Yr9OY/E---3.1_27679.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.oUg86Yr9OY/E---3.1_27679.p',mSortsB_02) ).
fof(mDivMin,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X1,sdtpldt0(X2,X3)) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.oUg86Yr9OY/E---3.1_27679.p',mDivMin) ).
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.oUg86Yr9OY/E---3.1_27679.p',mDefDiff) ).
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.oUg86Yr9OY/E---3.1_27679.p',mAMDistr) ).
fof(m__1870,hypothesis,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/tmp/tmp.oUg86Yr9OY/E---3.1_27679.p',m__1870) ).
fof(m__1883,hypothesis,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/tmp/tmp.oUg86Yr9OY/E---3.1_27679.p',m__1883) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmp.oUg86Yr9OY/E---3.1_27679.p',m__1837) ).
fof(m__,conjecture,
doDivides0(xp,sdtasdt0(xr,xm)),
file('/export/starexec/sandbox/tmp/tmp.oUg86Yr9OY/E---3.1_27679.p',m__) ).
fof(m__1860,hypothesis,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/tmp/tmp.oUg86Yr9OY/E---3.1_27679.p',m__1860) ).
fof(c_0_10,plain,
! [X60,X61,X63] :
( ( aNaturalNumber0(esk2_2(X60,X61))
| ~ doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( X61 = sdtasdt0(X60,esk2_2(X60,X61))
| ~ doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( ~ aNaturalNumber0(X63)
| X61 != sdtasdt0(X60,X63)
| doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) ) ),
inference(distribute,[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_11,plain,
! [X6,X7] :
( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7)
| aNaturalNumber0(sdtasdt0(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_12,plain,
! [X73,X74,X75] :
( ~ aNaturalNumber0(X73)
| ~ aNaturalNumber0(X74)
| ~ aNaturalNumber0(X75)
| ~ doDivides0(X73,X74)
| ~ doDivides0(X73,sdtpldt0(X74,X75))
| doDivides0(X73,X75) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivMin])]) ).
cnf(c_0_13,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X38,X39,X40] :
( ( aNaturalNumber0(X40)
| X40 != sdtmndt0(X39,X38)
| ~ sdtlseqdt0(X38,X39)
| ~ aNaturalNumber0(X38)
| ~ aNaturalNumber0(X39) )
& ( sdtpldt0(X38,X40) = X39
| X40 != sdtmndt0(X39,X38)
| ~ sdtlseqdt0(X38,X39)
| ~ aNaturalNumber0(X38)
| ~ aNaturalNumber0(X39) )
& ( ~ aNaturalNumber0(X40)
| sdtpldt0(X38,X40) != X39
| X40 = sdtmndt0(X39,X38)
| ~ sdtlseqdt0(X38,X39)
| ~ aNaturalNumber0(X38)
| ~ aNaturalNumber0(X39) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])]) ).
cnf(c_0_16,plain,
( doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_13]),c_0_14]) ).
fof(c_0_18,plain,
! [X21,X22,X23] :
( ( sdtasdt0(X21,sdtpldt0(X22,X23)) = sdtpldt0(sdtasdt0(X21,X22),sdtasdt0(X21,X23))
| ~ aNaturalNumber0(X21)
| ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23) )
& ( sdtasdt0(sdtpldt0(X22,X23),X21) = sdtpldt0(sdtasdt0(X22,X21),sdtasdt0(X23,X21))
| ~ aNaturalNumber0(X21)
| ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])]) ).
cnf(c_0_19,plain,
( sdtpldt0(X1,X2) = X3
| X2 != sdtmndt0(X3,X1)
| ~ sdtlseqdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( aNaturalNumber0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ sdtlseqdt0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( doDivides0(X1,X2)
| ~ doDivides0(X1,sdtpldt0(sdtasdt0(X1,X3),X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]) ).
cnf(c_0_22,plain,
( sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( sdtpldt0(X1,sdtmndt0(X2,X1)) = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_24,hypothesis,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[m__1870]) ).
cnf(c_0_25,hypothesis,
xr = sdtmndt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_26,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_27,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_28,plain,
( aNaturalNumber0(sdtmndt0(X1,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( doDivides0(X1,sdtasdt0(X2,X3))
| ~ doDivides0(X1,sdtasdt0(sdtpldt0(X1,X2),X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14]) ).
cnf(c_0_30,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_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_31,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_28,c_0_24]),c_0_25]),c_0_27]),c_0_26])]) ).
fof(c_0_32,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xr,xm)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_33,hypothesis,
( doDivides0(xp,sdtasdt0(xr,X1))
| ~ doDivides0(xp,sdtasdt0(xn,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xr,xm)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_36,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_37,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_33,c_0_34,c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM488+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 14:38:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.oUg86Yr9OY/E---3.1_27679.p
% 33.76/4.69 # Version: 3.1pre001
% 33.76/4.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 33.76/4.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.76/4.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 33.76/4.69 # Starting new_bool_3 with 300s (1) cores
% 33.76/4.69 # Starting new_bool_1 with 300s (1) cores
% 33.76/4.69 # Starting sh5l with 300s (1) cores
% 33.76/4.69 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 27756 completed with status 0
% 33.76/4.69 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 33.76/4.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 33.76/4.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.76/4.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 33.76/4.69 # No SInE strategy applied
% 33.76/4.69 # Search class: FGHSF-FFMM21-SFFFFFNN
% 33.76/4.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 33.76/4.69 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 33.76/4.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 33.76/4.69 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 33.76/4.69 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 33.76/4.69 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 33.76/4.69 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 27762 completed with status 0
% 33.76/4.69 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 33.76/4.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 33.76/4.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.76/4.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 33.76/4.69 # No SInE strategy applied
% 33.76/4.69 # Search class: FGHSF-FFMM21-SFFFFFNN
% 33.76/4.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 33.76/4.69 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 33.76/4.69 # Preprocessing time : 0.002 s
% 33.76/4.69 # Presaturation interreduction done
% 33.76/4.69 # SatCheck found unsatisfiable ground set
% 33.76/4.69
% 33.76/4.69 # Proof found!
% 33.76/4.69 # SZS status Theorem
% 33.76/4.69 # SZS output start CNFRefutation
% See solution above
% 33.76/4.69 # Parsed axioms : 45
% 33.76/4.69 # Removed by relevancy pruning/SinE : 0
% 33.76/4.69 # Initial clauses : 81
% 33.76/4.69 # Removed in clause preprocessing : 3
% 33.76/4.69 # Initial clauses in saturation : 78
% 33.76/4.69 # Processed clauses : 16629
% 33.76/4.69 # ...of these trivial : 1465
% 33.76/4.69 # ...subsumed : 10164
% 33.76/4.69 # ...remaining for further processing : 5000
% 33.76/4.69 # Other redundant clauses eliminated : 290
% 33.76/4.69 # Clauses deleted for lack of memory : 0
% 33.76/4.69 # Backward-subsumed : 135
% 33.76/4.69 # Backward-rewritten : 899
% 33.76/4.69 # Generated clauses : 189798
% 33.76/4.69 # ...of the previous two non-redundant : 160536
% 33.76/4.69 # ...aggressively subsumed : 0
% 33.76/4.69 # Contextual simplify-reflections : 490
% 33.76/4.69 # Paramodulations : 189480
% 33.76/4.69 # Factorizations : 15
% 33.76/4.69 # NegExts : 0
% 33.76/4.69 # Equation resolutions : 303
% 33.76/4.69 # Total rewrite steps : 265328
% 33.76/4.69 # Propositional unsat checks : 1
% 33.76/4.69 # Propositional check models : 0
% 33.76/4.69 # Propositional check unsatisfiable : 1
% 33.76/4.69 # Propositional clauses : 145760
% 33.76/4.69 # Propositional clauses after purity: 13568
% 33.76/4.69 # Propositional unsat core size : 4
% 33.76/4.69 # Propositional preprocessing time : 0.000
% 33.76/4.69 # Propositional encoding time : 0.311
% 33.76/4.69 # Propositional solver time : 0.041
% 33.76/4.69 # Success case prop preproc time : 0.000
% 33.76/4.69 # Success case prop encoding time : 0.311
% 33.76/4.69 # Success case prop solver time : 0.041
% 33.76/4.69 # Current number of processed clauses : 3882
% 33.76/4.69 # Positive orientable unit clauses : 1607
% 33.76/4.69 # Positive unorientable unit clauses: 0
% 33.76/4.69 # Negative unit clauses : 123
% 33.76/4.69 # Non-unit-clauses : 2152
% 33.76/4.69 # Current number of unprocessed clauses: 141878
% 33.76/4.69 # ...number of literals in the above : 584527
% 33.76/4.69 # Current number of archived formulas : 0
% 33.76/4.69 # Current number of archived clauses : 1107
% 33.76/4.69 # Clause-clause subsumption calls (NU) : 564541
% 33.76/4.69 # Rec. Clause-clause subsumption calls : 330930
% 33.76/4.69 # Non-unit clause-clause subsumptions : 7967
% 33.76/4.69 # Unit Clause-clause subsumption calls : 52491
% 33.76/4.69 # Rewrite failures with RHS unbound : 0
% 33.76/4.69 # BW rewrite match attempts : 13584
% 33.76/4.69 # BW rewrite match successes : 656
% 33.76/4.69 # Condensation attempts : 0
% 33.76/4.69 # Condensation successes : 0
% 33.76/4.69 # Termbank termtop insertions : 5539413
% 33.76/4.69
% 33.76/4.69 # -------------------------------------------------
% 33.76/4.69 # User time : 3.999 s
% 33.76/4.69 # System time : 0.156 s
% 33.76/4.69 # Total time : 4.155 s
% 33.76/4.69 # Maximum resident set size: 1952 pages
% 33.76/4.69
% 33.76/4.69 # -------------------------------------------------
% 33.76/4.69 # User time : 20.097 s
% 33.76/4.69 # System time : 0.678 s
% 33.76/4.69 # Total time : 20.775 s
% 33.76/4.69 # Maximum resident set size: 1724 pages
% 33.76/4.69 % E---3.1 exiting
%------------------------------------------------------------------------------