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

% Computer : n009.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:48:40 EDT 2023

% Result   : Unsatisfiable 0.51s 0.57s
% Output   : CNFRefutation 0.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   11 (   4 unt;   3 typ;   0 def)
%            Number of atoms       :   18 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   22 (  12   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   14 (   6 sgn;   0   !;   0   ?;   0   :)

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

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

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

cnf(clause2,axiom,
    ( q(X1,X2)
    | ~ p(f(X1,X2),f(X1,X2))
    | ~ p(X2,f(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

cnf(clause1,axiom,
    p(X1,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

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

cnf(c_0_3,axiom,
    ( q(X1,X2)
    | ~ p(f(X1,X2),f(X1,X2))
    | ~ p(X2,f(X1,X2)) ),
    clause2 ).

cnf(c_0_4,axiom,
    p(X1,X2),
    clause1 ).

cnf(c_0_5,negated_conjecture,
    ( ~ q(f(X1,X2),f(X1,X2))
    | ~ q(X1,f(X1,X2))
    | ~ p(f(X1,X2),f(X1,X2))
    | ~ p(X2,f(X1,X2)) ),
    theorem ).

cnf(c_0_6,plain,
    q(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4])]) ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_4]),c_0_4])]),c_0_6]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SYN035-1 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sat Aug 26 19:07:35 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.49/0.56  start to proof: theBenchmark
% 0.51/0.57  % Version  : CSE_E---1.5
% 0.51/0.57  % Problem  : theBenchmark.p
% 0.51/0.57  % Proof found
% 0.51/0.57  % SZS status Theorem for theBenchmark.p
% 0.51/0.57  % SZS output start Proof
% See solution above
% 0.51/0.57  % Total time : 0.003000 s
% 0.51/0.57  % SZS output end Proof
% 0.51/0.57  % Total time : 0.005000 s
%------------------------------------------------------------------------------