TSTP Solution File: NUM432+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM432+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 09:06:00 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 35 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 14 ~; 11 |; 7 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 11 ( 0 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xc)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
file('/export/starexec/sandbox2/tmp/tmp.oDZZrUwhTv/E---3.1_358.p',m__) ).
fof(m__924,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox2/tmp/tmp.oDZZrUwhTv/E---3.1_358.p',m__924) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.oDZZrUwhTv/E---3.1_358.p',mIntPlus) ).
fof(m__899,hypothesis,
( aInteger0(xm)
& sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc)) ),
file('/export/starexec/sandbox2/tmp/tmp.oDZZrUwhTv/E---3.1_358.p',m__899) ).
fof(m__876,hypothesis,
( aInteger0(xn)
& sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox2/tmp/tmp.oDZZrUwhTv/E---3.1_358.p',m__876) ).
fof(c_0_5,negated_conjecture,
~ ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xc)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X6] :
( ( ~ aInteger0(X6)
| sdtasdt0(xq,X6) != sdtpldt0(xa,smndt0(xc)) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
& ~ sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
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,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(split_conjunct,[status(thm)],[m__924]) ).
cnf(c_0_9,negated_conjecture,
( sdtasdt0(xq,X1) != sdtasdt0(xq,sdtpldt0(xn,xm))
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_10,plain,
! [X26,X27] :
( ~ aInteger0(X26)
| ~ aInteger0(X27)
| aInteger0(sdtpldt0(X26,X27)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])])]) ).
cnf(c_0_11,negated_conjecture,
~ aInteger0(sdtpldt0(xn,xm)),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__899]) ).
cnf(c_0_14,hypothesis,
aInteger0(xn),
inference(split_conjunct,[status(thm)],[m__876]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM432+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 09:08:33 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.oDZZrUwhTv/E---3.1_358.p
% 0.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_1 with pid 534 completed with status 0
% 0.19/0.50 # Result found by new_bool_1
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 537 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.19/0.51 # Preprocessing time : 0.002 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 27
% 0.19/0.51 # Removed by relevancy pruning/SinE : 3
% 0.19/0.51 # Initial clauses : 48
% 0.19/0.51 # Removed in clause preprocessing : 1
% 0.19/0.51 # Initial clauses in saturation : 47
% 0.19/0.51 # Processed clauses : 85
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 0
% 0.19/0.51 # ...remaining for further processing : 85
% 0.19/0.51 # Other redundant clauses eliminated : 2
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 4
% 0.19/0.51 # Generated clauses : 13
% 0.19/0.51 # ...of the previous two non-redundant : 8
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 1
% 0.19/0.51 # Paramodulations : 10
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 3
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 11
% 0.19/0.51 # ...of those cached : 4
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 32
% 0.19/0.51 # Positive orientable unit clauses : 18
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 4
% 0.19/0.51 # Non-unit-clauses : 10
% 0.19/0.51 # Current number of unprocessed clauses: 17
% 0.19/0.51 # ...number of literals in the above : 66
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 51
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 213
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 74
% 0.19/0.51 # Non-unit clause-clause subsumptions : 1
% 0.19/0.51 # Unit Clause-clause subsumption calls : 8
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 4
% 0.19/0.51 # BW rewrite match successes : 3
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 3203
% 0.19/0.51 # Search garbage collected termcells : 492
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.011 s
% 0.19/0.51 # System time : 0.004 s
% 0.19/0.51 # Total time : 0.015 s
% 0.19/0.51 # Maximum resident set size: 1852 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.013 s
% 0.19/0.51 # System time : 0.007 s
% 0.19/0.51 # Total time : 0.020 s
% 0.19/0.51 # Maximum resident set size: 1720 pages
% 0.19/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------