TSTP Solution File: NUM432+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM432+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 18:55:44 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 102 ( 20 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 118 ( 48 ~; 46 |; 18 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 18 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',mDivisor) ).
fof(m__924,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',m__924) ).
fof(m__818,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& xq != sz00
& aInteger0(xc) ),
file('/export/starexec/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',m__818) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',mIntPlus) ).
fof(m__899,hypothesis,
( aInteger0(xm)
& sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc)) ),
file('/export/starexec/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',m__899) ).
fof(m__876,hypothesis,
( aInteger0(xn)
& sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',m__876) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',mIntNeg) ).
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/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',mEquMod) ).
fof(m__,conjecture,
sdteqdtlpzmzozddtrp0(xa,xc,xq),
file('/export/starexec/sandbox2/tmp/tmp.acbgmjV3E8/E---3.1_9018.p',m__) ).
fof(c_0_9,plain,
! [X29,X30,X32,X33] :
( ( aInteger0(X30)
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( X30 != sz00
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( aInteger0(esk1_2(X29,X30))
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( sdtasdt0(X30,esk1_2(X29,X30)) = X29
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( ~ aInteger0(X32)
| X32 = sz00
| ~ aInteger0(X33)
| sdtasdt0(X32,X33) != X29
| aDivisorOf0(X32,X29)
| ~ aInteger0(X29) ) ),
inference(distribute,[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)],[mDivisor])])])])])]) ).
cnf(c_0_10,plain,
( X1 = sz00
| aDivisorOf0(X1,X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X3
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(split_conjunct,[status(thm)],[m__924]) ).
cnf(c_0_12,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__818]) ).
cnf(c_0_13,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[m__818]) ).
fof(c_0_14,plain,
! [X5,X6] :
( ~ aInteger0(X5)
| ~ aInteger0(X6)
| aInteger0(sdtpldt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])]) ).
cnf(c_0_15,hypothesis,
( aDivisorOf0(xq,X1)
| sdtpldt0(xa,smndt0(xc)) != X1
| ~ aInteger0(sdtpldt0(xn,xm))
| ~ aInteger0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]) ).
cnf(c_0_16,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__899]) ).
cnf(c_0_18,hypothesis,
aInteger0(xn),
inference(split_conjunct,[status(thm)],[m__876]) ).
cnf(c_0_19,hypothesis,
( aDivisorOf0(xq,X1)
| sdtpldt0(xa,smndt0(xc)) != X1
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_20,hypothesis,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(sdtpldt0(xa,smndt0(xc))) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_21,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[m__818]) ).
fof(c_0_22,plain,
! [X4] :
( ~ aInteger0(X4)
| aInteger0(smndt0(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
fof(c_0_23,plain,
! [X34,X35,X36] :
( ( ~ sdteqdtlpzmzozddtrp0(X34,X35,X36)
| aDivisorOf0(X36,sdtpldt0(X34,smndt0(X35)))
| ~ aInteger0(X34)
| ~ aInteger0(X35)
| ~ aInteger0(X36)
| X36 = sz00 )
& ( ~ aDivisorOf0(X36,sdtpldt0(X34,smndt0(X35)))
| sdteqdtlpzmzozddtrp0(X34,X35,X36)
| ~ aInteger0(X34)
| ~ aInteger0(X35)
| ~ aInteger0(X36)
| X36 = sz00 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEquMod])])]) ).
cnf(c_0_24,hypothesis,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(smndt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_21])]) ).
cnf(c_0_25,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
aInteger0(xc),
inference(split_conjunct,[status(thm)],[m__818]) ).
fof(c_0_27,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_28,plain,
( sdteqdtlpzmzozddtrp0(X2,X3,X1)
| X1 = sz00
| ~ aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,hypothesis,
aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_29]),c_0_26]),c_0_21]),c_0_12])]),c_0_13]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM432+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n009.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 14:54:59 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.acbgmjV3E8/E---3.1_9018.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 9097 completed with status 0
% 0.15/0.42 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.42 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.42 # No SInE strategy applied
% 0.15/0.42 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.42 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.15/0.42 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.15/0.42 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.15/0.42 # G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with pid 9108 completed with status 0
% 0.15/0.42 # Result found by G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S
% 0.15/0.42 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.42 # No SInE strategy applied
% 0.15/0.42 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.42 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.15/0.42 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.15/0.42 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 27
% 0.15/0.42 # Removed by relevancy pruning/SinE : 0
% 0.15/0.42 # Initial clauses : 45
% 0.15/0.42 # Removed in clause preprocessing : 1
% 0.15/0.42 # Initial clauses in saturation : 44
% 0.15/0.42 # Processed clauses : 100
% 0.15/0.42 # ...of these trivial : 2
% 0.15/0.42 # ...subsumed : 0
% 0.15/0.42 # ...remaining for further processing : 98
% 0.15/0.42 # Other redundant clauses eliminated : 2
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 1
% 0.15/0.42 # Backward-rewritten : 5
% 0.15/0.42 # Generated clauses : 53
% 0.15/0.42 # ...of the previous two non-redundant : 41
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 48
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 5
% 0.15/0.42 # Total rewrite steps : 49
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 48
% 0.15/0.42 # Positive orientable unit clauses : 18
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 2
% 0.15/0.42 # Non-unit-clauses : 28
% 0.15/0.42 # Current number of unprocessed clauses: 27
% 0.15/0.42 # ...number of literals in the above : 116
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 50
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 141
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 89
% 0.15/0.42 # Non-unit clause-clause subsumptions : 1
% 0.15/0.42 # Unit Clause-clause subsumption calls : 5
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 4
% 0.15/0.42 # BW rewrite match successes : 4
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 3403
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.009 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.010 s
% 0.15/0.42 # Maximum resident set size: 1812 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.032 s
% 0.15/0.42 # System time : 0.008 s
% 0.15/0.42 # Total time : 0.040 s
% 0.15/0.42 # Maximum resident set size: 1700 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------