TSTP Solution File: NUM432+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM432+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:56 EDT 2024
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% 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/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__924,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__924) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
fof(m__899,hypothesis,
( aInteger0(xm)
& sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__899) ).
fof(m__876,hypothesis,
( aInteger0(xn)
& sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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,
! [X45] :
( ( ~ aInteger0(X45)
| sdtasdt0(xq,X45) != 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,
! [X6,X7] :
( ~ aInteger0(X6)
| ~ aInteger0(X7)
| aInteger0(sdtpldt0(X6,X7)) ),
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.03/0.12 % Problem : NUM432+3 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 05:01:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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/benchmark/theBenchmark.p
% 0.18/0.48 # Version: 3.1.0
% 0.18/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 12677 completed with status 0
% 0.18/0.48 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.18/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.18/0.48 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.18/0.48 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.18/0.48 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.18/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 12682 completed with status 0
% 0.18/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.18/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 27
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 53
% 0.18/0.48 # Removed in clause preprocessing : 1
% 0.18/0.48 # Initial clauses in saturation : 52
% 0.18/0.48 # Processed clauses : 96
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 0
% 0.18/0.48 # ...remaining for further processing : 96
% 0.18/0.48 # Other redundant clauses eliminated : 2
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 4
% 0.18/0.48 # Generated clauses : 18
% 0.18/0.48 # ...of the previous two non-redundant : 13
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 1
% 0.18/0.48 # Paramodulations : 15
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 3
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 27
% 0.18/0.48 # ...of those cached : 16
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 38
% 0.18/0.48 # Positive orientable unit clauses : 21
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 4
% 0.18/0.48 # Non-unit-clauses : 13
% 0.18/0.48 # Current number of unprocessed clauses: 21
% 0.18/0.48 # ...number of literals in the above : 73
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 56
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 225
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 84
% 0.18/0.48 # Non-unit clause-clause subsumptions : 1
% 0.18/0.48 # Unit Clause-clause subsumption calls : 9
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 4
% 0.18/0.48 # BW rewrite match successes : 3
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 3457
% 0.18/0.48 # Search garbage collected termcells : 495
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.008 s
% 0.18/0.48 # System time : 0.002 s
% 0.18/0.48 # Total time : 0.010 s
% 0.18/0.48 # Maximum resident set size: 1812 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.019 s
% 0.18/0.48 # System time : 0.009 s
% 0.18/0.48 # Total time : 0.028 s
% 0.18/0.48 # Maximum resident set size: 1716 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------