TSTP Solution File: NUM851+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : NUM851+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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 18:57:47 EDT 2023

% Result   : Theorem 0.22s 0.52s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (  11 unt;   0 def)
%            Number of atoms       :   11 (  10 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn;  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('holds(conseq_conjunct2(conseq(302)), 475, 1)',conjecture,
    vmul(vplus(vd471,vd473),vd469) = vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
    file('/export/starexec/sandbox/tmp/tmp.VwrCrA7xI5/E---3.1_21340.p','holds(conseq_conjunct2(conseq(302)), 475, 1)') ).

fof('ass(cond(270, 0), 0)',axiom,
    ! [X7,X8] : vmul(X7,X8) = vmul(X8,X7),
    file('/export/starexec/sandbox/tmp/tmp.VwrCrA7xI5/E---3.1_21340.p','ass(cond(270, 0), 0)') ).

fof('ass(cond(281, 0), 0)',axiom,
    ! [X4,X5,X6] : vmul(X4,vplus(X5,X6)) = vplus(vmul(X4,X5),vmul(X4,X6)),
    file('/export/starexec/sandbox/tmp/tmp.VwrCrA7xI5/E---3.1_21340.p','ass(cond(281, 0), 0)') ).

fof(c_0_3,negated_conjecture,
    vmul(vplus(vd471,vd473),vd469) != vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq_conjunct2(conseq(302)), 475, 1)'])]) ).

fof(c_0_4,plain,
    ! [X130,X131] : vmul(X130,X131) = vmul(X131,X130),
    inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).

cnf(c_0_5,negated_conjecture,
    vmul(vplus(vd471,vd473),vd469) != vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    vmul(X1,X2) = vmul(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_7,plain,
    ! [X127,X128,X129] : vmul(X127,vplus(X128,X129)) = vplus(vmul(X127,X128),vmul(X127,X129)),
    inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).

cnf(c_0_8,negated_conjecture,
    vmul(vd469,vplus(vd471,vd473)) != vplus(vmul(vd471,vd469),vmul(vd469,vd473)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).

cnf(c_0_9,plain,
    vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : NUM851+1 : TPTP v8.1.2. Released v4.1.0.
% 0.08/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n022.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Oct  2 14:52:24 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.50  Running first-order theorem proving
% 0.22/0.50  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/tmp/tmp.VwrCrA7xI5/E---3.1_21340.p
% 0.22/0.52  # Version: 3.1pre001
% 0.22/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52  # Starting sh5l with 300s (1) cores
% 0.22/0.52  # new_bool_3 with pid 21468 completed with status 0
% 0.22/0.52  # Result found by new_bool_3
% 0.22/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52  # Search class: FGHSM-FFMS21-SFFFFFNN
% 0.22/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.22/0.52  # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 21473 completed with status 0
% 0.22/0.52  # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.22/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52  # Search class: FGHSM-FFMS21-SFFFFFNN
% 0.22/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.22/0.52  # Preprocessing time       : 0.002 s
% 0.22/0.52  # Presaturation interreduction done
% 0.22/0.52  
% 0.22/0.52  # Proof found!
% 0.22/0.52  # SZS status Theorem
% 0.22/0.52  # SZS output start CNFRefutation
% See solution above
% 0.22/0.52  # Parsed axioms                        : 54
% 0.22/0.52  # Removed by relevancy pruning/SinE    : 1
% 0.22/0.52  # Initial clauses                      : 63
% 0.22/0.52  # Removed in clause preprocessing      : 1
% 0.22/0.52  # Initial clauses in saturation        : 62
% 0.22/0.52  # Processed clauses                    : 59
% 0.22/0.52  # ...of these trivial                  : 1
% 0.22/0.52  # ...subsumed                          : 3
% 0.22/0.52  # ...remaining for further processing  : 55
% 0.22/0.52  # Other redundant clauses eliminated   : 9
% 0.22/0.52  # Clauses deleted for lack of memory   : 0
% 0.22/0.52  # Backward-subsumed                    : 0
% 0.22/0.52  # Backward-rewritten                   : 4
% 0.22/0.52  # Generated clauses                    : 9
% 0.22/0.52  # ...of the previous two non-redundant : 10
% 0.22/0.52  # ...aggressively subsumed             : 0
% 0.22/0.52  # Contextual simplify-reflections      : 0
% 0.22/0.52  # Paramodulations                      : 0
% 0.22/0.52  # Factorizations                       : 0
% 0.22/0.52  # NegExts                              : 0
% 0.22/0.52  # Equation resolutions                 : 9
% 0.22/0.52  # Total rewrite steps                  : 12
% 0.22/0.52  # Propositional unsat checks           : 0
% 0.22/0.52  #    Propositional check models        : 0
% 0.22/0.52  #    Propositional check unsatisfiable : 0
% 0.22/0.52  #    Propositional clauses             : 0
% 0.22/0.52  #    Propositional clauses after purity: 0
% 0.22/0.52  #    Propositional unsat core size     : 0
% 0.22/0.52  #    Propositional preprocessing time  : 0.000
% 0.22/0.52  #    Propositional encoding time       : 0.000
% 0.22/0.52  #    Propositional solver time         : 0.000
% 0.22/0.52  #    Success case prop preproc time    : 0.000
% 0.22/0.52  #    Success case prop encoding time   : 0.000
% 0.22/0.52  #    Success case prop solver time     : 0.000
% 0.22/0.52  # Current number of processed clauses  : 42
% 0.22/0.52  #    Positive orientable unit clauses  : 14
% 0.22/0.52  #    Positive unorientable unit clauses: 5
% 0.22/0.52  #    Negative unit clauses             : 6
% 0.22/0.52  #    Non-unit-clauses                  : 17
% 0.22/0.52  # Current number of unprocessed clauses: 13
% 0.22/0.52  # ...number of literals in the above   : 34
% 0.22/0.52  # Current number of archived formulas  : 0
% 0.22/0.52  # Current number of archived clauses   : 4
% 0.22/0.52  # Clause-clause subsumption calls (NU) : 34
% 0.22/0.52  # Rec. Clause-clause subsumption calls : 34
% 0.22/0.52  # Non-unit clause-clause subsumptions  : 1
% 0.22/0.52  # Unit Clause-clause subsumption calls : 13
% 0.22/0.52  # Rewrite failures with RHS unbound    : 0
% 0.22/0.52  # BW rewrite match attempts            : 31
% 0.22/0.52  # BW rewrite match successes           : 28
% 0.22/0.52  # Condensation attempts                : 0
% 0.22/0.52  # Condensation successes               : 0
% 0.22/0.52  # Termbank termtop insertions          : 2857
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.007 s
% 0.22/0.52  # System time              : 0.002 s
% 0.22/0.52  # Total time               : 0.009 s
% 0.22/0.52  # Maximum resident set size: 1928 pages
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.009 s
% 0.22/0.52  # System time              : 0.005 s
% 0.22/0.52  # Total time               : 0.013 s
% 0.22/0.52  # Maximum resident set size: 1792 pages
% 0.22/0.52  % E---3.1 exiting
% 0.22/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------