TSTP Solution File: NUM429+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM429+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:54 EDT 2024
% Result : Theorem 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 29 ( 10 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 26 ( 7 ~; 3 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 7 ( 0 sgn 1 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__853,hypothesis,
( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xb,smndt0(xc)) )
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__853) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X6] :
( ~ aInteger0(X6)
| sdtasdt0(xq,X6) != sdtpldt0(xa,smndt0(xb)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,hypothesis,
( aInteger0(esk1_0)
& sdtasdt0(xq,esk1_0) = sdtpldt0(xa,smndt0(xb))
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aInteger0(esk2_0)
& sdtasdt0(xq,esk2_0) = sdtpldt0(xb,smndt0(xc))
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__853])]) ).
cnf(c_0_5,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
sdtasdt0(xq,esk1_0) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( sdtasdt0(xq,X1) != sdtasdt0(xq,esk1_0)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,hypothesis,
aInteger0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : NUM429+3 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n020.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 03:46:52 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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.16/0.42 # Version: 3.1.0
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # new_bool_3 with pid 23165 completed with status 0
% 0.16/0.42 # Result found by new_bool_3
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.42 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.16/0.42 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 23169 completed with status 0
% 0.16/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.42 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Theorem
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 24
% 0.16/0.42 # Removed by relevancy pruning/SinE : 3
% 0.16/0.42 # Initial clauses : 41
% 0.16/0.42 # Removed in clause preprocessing : 1
% 0.16/0.42 # Initial clauses in saturation : 40
% 0.16/0.42 # Processed clauses : 54
% 0.16/0.42 # ...of these trivial : 0
% 0.16/0.42 # ...subsumed : 0
% 0.16/0.42 # ...remaining for further processing : 54
% 0.16/0.42 # Other redundant clauses eliminated : 2
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 0
% 0.16/0.42 # Generated clauses : 3
% 0.16/0.42 # ...of the previous two non-redundant : 2
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 1
% 0.16/0.42 # Paramodulations : 0
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 3
% 0.16/0.42 # Disequality decompositions : 0
% 0.16/0.42 # Total rewrite steps : 4
% 0.16/0.42 # ...of those cached : 1
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 12
% 0.16/0.42 # Positive orientable unit clauses : 7
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 1
% 0.16/0.42 # Non-unit-clauses : 4
% 0.16/0.42 # Current number of unprocessed clauses: 28
% 0.16/0.42 # ...number of literals in the above : 83
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 40
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 213
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 76
% 0.16/0.42 # Non-unit clause-clause subsumptions : 1
% 0.16/0.42 # Unit Clause-clause subsumption calls : 0
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 0
% 0.16/0.42 # BW rewrite match successes : 0
% 0.16/0.42 # Condensation attempts : 0
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 2780
% 0.16/0.42 # Search garbage collected termcells : 484
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.005 s
% 0.16/0.42 # System time : 0.002 s
% 0.16/0.42 # Total time : 0.008 s
% 0.16/0.42 # Maximum resident set size: 1844 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.006 s
% 0.16/0.42 # System time : 0.005 s
% 0.16/0.42 # Total time : 0.011 s
% 0.16/0.42 # Maximum resident set size: 1712 pages
% 0.16/0.42 % E---3.1 exiting
% 0.16/0.42 % E exiting
%------------------------------------------------------------------------------