TSTP Solution File: NUM425+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM425+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:04 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 93 ( 17 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 112 ( 48 ~; 41 |; 17 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn; 19 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox2/tmp/tmp.9NMqrpoaAq/E---3.1_25985.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/tmp/tmp.9NMqrpoaAq/E---3.1_25985.p',mEquMod) ).
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.9NMqrpoaAq/E---3.1_25985.p',mDivisor) ).
fof(m__724,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
file('/export/starexec/sandbox2/tmp/tmp.9NMqrpoaAq/E---3.1_25985.p',m__724) ).
fof(m__704,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox2/tmp/tmp.9NMqrpoaAq/E---3.1_25985.p',m__704) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.9NMqrpoaAq/E---3.1_25985.p',mIntPlus) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.9NMqrpoaAq/E---3.1_25985.p',mIntNeg) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,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])])]) ).
fof(c_0_9,negated_conjecture,
! [X39] :
( ~ aInteger0(X39)
| sdtasdt0(xq,X39) != sdtpldt0(xa,smndt0(xb)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_10,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_11,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_8]) ).
cnf(c_0_12,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(split_conjunct,[status(thm)],[m__724]) ).
cnf(c_0_13,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__704]) ).
cnf(c_0_14,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[m__704]) ).
cnf(c_0_15,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[m__704]) ).
cnf(c_0_16,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[m__704]) ).
cnf(c_0_17,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( sdtasdt0(X1,esk1_2(X2,X1)) = X2
| ~ aDivisorOf0(X1,X2)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,hypothesis,
aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
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_11,c_0_12]),c_0_13]),c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( ~ aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))
| ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18])]),c_0_19])]) ).
cnf(c_0_21,plain,
( aInteger0(esk1_2(X1,X2))
| ~ aDivisorOf0(X2,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,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_23,negated_conjecture,
~ aInteger0(sdtpldt0(xa,smndt0(xb))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19])]) ).
cnf(c_0_24,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X4] :
( ~ aInteger0(X4)
| aInteger0(smndt0(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_26,negated_conjecture,
~ aInteger0(smndt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15])]) ).
cnf(c_0_27,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM425+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.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 13:46:41 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.9NMqrpoaAq/E---3.1_25985.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26062 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.15/0.43 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.15/0.43 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26069 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 23
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 37
% 0.15/0.43 # Removed in clause preprocessing : 1
% 0.15/0.43 # Initial clauses in saturation : 36
% 0.15/0.43 # Processed clauses : 92
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 9
% 0.15/0.43 # ...remaining for further processing : 83
% 0.15/0.43 # Other redundant clauses eliminated : 4
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 1
% 0.15/0.43 # Backward-rewritten : 1
% 0.15/0.43 # Generated clauses : 175
% 0.15/0.43 # ...of the previous two non-redundant : 151
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 1
% 0.15/0.43 # Paramodulations : 171
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 4
% 0.15/0.43 # Total rewrite steps : 95
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 43
% 0.15/0.43 # Positive orientable unit clauses : 9
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 3
% 0.15/0.43 # Non-unit-clauses : 31
% 0.15/0.43 # Current number of unprocessed clauses: 131
% 0.15/0.43 # ...number of literals in the above : 545
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 38
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 302
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 135
% 0.15/0.43 # Non-unit clause-clause subsumptions : 10
% 0.15/0.43 # Unit Clause-clause subsumption calls : 64
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 1
% 0.15/0.43 # BW rewrite match successes : 1
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 4680
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.009 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.011 s
% 0.15/0.43 # Maximum resident set size: 1792 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.035 s
% 0.15/0.43 # System time : 0.008 s
% 0.15/0.43 # Total time : 0.043 s
% 0.15/0.43 # Maximum resident set size: 1700 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------