TSTP Solution File: NUM838+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM838+2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:17:28 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 7 unt; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq(195), 305, 0)',conjecture,
greater(vplus(vd301,vd303),vplus(vd302,vd303)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq(195), 305, 0)') ).
fof('ass(cond(proof(196), 0), 4)',axiom,
! [X1,X6,X7] :
( greater(X6,X7)
=> greater(vplus(X6,X1),vplus(X7,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 4)') ).
fof('holds(antec(195), 304, 0)',axiom,
greater(vd301,vd302),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(antec(195), 304, 0)') ).
fof(c_0_3,negated_conjecture,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(195), 305, 0)'])]) ).
fof(c_0_4,negated_conjecture,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X38,X39,X40] :
( ~ greater(X39,X40)
| greater(vplus(X39,X38),vplus(X40,X38)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(proof(196), 0), 4)'])])]) ).
cnf(c_0_6,negated_conjecture,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( greater(vplus(X1,X3),vplus(X2,X3))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
greater(vd301,vd302),
inference(split_conjunct,[status(thm)],['holds(antec(195), 304, 0)']) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM838+2 : TPTP v8.2.0. Released v4.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 05:11:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/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/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 27393 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSS-FFSF22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.50 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 27396 completed with status 0
% 0.20/0.50 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSS-FFSF22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 30
% 0.20/0.50 # Removed by relevancy pruning/SinE : 17
% 0.20/0.50 # Initial clauses : 14
% 0.20/0.50 # Removed in clause preprocessing : 1
% 0.20/0.50 # Initial clauses in saturation : 13
% 0.20/0.50 # Processed clauses : 47
% 0.20/0.50 # ...of these trivial : 4
% 0.20/0.50 # ...subsumed : 6
% 0.20/0.50 # ...remaining for further processing : 37
% 0.20/0.50 # Other redundant clauses eliminated : 7
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 106
% 0.20/0.50 # ...of the previous two non-redundant : 86
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 99
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 7
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 36
% 0.20/0.50 # ...of those cached : 19
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 22
% 0.20/0.50 # Positive orientable unit clauses : 8
% 0.20/0.50 # Positive unorientable unit clauses: 1
% 0.20/0.50 # Negative unit clauses : 9
% 0.20/0.50 # Non-unit-clauses : 4
% 0.20/0.50 # Current number of unprocessed clauses: 59
% 0.20/0.50 # ...number of literals in the above : 71
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 10
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 3
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 3
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 13
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 20
% 0.20/0.50 # BW rewrite match successes : 12
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1482
% 0.20/0.50 # Search garbage collected termcells : 285
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1784 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 1744 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------