TSTP Solution File: NUM854+2 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : NUM854+2 : TPTP v8.1.2. Released v4.1.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:08:42 EDT 2023

% Result   : Theorem 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    9 (   6 unt;   0 def)
%            Number of atoms       :   12 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   4   ~;   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(conjunct1(315), 514, 0)',conjecture,
    greater(vmul(vd508,vd511),vmul(vd509,vd511)),
    file('/export/starexec/sandbox2/tmp/tmp.FJbypDnfoH/E---3.1_25809.p','holds(conjunct1(315), 514, 0)') ).

fof('ass(cond(299, 0), 2)',axiom,
    ! [X10,X15,X16] :
      ( greater(X15,X16)
     => greater(vmul(X15,X10),vmul(X16,X10)) ),
    file('/export/starexec/sandbox2/tmp/tmp.FJbypDnfoH/E---3.1_25809.p','ass(cond(299, 0), 2)') ).

fof('holds(conjunct1(314), 510, 0)',axiom,
    greater(vd508,vd509),
    file('/export/starexec/sandbox2/tmp/tmp.FJbypDnfoH/E---3.1_25809.p','holds(conjunct1(314), 510, 0)') ).

fof(c_0_3,negated_conjecture,
    ~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conjunct1(315), 514, 0)'])]) ).

fof(c_0_4,plain,
    ! [X49,X50,X51] :
      ( ~ greater(X50,X51)
      | greater(vmul(X50,X49),vmul(X51,X49)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])]) ).

cnf(c_0_5,negated_conjecture,
    ~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( greater(vmul(X1,X3),vmul(X2,X3))
    | ~ greater(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    greater(vd508,vd509),
    inference(split_conjunct,[status(thm)],['holds(conjunct1(314), 510, 0)']) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : NUM854+2 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n010.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 2400
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon Oct  2 14:12:35 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  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.FJbypDnfoH/E---3.1_25809.p
% 0.21/0.51  # Version: 3.1pre001
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # new_bool_3 with pid 25887 completed with status 0
% 0.21/0.51  # Result found by new_bool_3
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FGHSS-FFMF22-SFFFFFNN
% 0.21/0.51  # partial match(1): FGHSS-FFMF32-SFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 0.21/0.51  # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25893 completed with status 0
% 0.21/0.51  # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FGHSS-FFMF22-SFFFFFNN
% 0.21/0.51  # partial match(1): FGHSS-FFMF32-SFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.001 s
% 0.21/0.51  # Presaturation interreduction done
% 0.21/0.51  
% 0.21/0.51  # Proof found!
% 0.21/0.51  # SZS status Theorem
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 27
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 4
% 0.21/0.51  # Initial clauses                      : 25
% 0.21/0.51  # Removed in clause preprocessing      : 1
% 0.21/0.51  # Initial clauses in saturation        : 24
% 0.21/0.51  # Processed clauses                    : 72
% 0.21/0.51  # ...of these trivial                  : 0
% 0.21/0.51  # ...subsumed                          : 13
% 0.21/0.51  # ...remaining for further processing  : 59
% 0.21/0.51  # Other redundant clauses eliminated   : 10
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 0
% 0.21/0.51  # Backward-rewritten                   : 0
% 0.21/0.51  # Generated clauses                    : 96
% 0.21/0.51  # ...of the previous two non-redundant : 76
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 84
% 0.21/0.51  # Factorizations                       : 0
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 12
% 0.21/0.51  # Total rewrite steps                  : 18
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 29
% 0.21/0.51  #    Positive orientable unit clauses  : 5
% 0.21/0.51  #    Positive unorientable unit clauses: 1
% 0.21/0.51  #    Negative unit clauses             : 11
% 0.21/0.51  #    Non-unit-clauses                  : 12
% 0.21/0.51  # Current number of unprocessed clauses: 48
% 0.21/0.51  # ...number of literals in the above   : 80
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 23
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 24
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 24
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 3
% 0.21/0.51  # Unit Clause-clause subsumption calls : 25
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 18
% 0.21/0.51  # BW rewrite match successes           : 18
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 1862
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.007 s
% 0.21/0.51  # System time              : 0.002 s
% 0.21/0.51  # Total time               : 0.009 s
% 0.21/0.51  # Maximum resident set size: 1884 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.009 s
% 0.21/0.51  # System time              : 0.004 s
% 0.21/0.51  # Total time               : 0.012 s
% 0.21/0.51  # Maximum resident set size: 1724 pages
% 0.21/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------