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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP442-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %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 : Thu Aug 31 00:20:19 EDT 2023

% Result   : Unsatisfiable 0.57s 0.69s
% Output   : CNFRefutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   42 (  38 unt;   4 typ;   0 def)
%            Number of atoms       :   38 (  37 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    :   12 (   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  103 (   0 sgn;   0   !;   0   ?;   0   :)

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

tff(decl_23,type,
    multiply: ( $i * $i ) > $i ).

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

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

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

cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).

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

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

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

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

cnf(c_0_6,plain,
    multiply(multiply(a1,inverse(a1)),inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,X2)))) = X3,
    inference(rw,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,plain,
    multiply(multiply(a1,inverse(a1)),X1) = multiply(multiply(X2,inverse(X2)),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_3]),c_0_2]) ).

cnf(c_0_8,plain,
    multiply(a1,inverse(a1)) = multiply(X1,inverse(X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_2]) ).

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

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

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

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

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

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

cnf(c_0_15,plain,
    multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(a1,inverse(a1)))),multiply(X3,inverse(X3))))) = inverse(inverse(X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).

cnf(c_0_16,plain,
    inverse(multiply(inverse(X1),multiply(inverse(inverse(X2)),multiply(multiply(X3,inverse(X3)),inverse(multiply(X2,multiply(a1,inverse(a1)))))))) = X1,
    inference(spm,[status(thm)],[c_0_3,c_0_15]) ).

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

cnf(c_0_18,plain,
    inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(a1,multiply(X2,inverse(X2)))))),inverse(inverse(a1))))) = X1,
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,plain,
    inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(X2,multiply(a1,inverse(a1)))))),inverse(inverse(X2))))) = X1,
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_20,plain,
    multiply(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(a1,multiply(X2,inverse(X2)))))),inverse(inverse(a1)))),X1) = multiply(a1,inverse(a1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_18]),c_0_14]) ).

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

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

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

cnf(c_0_24,plain,
    multiply(X1,multiply(inverse(X1),inverse(multiply(a1,inverse(a1))))) = multiply(a1,inverse(a1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_23]),c_0_16]) ).

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

cnf(c_0_26,plain,
    multiply(inverse(X1),inverse(multiply(a1,inverse(a1)))) = inverse(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_24]),c_0_17]) ).

cnf(c_0_27,plain,
    inverse(multiply(multiply(multiply(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2)))))),X4),inverse(multiply(X5,multiply(X6,X7)))),multiply(multiply(multiply(X8,inverse(X8)),X5),multiply(multiply(X9,inverse(X9)),X6)))) = X7,
    inference(spm,[status(thm)],[c_0_3,c_0_25]) ).

cnf(c_0_28,plain,
    multiply(X1,inverse(multiply(a1,inverse(a1)))) = X1,
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_29,plain,
    multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
    inference(spm,[status(thm)],[c_0_28,c_0_9]) ).

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

cnf(c_0_31,plain,
    inverse(multiply(X1,inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = multiply(inverse(X1),inverse(inverse(inverse(multiply(a1,inverse(a1)))))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_30]),c_0_29]) ).

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

cnf(c_0_33,plain,
    multiply(X1,multiply(inverse(X1),inverse(inverse(X2)))) = multiply(X2,multiply(a1,inverse(a1))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_14]) ).

cnf(c_0_34,plain,
    multiply(inverse(X1),X1) = multiply(inverse(multiply(a1,inverse(a1))),multiply(a1,inverse(a1))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_33]) ).

cnf(c_0_35,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    prove_these_axioms_1 ).

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

cnf(c_0_37,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_35,c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GRP442-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %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.34  % DateTime   : Mon Aug 28 21:24:43 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.21/0.57  start to proof: theBenchmark
% 0.57/0.69  % Version  : CSE_E---1.5
% 0.57/0.69  % Problem  : theBenchmark.p
% 0.57/0.69  % Proof found
% 0.57/0.69  % SZS status Theorem for theBenchmark.p
% 0.57/0.69  % SZS output start Proof
% See solution above
% 0.57/0.70  % Total time : 0.119000 s
% 0.57/0.70  % SZS output end Proof
% 0.57/0.70  % Total time : 0.122000 s
%------------------------------------------------------------------------------