TSTP Solution File: NUM423+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM423+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:52 EDT 2024
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 121 ( 31 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 142 ( 55 ~; 48 |; 28 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdteqdtlpzmzozddtrp0(xa,xa,xq),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/benchmark/theBenchmark.p',mEquMod) ).
fof(m__671,hypothesis,
( aInteger0(xa)
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__671) ).
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/benchmark/theBenchmark.p',mDivisor) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
fof(mAddNeg,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddNeg) ).
fof(mMulZero,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulZero) ).
fof(mIntZero,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntZero) ).
fof(c_0_8,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_9,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_10,hypothesis,
( aInteger0(xa)
& aInteger0(xq)
& xq != sz00 ),
inference(fof_simplification,[status(thm)],[m__671]) ).
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]) ).
fof(c_0_12,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X9,X10,X11] :
( ( ~ sdteqdtlpzmzozddtrp0(X9,X10,X11)
| aDivisorOf0(X11,sdtpldt0(X9,smndt0(X10)))
| ~ aInteger0(X9)
| ~ aInteger0(X10)
| ~ aInteger0(X11)
| X11 = sz00 )
& ( ~ aDivisorOf0(X11,sdtpldt0(X9,smndt0(X10)))
| sdteqdtlpzmzozddtrp0(X9,X10,X11)
| ~ aInteger0(X9)
| ~ aInteger0(X10)
| ~ aInteger0(X11)
| X11 = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_14,hypothesis,
( aInteger0(xa)
& aInteger0(xq)
& xq != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
fof(c_0_15,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(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])])])])])])]) ).
fof(c_0_16,plain,
! [X22,X23] :
( ~ aInteger0(X22)
| ~ aInteger0(X23)
| aInteger0(sdtasdt0(X22,X23)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])])]) ).
cnf(c_0_17,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,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_13]) ).
cnf(c_0_19,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X35] :
( ( sdtpldt0(X35,smndt0(X35)) = sz00
| ~ aInteger0(X35) )
& ( sz00 = sdtpldt0(smndt0(X35),X35)
| ~ aInteger0(X35) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddNeg])])])]) ).
cnf(c_0_23,plain,
( X1 = sz00
| aDivisorOf0(X1,X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X3
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X5] :
( ( sdtasdt0(X5,sz00) = sz00
| ~ aInteger0(X5) )
& ( sz00 = sdtasdt0(sz00,X5)
| ~ aInteger0(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])])]) ).
cnf(c_0_26,negated_conjecture,
~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_27,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_23]),c_0_24]) ).
cnf(c_0_29,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[mIntZero]) ).
cnf(c_0_31,negated_conjecture,
~ aDivisorOf0(xq,sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19])]) ).
cnf(c_0_32,plain,
( X1 = sz00
| aDivisorOf0(X1,sz00)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : NUM423+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n004.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon May 20 04:09:07 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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/benchmark/theBenchmark.p
% 0.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 14229 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.16/0.45 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 14232 completed with status 0
% 0.16/0.45 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 21
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 34
% 0.16/0.45 # Removed in clause preprocessing : 1
% 0.16/0.45 # Initial clauses in saturation : 33
% 0.16/0.45 # Processed clauses : 93
% 0.16/0.45 # ...of these trivial : 3
% 0.16/0.45 # ...subsumed : 11
% 0.16/0.45 # ...remaining for further processing : 79
% 0.16/0.45 # Other redundant clauses eliminated : 3
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 1
% 0.16/0.45 # Generated clauses : 181
% 0.16/0.45 # ...of the previous two non-redundant : 155
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 1
% 0.16/0.45 # Paramodulations : 178
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 3
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 93
% 0.16/0.45 # ...of those cached : 87
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 43
% 0.16/0.45 # Positive orientable unit clauses : 6
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 6
% 0.16/0.45 # Non-unit-clauses : 31
% 0.16/0.45 # Current number of unprocessed clauses: 128
% 0.16/0.45 # ...number of literals in the above : 504
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 34
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 229
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 144
% 0.16/0.45 # Non-unit clause-clause subsumptions : 10
% 0.16/0.45 # Unit Clause-clause subsumption calls : 2
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 1
% 0.16/0.45 # BW rewrite match successes : 1
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 4877
% 0.16/0.45 # Search garbage collected termcells : 401
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.011 s
% 0.16/0.45 # System time : 0.000 s
% 0.16/0.45 # Total time : 0.011 s
% 0.16/0.45 # Maximum resident set size: 1836 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.011 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.014 s
% 0.16/0.45 # Maximum resident set size: 1708 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------