TSTP Solution File: NUM430+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM430+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Tue May 21 01:13:54 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 124 ( 25 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 142 ( 55 ~; 44 |; 33 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mEquMod,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& X3 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEquMod) ).
fof(m__818,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& xq != sz00
& aInteger0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__818) ).
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivisor) ).
fof(m__853,hypothesis,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
& sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__853) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
fof(m__,conjecture,
? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xb,smndt0(xc)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).
fof(c_0_7,plain,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& X3 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
inference(fof_simplification,[status(thm)],[mEquMod]) ).
fof(c_0_8,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& xq != sz00
& aInteger0(xc) ),
inference(fof_simplification,[status(thm)],[m__818]) ).
fof(c_0_9,plain,
! [X35,X36,X37] :
( ( ~ sdteqdtlpzmzozddtrp0(X35,X36,X37)
| aDivisorOf0(X37,sdtpldt0(X35,smndt0(X36)))
| ~ aInteger0(X35)
| ~ aInteger0(X36)
| ~ aInteger0(X37)
| X37 = sz00 )
& ( ~ aDivisorOf0(X37,sdtpldt0(X35,smndt0(X36)))
| sdteqdtlpzmzozddtrp0(X35,X36,X37)
| ~ aInteger0(X35)
| ~ aInteger0(X36)
| ~ aInteger0(X37)
| X37 = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& xq != sz00
& aInteger0(xc) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mDivisor]) ).
cnf(c_0_12,plain,
( aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2)))
| X3 = sz00
| ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
inference(split_conjunct,[status(thm)],[m__853]) ).
cnf(c_0_14,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X30,X31,X33,X34] :
( ( aInteger0(X31)
| ~ aDivisorOf0(X31,X30)
| ~ aInteger0(X30) )
& ( X31 != sz00
| ~ aDivisorOf0(X31,X30)
| ~ aInteger0(X30) )
& ( aInteger0(esk1_2(X30,X31))
| ~ aDivisorOf0(X31,X30)
| ~ aInteger0(X30) )
& ( sdtasdt0(X31,esk1_2(X30,X31)) = X30
| ~ aDivisorOf0(X31,X30)
| ~ aInteger0(X30) )
& ( ~ aInteger0(X33)
| X33 = sz00
| ~ aInteger0(X34)
| sdtasdt0(X33,X34) != X30
| aDivisorOf0(X33,X30)
| ~ aInteger0(X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])]) ).
cnf(c_0_17,hypothesis,
( aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
| ~ aInteger0(xq)
| ~ aInteger0(xc) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_18,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,hypothesis,
aInteger0(xc),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( sdtasdt0(X1,esk1_2(X2,X1)) = X2
| ~ aDivisorOf0(X1,X2)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,hypothesis,
aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),c_0_19])]) ).
fof(c_0_22,plain,
! [X6,X7] :
( ~ aInteger0(X6)
| ~ aInteger0(X7)
| aInteger0(sdtpldt0(X6,X7)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])])]) ).
fof(c_0_23,negated_conjecture,
~ ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xb,smndt0(xc)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_24,hypothesis,
( sdtasdt0(xq,esk1_2(sdtpldt0(xb,smndt0(xc)),xq)) = sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(sdtpldt0(xb,smndt0(xc))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X5] :
( ~ aInteger0(X5)
| aInteger0(smndt0(X5)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])])]) ).
fof(c_0_27,negated_conjecture,
! [X43] :
( ~ aInteger0(X43)
| sdtasdt0(xq,X43) != sdtpldt0(xb,smndt0(xc)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_28,hypothesis,
( sdtasdt0(xq,esk1_2(sdtpldt0(xb,smndt0(xc)),xq)) = sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(smndt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14])]) ).
cnf(c_0_29,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,hypothesis,
sdtasdt0(xq,esk1_2(sdtpldt0(xb,smndt0(xc)),xq)) = sdtpldt0(xb,smndt0(xc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_19])]) ).
cnf(c_0_32,plain,
( aInteger0(esk1_2(X1,X2))
| ~ aDivisorOf0(X2,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,negated_conjecture,
~ aInteger0(esk1_2(sdtpldt0(xb,smndt0(xc)),xq)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,hypothesis,
~ aInteger0(sdtpldt0(xb,smndt0(xc))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_33]) ).
cnf(c_0_35,hypothesis,
~ aInteger0(smndt0(xc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_25]),c_0_14])]) ).
cnf(c_0_36,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM430+1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 07:03:53 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 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/benchmark/theBenchmark.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9787 completed with status 0
% 0.21/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.21/0.54 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.21/0.54 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.21/0.54 # G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with pid 9798 completed with status 0
% 0.21/0.54 # Result found by G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.21/0.54 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.21/0.54 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 25
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 42
% 0.21/0.54 # Removed in clause preprocessing : 1
% 0.21/0.54 # Initial clauses in saturation : 41
% 0.21/0.54 # Processed clauses : 87
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 0
% 0.21/0.54 # ...remaining for further processing : 87
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 5
% 0.21/0.54 # Generated clauses : 34
% 0.21/0.54 # ...of the previous two non-redundant : 26
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 33
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 1
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 40
% 0.21/0.54 # ...of those cached : 30
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 41
% 0.21/0.54 # Positive orientable unit clauses : 15
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 4
% 0.21/0.54 # Non-unit-clauses : 22
% 0.21/0.54 # Current number of unprocessed clauses: 21
% 0.21/0.54 # ...number of literals in the above : 82
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 46
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 235
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 103
% 0.21/0.54 # Non-unit clause-clause subsumptions : 0
% 0.21/0.54 # Unit Clause-clause subsumption calls : 54
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 3
% 0.21/0.54 # BW rewrite match successes : 3
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 3453
% 0.21/0.54 # Search garbage collected termcells : 479
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.007 s
% 0.21/0.54 # System time : 0.004 s
% 0.21/0.54 # Total time : 0.012 s
% 0.21/0.54 # Maximum resident set size: 1792 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.034 s
% 0.21/0.54 # System time : 0.012 s
% 0.21/0.54 # Total time : 0.046 s
% 0.21/0.54 # Maximum resident set size: 1712 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------