TSTP Solution File: GRP756-1 by MaedMax---1.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP756-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %d %s

% Computer : n012.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:16 EDT 2022

% Result   : Unsatisfiable 1.72s 1.94s
% Output   : CNFRefutation 1.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   58 (  58 unt;   0 nHn;   6 RR)
%            Number of literals    :   58 (  57 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  123 (   0 sgn)

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

cnf(eq_1,axiom,
    A = ld(B,mult(B,A)),
    file('/tmp/MaedMax_25837') ).

cnf(eq_2,axiom,
    A = mult(rd(A,B),B),
    file('/tmp/MaedMax_25837') ).

cnf(eq_3,axiom,
    A = rd(mult(A,B),B),
    file('/tmp/MaedMax_25837') ).

cnf(eq_4,axiom,
    mult(A,mult(mult(B,B),C)) = mult(mult(A,B),mult(B,C)),
    file('/tmp/MaedMax_25837') ).

cnf(eq_5,negated_conjecture,
    mult(mult(a,b),c) != mult(a,mult(b,c)),
    file('/tmp/MaedMax_25837') ).

cnf(eq_6,plain,
    ld(mult(A,B),mult(A,mult(mult(B,B),C))) = mult(B,C),
    inference(cp,[status(thm)],[eq_4,eq_1]) ).

cnf(eq_7,plain,
    ld(rd(A,B),A) = B,
    inference(cp,[status(thm)],[eq_2,eq_1]) ).

cnf(eq_8,plain,
    mult(x100,A) = mult(mult(x100,x101),mult(x101,ld(mult(x101,x101),A))),
    inference(cp,[status(thm)],[eq_0,eq_4]) ).

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

cnf(eq_10,plain,
    mult(mult(x100,B),A) = mult(x100,mult(mult(B,B),ld(B,A))),
    inference(cp,[status(thm)],[eq_0,eq_4]) ).

cnf(eq_11,plain,
    mult(A,mult(B,C)) = mult(rd(A,B),mult(mult(B,B),C)),
    eq_9 ).

cnf(eq_12,plain,
    mult(A,B) = mult(mult(A,C),mult(C,ld(mult(C,C),B))),
    eq_8 ).

cnf(eq_13,plain,
    mult(A,mult(mult(B,B),ld(B,C))) = mult(mult(A,B),C),
    eq_10 ).

cnf(eq_14,plain,
    A = ld(rd(B,A),B),
    eq_7 ).

cnf(eq_15,plain,
    ld(mult(A,C),mult(A,B)) = mult(C,ld(mult(C,C),B)),
    inference(cp,[status(thm)],[eq_12,eq_1]) ).

cnf(eq_16,plain,
    ld(A,mult(mult(A,B),C)) = mult(mult(B,B),ld(B,C)),
    inference(cp,[status(thm)],[eq_13,eq_1]) ).

cnf(eq_17,plain,
    mult(rd(x100,x101),A) = mult(x100,mult(x101,ld(mult(x101,x101),A))),
    inference(cp,[status(thm)],[eq_0,eq_11]) ).

cnf(eq_18,plain,
    mult(A,mult(B,ld(mult(B,B),C))) = mult(rd(A,B),C),
    eq_17 ).

cnf(eq_19,plain,
    ld(mult(A,B),mult(A,C)) = mult(B,ld(mult(B,B),C)),
    eq_15 ).

cnf(eq_20,negated_conjecture,
    mult(a,mult(mult(b,b),ld(b,c))) != mult(a,mult(b,c)),
    inference(cp,[status(thm)],[eq_13,eq_5]) ).

cnf(eq_21,plain,
    A = mult(A,mult(B,ld(mult(B,B),B))),
    inference(cp,[status(thm)],[eq_2,eq_18]) ).

cnf(eq_22,plain,
    ld(A,A) = mult(B,ld(mult(B,B),B)),
    inference(cp,[status(thm)],[eq_21,eq_1]) ).

cnf(eq_23,plain,
    ld(mult(x100,B),mult(x100,ld(A,mult(mult(A,B),C)))) = mult(B,ld(B,C)),
    inference(cp,[status(thm)],[eq_16,eq_6]) ).

cnf(eq_24,plain,
    mult(x100,ld(mult(A,C),mult(A,C))) = x100,
    inference(cp,[status(thm)],[eq_19,eq_21]) ).

cnf(eq_25,plain,
    mult(rd(x100,x101),mult(x101,x101)) = mult(x100,mult(x101,mult(B,ld(mult(B,B),B)))),
    inference(cp,[status(thm)],[eq_21,eq_11]) ).

cnf(eq_26,plain,
    A = mult(A,ld(mult(B,C),mult(B,C))),
    eq_24 ).

cnf(eq_27,plain,
    A = ld(mult(B,C),mult(B,ld(x3,mult(mult(x3,C),A)))),
    inference(rw,[status(thm)],[eq_23,eq_0]) ).

cnf(eq_28,plain,
    mult(A,B) = mult(rd(A,B),mult(B,B)),
    inference(rw,[status(thm)],[eq_25,eq_21]) ).

cnf(eq_29,negated_conjecture,
    mult(a,ld(A,mult(mult(A,b),c))) != mult(a,mult(b,c)),
    inference(cp,[status(thm)],[eq_16,eq_20]) ).

cnf(eq_30,plain,
    ld(B,ld(A,A)) = ld(mult(B,B),B),
    inference(cp,[status(thm)],[eq_22,eq_1]) ).

cnf(eq_31,plain,
    mult(x100,ld(A,mult(B,ld(B,A)))) = x100,
    inference(cp,[status(thm)],[eq_0,eq_26]) ).

cnf(eq_32,plain,
    rd(ld(A,A),ld(mult(B,B),B)) = B,
    inference(cp,[status(thm)],[eq_22,eq_3]) ).

cnf(eq_33,plain,
    A = mult(A,ld(B,B)),
    inference(rw,[status(thm)],[eq_31,eq_0]) ).

cnf(eq_34,plain,
    ld(A,ld(B,B)) = ld(mult(A,A),A),
    eq_30 ).

cnf(eq_35,plain,
    A = rd(ld(B,B),ld(mult(A,A),A)),
    eq_32 ).

cnf(eq_36,plain,
    ld(x100,mult(x100,x101)) = mult(mult(x101,x101),ld(x101,ld(B,B))),
    inference(cp,[status(thm)],[eq_33,eq_16]) ).

cnf(eq_37,plain,
    A = mult(mult(A,A),ld(A,ld(B,B))),
    inference(rw,[status(thm)],[eq_36,eq_1]) ).

cnf(eq_38,plain,
    ld(A,ld(B,B)) = ld(A,ld(x101,x101)),
    inference(cp,[status(thm)],[eq_34,eq_34]) ).

cnf(eq_39,plain,
    ld(A,ld(B,B)) = ld(A,ld(C,C)),
    eq_38 ).

cnf(eq_40,plain,
    ld(rd(ld(C,C),x101),ld(B,B)) = x101,
    inference(cp,[status(thm)],[eq_39,eq_14]) ).

cnf(eq_41,plain,
    rd(ld(x100,x100),ld(A,ld(B,B))) = A,
    inference(cp,[status(thm)],[eq_34,eq_35]) ).

cnf(eq_42,plain,
    A = rd(ld(B,B),ld(A,ld(C,C))),
    eq_41 ).

cnf(eq_43,plain,
    A = ld(rd(ld(B,B),A),ld(C,C)),
    eq_40 ).

cnf(eq_44,plain,
    rd(ld(x100,x100),A) = rd(ld(B,B),A),
    inference(cp,[status(thm)],[eq_43,eq_42]) ).

cnf(eq_45,plain,
    rd(ld(A,A),B) = rd(ld(C,C),B),
    eq_44 ).

cnf(eq_46,plain,
    mult(rd(ld(C,C),B),mult(B,B)) = mult(ld(A,A),B),
    inference(cp,[status(thm)],[eq_45,eq_28]) ).

cnf(eq_47,plain,
    mult(ld(A,A),B) = mult(ld(C,C),B),
    inference(rw,[status(thm)],[eq_46,eq_28]) ).

cnf(eq_48,plain,
    ld(ld(C,C),mult(ld(A,A),B)) = B,
    inference(cp,[status(thm)],[eq_47,eq_1]) ).

cnf(eq_49,plain,
    ld(mult(x100,A),mult(x100,ld(A,A))) = ld(A,ld(B,B)),
    inference(cp,[status(thm)],[eq_37,eq_27]) ).

cnf(eq_50,plain,
    A = ld(ld(B,B),mult(ld(C,C),A)),
    eq_48 ).

cnf(eq_51,plain,
    ld(A,ld(B,B)) = ld(mult(C,A),C),
    inference(rw,[status(thm)],[eq_49,eq_33]) ).

cnf(eq_52,plain,
    rd(ld(x100,x100),ld(A,ld(B,B))) = mult(ld(x102,x102),A),
    inference(cp,[status(thm)],[eq_51,eq_42]) ).

cnf(eq_53,plain,
    A = mult(ld(B,B),A),
    inference(rw,[status(thm)],[eq_52,eq_42]) ).

cnf(eq_54,plain,
    A = ld(ld(B,B),A),
    inference(rw,[status(thm)],[eq_50,eq_53]) ).

cnf(eq_55,negated_conjecture,
    mult(a,mult(mult(ld(B,B),b),c)) != mult(a,mult(b,c)),
    inference(cp,[status(thm)],[eq_54,eq_29]) ).

cnf(eq_56,negated_conjecture,
    mult(a,mult(b,c)) != mult(a,mult(b,c)),
    inference(rw,[status(thm)],[eq_55,eq_53]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : GRP756-1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n012.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue Jul 26 04:19:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.72/1.94  % SZS status Unsatisfiable
% 1.72/1.94  % SZS output start CNFRefutation for /tmp/MaedMax_25837
% See solution above
% 1.72/1.94  
%------------------------------------------------------------------------------