%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : HWV052-1.001.001 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n018.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 02:00:40 EDT 2023

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

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

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

tff(decl_24,type,
    inv: $i > $i ).

tff(decl_25,type,
    pack1: $i > $i ).

tff(decl_26,type,
    unpack1: ( $i * $i ) > $i ).

cnf(bit_inverse,axiom,
    inv(X1) != X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_inverse) ).

cnf(bit_domain,axiom,
    ( X1 = o
    | X1 = i ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_domain) ).

cnf(unpack1_01,axiom,
    unpack1(inv(X1),pack1(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_01) ).

cnf(unpack1,axiom,
    unpack1(X1,pack1(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1) ).

cnf(unpack1_02,axiom,
    unpack1(X1,inv(pack1(X1))) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_02) ).

cnf(c_0_5,axiom,
    inv(X1) != X1,
    bit_inverse ).

cnf(c_0_6,axiom,
    ( X1 = o
    | X1 = i ),
    bit_domain ).

cnf(c_0_7,axiom,
    unpack1(inv(X1),pack1(X1)) = X1,
    unpack1_01 ).

cnf(c_0_8,plain,
    inv(i) = o,
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6])]) ).

cnf(c_0_9,plain,
    unpack1(o,pack1(i)) = i,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    unpack1(X1,pack1(X1)) = X1,
    unpack1 ).

cnf(c_0_11,plain,
    ( unpack1(o,i) = i
    | pack1(i) = o ),
    inference(spm,[status(thm)],[c_0_9,c_0_6]) ).

cnf(c_0_12,plain,
    ( unpack1(X1,i) = X1
    | pack1(X1) = o ),
    inference(spm,[status(thm)],[c_0_10,c_0_6]) ).

cnf(c_0_13,plain,
    i != o,
    inference(spm,[status(thm)],[c_0_5,c_0_8]) ).

cnf(c_0_14,axiom,
    unpack1(X1,inv(pack1(X1))) = X1,
    unpack1_02 ).

cnf(c_0_15,plain,
    ( pack1(o) = o
    | pack1(i) = o ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_16,plain,
    ( unpack1(X1,o) = X1
    | pack1(X1) = o ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_6]),c_0_8]) ).

cnf(c_0_17,plain,
    ( unpack1(o,o) = i
    | pack1(o) = o ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_8]) ).

cnf(c_0_18,plain,
    pack1(o) = o,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13]) ).

cnf(c_0_19,plain,
    unpack1(inv(o),o) = o,
    inference(spm,[status(thm)],[c_0_7,c_0_18]) ).

cnf(c_0_20,plain,
    pack1(inv(o)) = o,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_5]) ).

cnf(c_0_21,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_20]),c_0_19]),c_0_5]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12  % Problem    : HWV052-1.001.001 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 29 16:00:48 EDT 2023
% 0.20/0.35  % CPUTime  : 
% 0.20/0.58  start to proof: theBenchmark
% 0.20/0.60  % Version  : CSE_E---1.5
% 0.20/0.60  % Problem  : theBenchmark.p
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark.p
% 0.20/0.60  % SZS output start Proof
% See solution above
% 0.20/0.60  % Total time : 0.006000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.008000 s
%------------------------------------------------------------------------------