TSTP Solution File: GRP704-12 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GRP704-12 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n029.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:59 EDT 2023

% Result   : Unsatisfiable 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   4 RR)
%            Number of literals    :   11 (  10 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(f01,axiom,
    mult(X1,ld(X1,X2)) = X2,
    file('/export/starexec/sandbox2/tmp/tmp.RzyjiCQVA1/E---3.1_2395.p',f01) ).

cnf(f10,axiom,
    mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
    file('/export/starexec/sandbox2/tmp/tmp.RzyjiCQVA1/E---3.1_2395.p',f10) ).

cnf(f13,axiom,
    op_f = mult(X1,mult(X2,ld(mult(X1,X2),op_c))),
    file('/export/starexec/sandbox2/tmp/tmp.RzyjiCQVA1/E---3.1_2395.p',f13) ).

cnf(goal,negated_conjecture,
    mult(x4,mult(op_f,x5)) != mult(mult(x4,op_f),x5),
    file('/export/starexec/sandbox2/tmp/tmp.RzyjiCQVA1/E---3.1_2395.p',goal) ).

cnf(c_0_4,axiom,
    mult(X1,ld(X1,X2)) = X2,
    f01 ).

cnf(c_0_5,axiom,
    mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
    f10 ).

cnf(c_0_6,axiom,
    op_f = mult(X1,mult(X2,ld(mult(X1,X2),op_c))),
    f13 ).

cnf(c_0_7,plain,
    mult(X1,mult(op_c,ld(mult(X1,op_c),X2))) = X2,
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    mult(x4,mult(op_f,x5)) != mult(mult(x4,op_f),x5),
    goal ).

cnf(c_0_9,plain,
    op_f = op_c,
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : GRP704-12 : TPTP v8.1.2. Released v8.1.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n029.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 2400
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Oct  3 03:02:52 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.21/0.49  Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.RzyjiCQVA1/E---3.1_2395.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 2530 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: FUUPM-FFSF22-MFFFFFNN
% 0.21/0.51  # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.21/0.51  # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 2536 completed with status 0
% 0.21/0.51  # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 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: FUUPM-FFSF22-MFFFFFNN
% 0.21/0.51  # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (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 Unsatisfiable
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 14
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 6
% 0.21/0.51  # Initial clauses                      : 8
% 0.21/0.51  # Removed in clause preprocessing      : 0
% 0.21/0.51  # Initial clauses in saturation        : 8
% 0.21/0.51  # Processed clauses                    : 19
% 0.21/0.51  # ...of these trivial                  : 0
% 0.21/0.51  # ...subsumed                          : 0
% 0.21/0.51  # ...remaining for further processing  : 19
% 0.21/0.51  # Other redundant clauses eliminated   : 0
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 0
% 0.21/0.51  # Backward-rewritten                   : 1
% 0.21/0.51  # Generated clauses                    : 77
% 0.21/0.51  # ...of the previous two non-redundant : 65
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 77
% 0.21/0.51  # Factorizations                       : 0
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 0
% 0.21/0.51  # Total rewrite steps                  : 72
% 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  : 10
% 0.21/0.51  #    Positive orientable unit clauses  : 9
% 0.21/0.51  #    Positive unorientable unit clauses: 0
% 0.21/0.51  #    Negative unit clauses             : 1
% 0.21/0.51  #    Non-unit-clauses                  : 0
% 0.21/0.51  # Current number of unprocessed clauses: 61
% 0.21/0.51  # ...number of literals in the above   : 61
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 9
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.51  # Unit Clause-clause subsumption calls : 0
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 1
% 0.21/0.51  # BW rewrite match successes           : 1
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 1316
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.002 s
% 0.21/0.51  # System time              : 0.003 s
% 0.21/0.51  # Total time               : 0.005 s
% 0.21/0.51  # Maximum resident set size: 1616 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.002 s
% 0.21/0.51  # System time              : 0.006 s
% 0.21/0.51  # Total time               : 0.008 s
% 0.21/0.51  # Maximum resident set size: 1676 pages
% 0.21/0.51  % E---3.1 exiting
% 0.21/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------