%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP557-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 : 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 : Thu Aug 31 00:21:34 EDT 2023

% Result   : Unsatisfiable 0.23s 0.63s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   27 (  22 unt;   5 typ;   0 def)
%            Number of atoms       :   22 (  21 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   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   :   36 (   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(X1,inverse(divide(divide(X2,X3),divide(X1,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(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
    single_axiom ).

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

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

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

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

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

cnf(c_0_9,plain,
    inverse(divide(divide(X1,X2),X1)) = X2,
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,plain,
    inverse(divide(X1,divide(X2,X2))) = inverse(X1),
    inference(spm,[status(thm)],[c_0_5,c_0_8]) ).

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

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

cnf(c_0_13,plain,
    inverse(divide(divide(X1,X1),X2)) = X2,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).

cnf(c_0_15,plain,
    divide(X1,divide(X1,X2)) = X2,
    inference(spm,[status(thm)],[c_0_3,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    inverse(divide(a1,a1)) != inverse(divide(b1,b1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_8]),c_0_8]) ).

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

cnf(c_0_18,plain,
    divide(X1,divide(X2,X2)) = X1,
    inference(spm,[status(thm)],[c_0_5,c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    divide(a1,a1) != divide(b1,b1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).

cnf(c_0_20,plain,
    divide(X1,X1) = divide(X2,X2),
    inference(spm,[status(thm)],[c_0_15,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_19,c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : GRP557-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.15  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.19/0.37  % Computer : n012.cluster.edu
% 0.19/0.37  % Model    : x86_64 x86_64
% 0.19/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37  % Memory   : 8042.1875MB
% 0.19/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37  % CPULimit   : 300
% 0.19/0.37  % WCLimit    : 300
% 0.19/0.37  % DateTime   : Mon Aug 28 23:40:54 EDT 2023
% 0.19/0.37  % CPUTime  : 
% 0.23/0.61  start to proof: theBenchmark
% 0.23/0.63  % Version  : CSE_E---1.5
% 0.23/0.63  % Problem  : theBenchmark.p
% 0.23/0.63  % Proof found
% 0.23/0.63  % SZS status Theorem for theBenchmark.p
% 0.23/0.63  % SZS output start Proof
% See solution above
% 0.23/0.63  % Total time : 0.006000 s
% 0.23/0.63  % SZS output end Proof
% 0.23/0.63  % Total time : 0.009000 s
%------------------------------------------------------------------------------