TSTP Solution File: GRP665-10 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n015.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:50:00 EDT 2023

% Result   : Timeout 0.42s 300.15s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   3 RR)
%            Number of literals    :   11 (  10 equ;   2 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   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(f08,axiom,
    mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
    file('/export/starexec/sandbox2/tmp/tmp.ZLb1h9A1p8/E---3.1_22004.p',f08) ).

cnf(f09,axiom,
    mult(op_c,X1) = mult(X1,op_c),
    file('/export/starexec/sandbox2/tmp/tmp.ZLb1h9A1p8/E---3.1_22004.p',f09) ).

cnf(f02,axiom,
    ld(X1,mult(X1,X2)) = X2,
    file('/export/starexec/sandbox2/tmp/tmp.ZLb1h9A1p8/E---3.1_22004.p',f02) ).

cnf(goal,negated_conjecture,
    mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
    file('/export/starexec/sandbox2/tmp/tmp.ZLb1h9A1p8/E---3.1_22004.p',goal) ).

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

cnf(c_0_5,axiom,
    mult(op_c,X1) = mult(X1,op_c),
    f09 ).

cnf(c_0_6,axiom,
    ld(X1,mult(X1,X2)) = X2,
    f02 ).

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

cnf(c_0_8,negated_conjecture,
    mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
    goal ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : GRP665-10 : TPTP v8.1.2. Released v8.1.0.
% 0.08/0.14  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n015.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   : Tue Oct  3 02:44:46 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.23/0.50  Running first-order model finding
% 0.23/0.50  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.ZLb1h9A1p8/E---3.1_22004.p
% 0.42/300.15  # Version: 3.1pre001
% 0.42/300.15  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.42/300.15  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.15  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.42/300.15  # Starting new_bool_3 with 300s (1) cores
% 0.42/300.15  # Starting new_bool_1 with 300s (1) cores
% 0.42/300.15  # Starting sh5l with 300s (1) cores
% 0.42/300.15  # sh5l with pid 22086 completed with status 0
% 0.42/300.15  # Result found by sh5l
% 0.42/300.15  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.42/300.15  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.15  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.42/300.15  # Starting new_bool_3 with 300s (1) cores
% 0.42/300.15  # Starting new_bool_1 with 300s (1) cores
% 0.42/300.15  # Starting sh5l with 300s (1) cores
% 0.42/300.15  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.42/300.15  # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.42/300.15  # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.42/300.15  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.42/300.15  # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 22097 completed with status 0
% 0.42/300.15  # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.42/300.15  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.42/300.15  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.15  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.42/300.15  # Starting new_bool_3 with 300s (1) cores
% 0.42/300.15  # Starting new_bool_1 with 300s (1) cores
% 0.42/300.15  # Starting sh5l with 300s (1) cores
% 0.42/300.15  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.42/300.15  # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.42/300.15  # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.42/300.15  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.42/300.15  # Preprocessing time       : 0.001 s
% 0.42/300.15  # Presaturation interreduction done
% 0.42/300.15  
% 0.42/300.15  # Proof found!
% 0.42/300.15  # SZS status Unsatisfiable
% 0.42/300.15  # SZS output start CNFRefutation
% See solution above
% 0.42/300.15  # Parsed axioms                        : 10
% 0.42/300.15  # Removed by relevancy pruning/SinE    : 0
% 0.42/300.15  # Initial clauses                      : 10
% 0.42/300.15  # Removed in clause preprocessing      : 0
% 0.42/300.15  # Initial clauses in saturation        : 10
% 0.42/300.15  # Processed clauses                    : 70
% 0.42/300.15  # ...of these trivial                  : 6
% 0.42/300.15  # ...subsumed                          : 22
% 0.42/300.15  # ...remaining for further processing  : 42
% 0.42/300.15  # Other redundant clauses eliminated   : 0
% 0.42/300.15  # Clauses deleted for lack of memory   : 0
% 0.42/300.15  # Backward-subsumed                    : 0
% 0.42/300.15  # Backward-rewritten                   : 4
% 0.42/300.15  # Generated clauses                    : 395
% 0.42/300.15  # ...of the previous two non-redundant : 261
% 0.42/300.15  # ...aggressively subsumed             : 0
% 0.42/300.15  # Contextual simplify-reflections      : 0
% 0.42/300.15  # Paramodulations                      : 395
% 0.42/300.15  # Factorizations                       : 0
% 0.42/300.15  # NegExts                              : 0
% 0.42/300.15  # Equation resolutions                 : 0
% 0.42/300.15  # Total rewrite steps                  : 365
% 0.42/300.15  # Propositional unsat checks           : 0
% 0.42/300.15  #    Propositional check models        : 0
% 0.42/300.15  #    Propositional check unsatisfiable : 0
% 0.42/300.15  #    Propositional clauses             : 0
% 0.42/300.15  #    Propositional clauses after purity: 0
% 0.42/300.15  #    Propositional unsat core size     : 0
% 0.42/300.15  #    Propositional preprocessing time  : 0.000
% 0.42/300.15  #    Propositional encoding time       : 0.000
% 0.42/300.15  #    Propositional solver time         : 0.000
% 0.42/300.15  #    Success case prop preproc time    : 0.000
% 0.42/300.15  #    Success case prop encoding time   : 0.000
% 0.42/300.15  #    Success case prop solver time     : 0.000
% 0.42/300.15  # Current number of processed clauses  : 28
% 0.42/300.15  #    Positive orientable unit clauses  : 25
% 0.42/300.15  #    Positive unorientable unit clauses: 3
% 0.42/300.15  #    Negative unit clauses             : 0
% 0.42/300.15  #    Non-unit-clauses                  : 0
% 0.42/300.15  # Current number of unprocessed clauses: 207
% 0.42/300.15  # ...number of literals in the above   : 207
% 0.42/300.15  # Current number of archived formulas  : 0
% 0.42/300.15  # Current number of archived clauses   : 14
% 0.42/300.15  # Clause-clause subsumption calls (NU) : 0
% 0.42/300.15  # Rec. Clause-clause subsumption calls : 0
% 0.42/300.15  # Non-unit clause-clause subsumptions  : 0
% 0.42/300.15  # Unit Clause-clause subsumption calls : 0
% 0.42/300.15  # Rewrite failures with RHS unbound    : 0
% 0.42/300.15  # BW rewrite match attempts            : 11
% 0.42/300.15  # BW rewrite match successes           : 5
% 0.42/300.15  # Condensation attempts                : 0
% 0.42/300.15  # Condensation successes               : 0
% 0.42/300.15  # Termbank termtop insertions          : 4912
% 0.42/300.15  
% 0.42/300.15  # -------------------------------------------------
% 0.42/300.15  # User time                : 0.006 s
% 0.42/300.15  # System time              : 0.001 s
% 0.42/300.15  # Total time               : 0.007 s
% 0.42/300.15  # Maximum resident set size: 1424 pages
% 0.42/300.15  
% 0.42/300.15  # -------------------------------------------------
% 0.42/300.15  # User time                : 0.007 s
% 0.42/300.15  # System time              : 0.003 s
% 0.42/300.15  # Total time               : 0.010 s
% 0.42/300.15  # Maximum resident set size: 1672 pages
% 0.42/300.15  % E---3.1 exiting
%------------------------------------------------------------------------------