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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP472-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 : n006.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:26 EDT 2023

% Result   : Unsatisfiable 0.19s 0.64s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   41 (  36 unt;   5 typ;   0 def)
%            Number of atoms       :   36 (  35 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  131 (   0 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

cnf(single_axiom,axiom,
    divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
    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(multiply,axiom,
    multiply(X1,X2) = divide(X1,inverse(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

cnf(c_0_3,axiom,
    divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
    single_axiom ).

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

cnf(c_0_5,plain,
    divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(divide(X5,X6),X4))))) = divide(X5,X6),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]) ).

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

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

cnf(c_0_8,plain,
    divide(divide(X1,inverse(divide(divide(inverse(X2),X3),X4))),divide(inverse(X3),X4)) = divide(divide(X1,X5),inverse(divide(X5,X2))),
    inference(spm,[status(thm)],[c_0_7,c_0_7]) ).

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

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

cnf(c_0_11,plain,
    divide(divide(X1,X2),inverse(divide(X2,X3))) = divide(divide(X1,X4),inverse(divide(X4,X3))),
    inference(spm,[status(thm)],[c_0_8,c_0_8]) ).

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

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

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

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

cnf(c_0_16,plain,
    divide(divide(divide(X1,X2),X3),inverse(divide(X3,divide(divide(X4,X5),divide(X2,X1))))) = divide(X5,X4),
    inference(spm,[status(thm)],[c_0_4,c_0_13]) ).

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

cnf(c_0_18,plain,
    divide(inverse(divide(X1,divide(divide(X2,X3),divide(X4,X5)))),divide(divide(X5,X4),X1)) = divide(X2,X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_16]),c_0_4]) ).

cnf(c_0_19,plain,
    inverse(divide(inverse(X1),divide(X2,X1))) = divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)),
    inference(spm,[status(thm)],[c_0_17,c_0_3]) ).

cnf(c_0_20,plain,
    divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
    inference(spm,[status(thm)],[c_0_18,c_0_9]) ).

cnf(c_0_21,plain,
    inverse(divide(inverse(X1),divide(X2,X1))) = inverse(divide(inverse(X3),divide(X2,X3))),
    inference(spm,[status(thm)],[c_0_19,c_0_19]) ).

cnf(c_0_22,plain,
    divide(inverse(divide(inverse(X1),divide(X2,X1))),divide(divide(X3,X4),inverse(divide(X4,X3)))) = X2,
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,plain,
    divide(inverse(divide(X1,X2)),divide(divide(X3,divide(X4,X5)),X1)) = inverse(divide(X3,divide(X2,divide(X5,X4)))),
    inference(spm,[status(thm)],[c_0_20,c_0_20]) ).

cnf(c_0_24,plain,
    inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),X1)),divide(X4,X3)))) = X2,
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

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

cnf(c_0_26,plain,
    inverse(inverse(divide(X1,divide(X2,inverse(divide(inverse(a1),divide(X2,a1))))))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23]),c_0_19]) ).

cnf(c_0_27,plain,
    inverse(inverse(divide(X1,divide(X2,inverse(divide(inverse(X3),divide(X2,X3))))))) = X1,
    inference(spm,[status(thm)],[c_0_26,c_0_21]) ).

cnf(c_0_28,plain,
    inverse(inverse(divide(X1,divide(inverse(divide(X2,X3)),divide(X3,X2))))) = X1,
    inference(spm,[status(thm)],[c_0_27,c_0_16]) ).

cnf(c_0_29,plain,
    inverse(inverse(divide(inverse(X1),divide(inverse(divide(X2,X3)),X1)))) = inverse(divide(X3,X2)),
    inference(spm,[status(thm)],[c_0_28,c_0_21]) ).

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

cnf(c_0_31,axiom,
    multiply(X1,X2) = divide(X1,inverse(X2)),
    multiply ).

cnf(c_0_32,plain,
    inverse(divide(divide(X1,X2),inverse(X2))) = inverse(divide(divide(X1,X3),inverse(X3))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_31]) ).

cnf(c_0_34,plain,
    divide(inverse(X1),inverse(X1)) = divide(inverse(X2),inverse(X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_32]),c_0_17]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : GRP472-1 : TPTP v8.1.2. Released v2.6.0.
% 0.13/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n006.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 22:29:21 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.64  % Version  : CSE_E---1.5
% 0.19/0.64  % Problem  : theBenchmark.p
% 0.19/0.64  % Proof found
% 0.19/0.64  % SZS status Theorem for theBenchmark.p
% 0.19/0.64  % SZS output start Proof
% See solution above
% 0.19/0.64  % Total time : 0.069000 s
% 0.19/0.64  % SZS output end Proof
% 0.19/0.64  % Total time : 0.072000 s
%------------------------------------------------------------------------------