TSTP Solution File: GRP679-1 by E---3.1

View Problem - Process Solution

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

% Computer : n032.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 17:42:48 EDT 2023

% Result   : Unsatisfiable 0.16s 0.41s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  16 unt;   0 nHn;   4 RR)
%            Number of literals    :   16 (  15 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   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   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c07,axiom,
    mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
    file('/export/starexec/sandbox/tmp/tmp.Hqtcr0c5uK/E---3.1_23851.p',c07) ).

cnf(c06,axiom,
    mult(unit,X1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.Hqtcr0c5uK/E---3.1_23851.p',c06) ).

cnf(c02,axiom,
    ld(X1,mult(X1,X2)) = X2,
    file('/export/starexec/sandbox/tmp/tmp.Hqtcr0c5uK/E---3.1_23851.p',c02) ).

cnf(c08,axiom,
    mult(op_c,X1) = mult(X1,op_c),
    file('/export/starexec/sandbox/tmp/tmp.Hqtcr0c5uK/E---3.1_23851.p',c08) ).

cnf(goals,negated_conjecture,
    mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
    file('/export/starexec/sandbox/tmp/tmp.Hqtcr0c5uK/E---3.1_23851.p',goals) ).

cnf(c_0_5,axiom,
    mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
    c07 ).

cnf(c_0_6,axiom,
    mult(unit,X1) = X1,
    c06 ).

cnf(c_0_7,axiom,
    ld(X1,mult(X1,X2)) = X2,
    c02 ).

cnf(c_0_8,axiom,
    mult(op_c,X1) = mult(X1,op_c),
    c08 ).

cnf(c_0_9,negated_conjecture,
    mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
    goals ).

cnf(c_0_10,plain,
    mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).

cnf(c_0_11,plain,
    ld(op_c,mult(X1,op_c)) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    mult(mult(op_c,mult(op_c,X1)),X2) = mult(op_c,mult(X1,mult(op_c,X2))),
    inference(spm,[status(thm)],[c_0_5,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    mult(a,mult(op_c,op_c)) != mult(op_c,mult(op_c,a)),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    mult(X1,mult(op_c,op_c)) = mult(op_c,mult(op_c,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : GRP679-1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.12/0.30  % Computer : n032.cluster.edu
% 0.12/0.30  % Model    : x86_64 x86_64
% 0.12/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30  % Memory   : 8042.1875MB
% 0.12/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30  % CPULimit   : 2400
% 0.12/0.30  % WCLimit    : 300
% 0.12/0.30  % DateTime   : Tue Oct  3 02:42:04 EDT 2023
% 0.12/0.30  % CPUTime    : 
% 0.16/0.40  Running first-order theorem proving
% 0.16/0.40  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.Hqtcr0c5uK/E---3.1_23851.p
% 0.16/0.41  # Version: 3.1pre001
% 0.16/0.41  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.41  # Starting sh5l with 300s (1) cores
% 0.16/0.41  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 23931 completed with status 0
% 0.16/0.41  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.41  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.41  # No SInE strategy applied
% 0.16/0.41  # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.16/0.41  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.41  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.16/0.41  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.41  # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.41  # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.41  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.16/0.41  # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 23937 completed with status 0
% 0.16/0.41  # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.16/0.41  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.41  # No SInE strategy applied
% 0.16/0.41  # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.16/0.41  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.41  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.16/0.41  # Preprocessing time       : 0.001 s
% 0.16/0.41  # Presaturation interreduction done
% 0.16/0.41  
% 0.16/0.41  # Proof found!
% 0.16/0.41  # SZS status Unsatisfiable
% 0.16/0.41  # SZS output start CNFRefutation
% See solution above
% 0.16/0.41  # Parsed axioms                        : 9
% 0.16/0.41  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.41  # Initial clauses                      : 9
% 0.16/0.41  # Removed in clause preprocessing      : 0
% 0.16/0.41  # Initial clauses in saturation        : 9
% 0.16/0.41  # Processed clauses                    : 57
% 0.16/0.41  # ...of these trivial                  : 4
% 0.16/0.41  # ...subsumed                          : 13
% 0.16/0.41  # ...remaining for further processing  : 40
% 0.16/0.41  # Other redundant clauses eliminated   : 0
% 0.16/0.41  # Clauses deleted for lack of memory   : 0
% 0.16/0.41  # Backward-subsumed                    : 0
% 0.16/0.41  # Backward-rewritten                   : 5
% 0.16/0.41  # Generated clauses                    : 260
% 0.16/0.41  # ...of the previous two non-redundant : 149
% 0.16/0.41  # ...aggressively subsumed             : 0
% 0.16/0.41  # Contextual simplify-reflections      : 0
% 0.16/0.41  # Paramodulations                      : 260
% 0.16/0.41  # Factorizations                       : 0
% 0.16/0.41  # NegExts                              : 0
% 0.16/0.41  # Equation resolutions                 : 0
% 0.16/0.41  # Total rewrite steps                  : 230
% 0.16/0.41  # Propositional unsat checks           : 0
% 0.16/0.41  #    Propositional check models        : 0
% 0.16/0.41  #    Propositional check unsatisfiable : 0
% 0.16/0.41  #    Propositional clauses             : 0
% 0.16/0.41  #    Propositional clauses after purity: 0
% 0.16/0.41  #    Propositional unsat core size     : 0
% 0.16/0.41  #    Propositional preprocessing time  : 0.000
% 0.16/0.41  #    Propositional encoding time       : 0.000
% 0.16/0.41  #    Propositional solver time         : 0.000
% 0.16/0.41  #    Success case prop preproc time    : 0.000
% 0.16/0.41  #    Success case prop encoding time   : 0.000
% 0.16/0.41  #    Success case prop solver time     : 0.000
% 0.16/0.41  # Current number of processed clauses  : 26
% 0.16/0.41  #    Positive orientable unit clauses  : 21
% 0.16/0.41  #    Positive unorientable unit clauses: 5
% 0.16/0.41  #    Negative unit clauses             : 0
% 0.16/0.41  #    Non-unit-clauses                  : 0
% 0.16/0.41  # Current number of unprocessed clauses: 106
% 0.16/0.41  # ...number of literals in the above   : 106
% 0.16/0.41  # Current number of archived formulas  : 0
% 0.16/0.41  # Current number of archived clauses   : 14
% 0.16/0.41  # Clause-clause subsumption calls (NU) : 0
% 0.16/0.41  # Rec. Clause-clause subsumption calls : 0
% 0.16/0.41  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.41  # Unit Clause-clause subsumption calls : 3
% 0.16/0.41  # Rewrite failures with RHS unbound    : 0
% 0.16/0.41  # BW rewrite match attempts            : 21
% 0.16/0.41  # BW rewrite match successes           : 8
% 0.16/0.41  # Condensation attempts                : 0
% 0.16/0.41  # Condensation successes               : 0
% 0.16/0.41  # Termbank termtop insertions          : 3403
% 0.16/0.41  
% 0.16/0.41  # -------------------------------------------------
% 0.16/0.41  # User time                : 0.003 s
% 0.16/0.41  # System time              : 0.002 s
% 0.16/0.41  # Total time               : 0.005 s
% 0.16/0.41  # Maximum resident set size: 1512 pages
% 0.16/0.41  
% 0.16/0.41  # -------------------------------------------------
% 0.16/0.41  # User time                : 0.017 s
% 0.16/0.41  # System time              : 0.005 s
% 0.16/0.41  # Total time               : 0.022 s
% 0.16/0.41  # Maximum resident set size: 1672 pages
% 0.16/0.41  % E---3.1 exiting
% 0.16/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------