%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN332-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n014.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 : Fri Sep  1 01:51:10 EDT 2023

% Result   : Unsatisfiable 0.21s 0.60s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   24 (   4 unt;   2 typ;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   44 (  20   ~;  24   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   39 (   2 sgn;   0   !;   0   ?;   0   :)

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

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

cnf(clause13,negated_conjecture,
    ( f(X1,X2)
    | f(X2,X1)
    | ~ f(z(X1,X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).

cnf(clause5,negated_conjecture,
    ( f(z(X1,X2),X1)
    | ~ f(X1,z(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

cnf(clause1,negated_conjecture,
    ( f(X1,X2)
    | f(X1,z(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

cnf(clause8,negated_conjecture,
    ( f(X2,X1)
    | ~ f(X1,X2)
    | ~ f(z(X2,X1),z(X2,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

cnf(clause7,negated_conjecture,
    ( f(X2,z(X1,X2))
    | ~ f(X1,z(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).

cnf(clause2,negated_conjecture,
    ( f(X1,X2)
    | f(X2,z(X2,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

cnf(clause14,negated_conjecture,
    ( ~ f(X1,X2)
    | ~ f(X2,X1)
    | ~ f(z(X1,X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).

cnf(c_0_7,negated_conjecture,
    ( f(X1,X2)
    | f(X2,X1)
    | ~ f(z(X1,X2),X2) ),
    clause13 ).

cnf(c_0_8,negated_conjecture,
    ( f(z(X1,X2),X1)
    | ~ f(X1,z(X1,X2)) ),
    clause5 ).

cnf(c_0_9,negated_conjecture,
    ( f(X1,X2)
    | f(X1,z(X1,X2)) ),
    clause1 ).

cnf(c_0_10,negated_conjecture,
    ( f(X2,X1)
    | ~ f(X1,X2)
    | ~ f(z(X2,X1),z(X2,X1)) ),
    clause8 ).

cnf(c_0_11,negated_conjecture,
    f(X1,X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( f(X2,z(X1,X2))
    | ~ f(X1,z(X1,X2)) ),
    clause7 ).

cnf(c_0_13,negated_conjecture,
    ( f(X1,X2)
    | f(X2,z(X2,X1)) ),
    clause2 ).

cnf(c_0_14,negated_conjecture,
    ( ~ f(X1,X2)
    | ~ f(X2,X1)
    | ~ f(z(X1,X2),X2) ),
    clause14 ).

cnf(c_0_15,negated_conjecture,
    ( f(X1,X2)
    | ~ f(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_16,negated_conjecture,
    ( f(X1,z(X2,X1))
    | f(X1,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ f(X1,z(X1,X1))
    | ~ f(X1,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_8]) ).

cnf(c_0_18,negated_conjecture,
    ( f(z(X1,X2),X2)
    | f(X2,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ~ f(X1,z(X1,X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_11])]) ).

cnf(c_0_20,negated_conjecture,
    f(X1,X2),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_18]),c_0_15]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYN332-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n014.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   : Sat Aug 26 20:00:47 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.58  start to proof: theBenchmark
% 0.21/0.60  % Version  : CSE_E---1.5
% 0.21/0.60  % Problem  : theBenchmark.p
% 0.21/0.60  % Proof found
% 0.21/0.60  % SZS status Theorem for theBenchmark.p
% 0.21/0.60  % SZS output start Proof
% See solution above
% 0.21/0.60  % Total time : 0.005000 s
% 0.21/0.60  % SZS output end Proof
% 0.21/0.60  % Total time : 0.008000 s
%------------------------------------------------------------------------------