TSTP Solution File: NUM436+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Sat May 4 08:54:37 EDT 2024
% Result : Theorem 0.39s 0.52s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 92 ( 27 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 118 ( 49 ~; 36 |; 32 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
file('/export/starexec/sandbox/tmp/tmp.gcVnsX6n3v/E---3.1_7342.p',m__) ).
fof(m__1071,hypothesis,
( sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)) ),
file('/export/starexec/sandbox/tmp/tmp.gcVnsX6n3v/E---3.1_7342.p',m__1071) ).
fof(m__979,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.gcVnsX6n3v/E---3.1_7342.p',m__979) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.gcVnsX6n3v/E---3.1_7342.p',mIntMult) ).
fof(m__1032,hypothesis,
( aInteger0(xm)
& sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.gcVnsX6n3v/E---3.1_7342.p',m__1032) ).
fof(c_0_5,negated_conjecture,
~ ( ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X6,X7] :
( ( ~ aInteger0(X7)
| sdtasdt0(xq,X7) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X6)
| sdtasdt0(xp,X6) != sdtpldt0(xa,smndt0(xb)) )
& ( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(X6)
| sdtasdt0(xp,X6) != sdtpldt0(xa,smndt0(xb)) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ aInteger0(X6)
| sdtasdt0(xp,X6) != sdtpldt0(xa,smndt0(xb)) )
& ( ~ aInteger0(X7)
| sdtasdt0(xq,X7) != sdtpldt0(xa,smndt0(xb))
| ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aInteger0(X7)
| sdtasdt0(xq,X7) != sdtpldt0(xa,smndt0(xb))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_7,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
cnf(c_0_8,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
cnf(c_0_9,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X2)
| sdtasdt0(xp,X2) != sdtpldt0(xa,smndt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( sdtasdt0(xp,X1) != sdtasdt0(xp,sdtasdt0(xq,xm))
| sdtasdt0(xq,X2) != sdtasdt0(xp,sdtasdt0(xq,xm))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_10]),c_0_8]),c_0_10]) ).
fof(c_0_12,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
inference(fof_simplification,[status(thm)],[m__979]) ).
cnf(c_0_13,negated_conjecture,
( sdtasdt0(xq,X1) != sdtasdt0(xp,sdtasdt0(xq,xm))
| ~ aInteger0(sdtasdt0(xq,xm))
| ~ aInteger0(X1) ),
inference(er,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X26,X27] :
( ~ aInteger0(X26)
| ~ aInteger0(X27)
| aInteger0(sdtasdt0(X26,X27)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])])]) ).
fof(c_0_15,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
( ~ aInteger0(sdtasdt0(xq,xm))
| ~ aInteger0(sdtasdt0(xp,xm)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_19,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
~ aInteger0(sdtasdt0(xp,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_21,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 09:11:41 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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/tmp/tmp.gcVnsX6n3v/E---3.1_7342.p
% 0.39/0.52 # Version: 3.1.0
% 0.39/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.52 # Starting sh5l with 300s (1) cores
% 0.39/0.52 # new_bool_1 with pid 7428 completed with status 0
% 0.39/0.52 # Result found by new_bool_1
% 0.39/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.39/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.39/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 7434 completed with status 0
% 0.39/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.39/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.39/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.39/0.52 # Preprocessing time : 0.002 s
% 0.39/0.52 # Presaturation interreduction done
% 0.39/0.52
% 0.39/0.52 # Proof found!
% 0.39/0.52 # SZS status Theorem
% 0.39/0.52 # SZS output start CNFRefutation
% See solution above
% 0.39/0.52 # Parsed axioms : 27
% 0.39/0.52 # Removed by relevancy pruning/SinE : 3
% 0.39/0.52 # Initial clauses : 52
% 0.39/0.52 # Removed in clause preprocessing : 1
% 0.39/0.52 # Initial clauses in saturation : 51
% 0.39/0.52 # Processed clauses : 142
% 0.39/0.52 # ...of these trivial : 5
% 0.39/0.52 # ...subsumed : 6
% 0.39/0.52 # ...remaining for further processing : 131
% 0.39/0.52 # Other redundant clauses eliminated : 2
% 0.39/0.52 # Clauses deleted for lack of memory : 0
% 0.39/0.52 # Backward-subsumed : 2
% 0.39/0.52 # Backward-rewritten : 11
% 0.39/0.52 # Generated clauses : 117
% 0.39/0.52 # ...of the previous two non-redundant : 104
% 0.39/0.52 # ...aggressively subsumed : 0
% 0.39/0.52 # Contextual simplify-reflections : 1
% 0.39/0.52 # Paramodulations : 114
% 0.39/0.52 # Factorizations : 0
% 0.39/0.52 # NegExts : 0
% 0.39/0.52 # Equation resolutions : 3
% 0.39/0.52 # Disequality decompositions : 0
% 0.39/0.52 # Total rewrite steps : 171
% 0.39/0.52 # ...of those cached : 152
% 0.39/0.52 # Propositional unsat checks : 0
% 0.39/0.52 # Propositional check models : 0
% 0.39/0.52 # Propositional check unsatisfiable : 0
% 0.39/0.52 # Propositional clauses : 0
% 0.39/0.52 # Propositional clauses after purity: 0
% 0.39/0.52 # Propositional unsat core size : 0
% 0.39/0.52 # Propositional preprocessing time : 0.000
% 0.39/0.52 # Propositional encoding time : 0.000
% 0.39/0.52 # Propositional solver time : 0.000
% 0.39/0.52 # Success case prop preproc time : 0.000
% 0.39/0.52 # Success case prop encoding time : 0.000
% 0.39/0.52 # Success case prop solver time : 0.000
% 0.39/0.52 # Current number of processed clauses : 65
% 0.39/0.52 # Positive orientable unit clauses : 24
% 0.39/0.52 # Positive unorientable unit clauses: 0
% 0.39/0.52 # Negative unit clauses : 4
% 0.39/0.52 # Non-unit-clauses : 37
% 0.39/0.52 # Current number of unprocessed clauses: 64
% 0.39/0.52 # ...number of literals in the above : 250
% 0.39/0.52 # Current number of archived formulas : 0
% 0.39/0.52 # Current number of archived clauses : 64
% 0.39/0.52 # Clause-clause subsumption calls (NU) : 394
% 0.39/0.52 # Rec. Clause-clause subsumption calls : 176
% 0.39/0.52 # Non-unit clause-clause subsumptions : 7
% 0.39/0.52 # Unit Clause-clause subsumption calls : 15
% 0.39/0.52 # Rewrite failures with RHS unbound : 0
% 0.39/0.52 # BW rewrite match attempts : 7
% 0.39/0.52 # BW rewrite match successes : 5
% 0.39/0.52 # Condensation attempts : 0
% 0.39/0.52 # Condensation successes : 0
% 0.39/0.52 # Termbank termtop insertions : 5793
% 0.39/0.52 # Search garbage collected termcells : 599
% 0.39/0.52
% 0.39/0.52 # -------------------------------------------------
% 0.39/0.52 # User time : 0.013 s
% 0.39/0.52 # System time : 0.002 s
% 0.39/0.52 # Total time : 0.016 s
% 0.39/0.52 # Maximum resident set size: 1864 pages
% 0.39/0.52
% 0.39/0.52 # -------------------------------------------------
% 0.39/0.52 # User time : 0.016 s
% 0.39/0.52 # System time : 0.004 s
% 0.39/0.52 # Total time : 0.020 s
% 0.39/0.52 # Maximum resident set size: 1748 pages
% 0.39/0.52 % E---3.1 exiting
% 0.39/0.53 % E exiting
%------------------------------------------------------------------------------