TSTP Solution File: GRP665-12 by MaedMax---1.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP665-12 : TPTP v8.1.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %d %s

% Computer : n020.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 : 300s
% WCLimit  : 300s
% DateTime : Tue Jul 26 07:03:08 EDT 2022

% Result   : Unsatisfiable 0.19s 0.56s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   6 RR)
%            Number of literals    :   11 (  10 equ;   5 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    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
    A = rd(mult(A,B),B),
    file('/tmp/MaedMax_11798') ).

cnf(eq_1,axiom,
    mult(A,mult(B,C)) = mult(rd(mult(A,B),A),mult(A,C)),
    file('/tmp/MaedMax_11798') ).

cnf(eq_2,axiom,
    mult(A,op_c) = mult(op_c,A),
    file('/tmp/MaedMax_11798') ).

cnf(eq_3,negated_conjecture,
    mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)),
    file('/tmp/MaedMax_11798') ).

cnf(eq_4,plain,
    mult(rd(mult(op_c,A),A),mult(A,x102)) = mult(A,mult(op_c,x102)),
    inference(cp,[status(thm)],[eq_2,eq_1]) ).

cnf(eq_5,plain,
    mult(A,mult(op_c,B)) = mult(op_c,mult(A,B)),
    inference(rw,[status(thm)],[eq_4,eq_0]) ).

cnf(eq_6,negated_conjecture,
    mult(x0,mult(op_c,x1)) != mult(mult(x0,x1),op_c),
    inference(cp,[status(thm)],[eq_2,eq_3]) ).

cnf(eq_7,negated_conjecture,
    mult(mult(x0,x1),op_c) != mult(x0,mult(op_c,x1)),
    eq_6 ).

cnf(eq_8,negated_conjecture,
    mult(op_c,mult(x0,x1)) != mult(x0,mult(op_c,x1)),
    inference(cp,[status(thm)],[eq_2,eq_7]) ).

cnf(eq_9,negated_conjecture,
    mult(x0,mult(op_c,x1)) != mult(x0,mult(op_c,x1)),
    inference(cp,[status(thm)],[eq_5,eq_8]) ).

cnf(bot,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[eq_9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GRP665-12 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13  % Command  : run_maedmax %d %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Jul 26 04:17:39 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.19/0.56  % SZS status Unsatisfiable
% 0.19/0.56  % SZS output start CNFRefutation for /tmp/MaedMax_11798
% See solution above
% 0.19/0.56  
%------------------------------------------------------------------------------