TSTP Solution File: GRP435-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP435-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n007.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 : Thu Aug 31 00:20:16 EDT 2023

% Result   : Unsatisfiable 0.63s 0.72s
% Output   : CNFRefutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   49 (  44 unt;   5 typ;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :   10 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            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   :  104 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    multiply: ( $i * $i ) > $i ).

tff(decl_23,type,
    inverse: $i > $i ).

tff(decl_24,type,
    a3: $i ).

tff(decl_25,type,
    b3: $i ).

tff(decl_26,type,
    c3: $i ).

cnf(single_axiom,axiom,
    inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

cnf(prove_these_axioms_3,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).

cnf(c_0_2,axiom,
    inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
    single_axiom ).

cnf(c_0_3,plain,
    inverse(multiply(multiply(multiply(X1,multiply(inverse(multiply(multiply(X2,X3),X1)),X2)),X3),multiply(X4,inverse(X4)))) = multiply(X5,inverse(X5)),
    inference(spm,[status(thm)],[c_0_2,c_0_2]) ).

cnf(c_0_4,plain,
    multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
    inference(spm,[status(thm)],[c_0_3,c_0_3]) ).

cnf(c_0_5,plain,
    inverse(multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),X3),multiply(X4,inverse(X4)))) = inverse(multiply(X2,X3)),
    inference(spm,[status(thm)],[c_0_2,c_0_4]) ).

cnf(c_0_6,plain,
    inverse(multiply(multiply(inverse(multiply(multiply(X1,X2),inverse(multiply(X3,inverse(X3))))),X1),X2)) = multiply(X4,inverse(X4)),
    inference(spm,[status(thm)],[c_0_3,c_0_5]) ).

cnf(c_0_7,plain,
    inverse(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(X2))) = multiply(X3,inverse(X3)),
    inference(spm,[status(thm)],[c_0_6,c_0_4]) ).

cnf(c_0_8,plain,
    multiply(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4))),X3) = multiply(a3,inverse(a3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_2]),c_0_3]) ).

cnf(c_0_9,plain,
    multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(X2)),multiply(X3,inverse(X3))) = multiply(X4,inverse(X4)),
    inference(spm,[status(thm)],[c_0_4,c_0_7]) ).

cnf(c_0_10,plain,
    multiply(multiply(multiply(multiply(inverse(multiply(multiply(a3,inverse(a3)),X1)),X2),inverse(X2)),multiply(X3,inverse(X3))),X1) = multiply(a3,inverse(a3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).

cnf(c_0_11,plain,
    inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,inverse(X1)),X2)),X3),inverse(X3)),multiply(X4,inverse(X4)))) = X2,
    inference(spm,[status(thm)],[c_0_2,c_0_4]) ).

cnf(c_0_12,plain,
    inverse(multiply(multiply(multiply(inverse(multiply(X1,X2)),multiply(inverse(multiply(a3,inverse(a3))),X1)),X2),multiply(X3,inverse(X3)))) = multiply(X4,inverse(X4)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_3]) ).

cnf(c_0_13,plain,
    multiply(multiply(multiply(multiply(a3,inverse(a3)),inverse(inverse(inverse(multiply(multiply(a3,inverse(a3)),X1))))),multiply(X2,inverse(X2))),X1) = multiply(a3,inverse(a3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_6]) ).

cnf(c_0_14,plain,
    multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))) = multiply(a3,inverse(a3)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_15,plain,
    multiply(X1,inverse(X1)) = inverse(multiply(inverse(multiply(a3,inverse(a3))),multiply(X2,inverse(X2)))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    inverse(multiply(multiply(multiply(a3,inverse(a3)),inverse(inverse(inverse(multiply(multiply(a3,inverse(a3)),X1))))),multiply(X2,inverse(X2)))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_13]),c_0_5]) ).

cnf(c_0_17,plain,
    inverse(multiply(multiply(multiply(a3,inverse(a3)),X1),multiply(X2,inverse(X2)))) = inverse(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_14]) ).

cnf(c_0_18,plain,
    multiply(X1,inverse(X1)) = inverse(multiply(inverse(multiply(X2,inverse(X2))),multiply(X3,inverse(X3)))),
    inference(spm,[status(thm)],[c_0_15,c_0_4]) ).

cnf(c_0_19,plain,
    inverse(multiply(multiply(X1,inverse(X1)),inverse(inverse(inverse(multiply(X2,inverse(X2))))))) = multiply(X3,inverse(X3)),
    inference(spm,[status(thm)],[c_0_7,c_0_4]) ).

cnf(c_0_20,plain,
    inverse(inverse(inverse(inverse(multiply(multiply(a3,inverse(a3)),X1))))) = X1,
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    multiply(multiply(multiply(X1,inverse(X1)),inverse(inverse(inverse(multiply(X2,inverse(X2)))))),multiply(X3,inverse(X3))) = multiply(a3,inverse(a3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_18]) ).

cnf(c_0_22,plain,
    inverse(inverse(inverse(inverse(multiply(multiply(X1,inverse(X1)),X2))))) = X2,
    inference(spm,[status(thm)],[c_0_20,c_0_4]) ).

cnf(c_0_23,plain,
    inverse(inverse(inverse(inverse(multiply(X1,inverse(X1)))))) = inverse(multiply(a3,inverse(a3))),
    inference(spm,[status(thm)],[c_0_17,c_0_21]) ).

cnf(c_0_24,plain,
    inverse(inverse(multiply(a3,inverse(a3)))) = multiply(X1,inverse(X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]) ).

cnf(c_0_25,plain,
    inverse(inverse(multiply(X1,inverse(X1)))) = inverse(multiply(a3,inverse(a3))),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,plain,
    inverse(multiply(a3,inverse(a3))) = multiply(X1,inverse(X1)),
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,plain,
    inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(X3,inverse(X3)))) = inverse(X2),
    inference(spm,[status(thm)],[c_0_17,c_0_4]) ).

cnf(c_0_28,plain,
    inverse(multiply(X1,inverse(X1))) = multiply(a3,inverse(a3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_23]),c_0_26]),c_0_26]) ).

cnf(c_0_29,plain,
    inverse(multiply(multiply(a3,inverse(a3)),X1)) = inverse(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_27]),c_0_28]),c_0_28]) ).

cnf(c_0_30,plain,
    inverse(inverse(inverse(inverse(X1)))) = X1,
    inference(spm,[status(thm)],[c_0_22,c_0_29]) ).

cnf(c_0_31,plain,
    multiply(multiply(X1,inverse(X1)),X2) = X2,
    inference(rw,[status(thm)],[c_0_22,c_0_30]) ).

cnf(c_0_32,plain,
    multiply(multiply(a3,inverse(a3)),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_30]) ).

cnf(c_0_33,plain,
    inverse(multiply(X1,multiply(X2,inverse(X2)))) = inverse(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_31]),c_0_28]),c_0_32]) ).

cnf(c_0_34,plain,
    inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(multiply(multiply(multiply(inverse(multiply(multiply(X4,X5),X6)),X4),X5),multiply(X7,inverse(X7))),X6))) = X3,
    inference(spm,[status(thm)],[c_0_2,c_0_2]) ).

cnf(c_0_35,plain,
    multiply(X1,multiply(X2,inverse(X2))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_30]) ).

cnf(c_0_36,plain,
    inverse(multiply(inverse(multiply(X1,X2)),X1)) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]),c_0_8]),c_0_35]) ).

cnf(c_0_37,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_35]) ).

cnf(c_0_38,plain,
    multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
    inference(spm,[status(thm)],[c_0_37,c_0_36]) ).

cnf(c_0_39,plain,
    multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_38]),c_0_37]) ).

cnf(c_0_40,plain,
    inverse(multiply(multiply(X1,X2),X3)) = inverse(multiply(X1,multiply(X2,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_39]),c_0_37]),c_0_8]),c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    prove_these_axioms_3 ).

cnf(c_0_42,plain,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_37]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : GRP435-1 : TPTP v8.1.2. Released v2.6.0.
% 0.04/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n007.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Aug 28 23:00:43 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.59/0.64  start to proof: theBenchmark
% 0.63/0.72  % Version  : CSE_E---1.5
% 0.63/0.72  % Problem  : theBenchmark.p
% 0.63/0.72  % Proof found
% 0.63/0.72  % SZS status Theorem for theBenchmark.p
% 0.63/0.72  % SZS output start Proof
% See solution above
% 0.63/0.72  % Total time : 0.070000 s
% 0.63/0.72  % SZS output end Proof
% 0.63/0.72  % Total time : 0.072000 s
%------------------------------------------------------------------------------