%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN006-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 : n007.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:24 EDT 2023

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

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

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

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

tff(decl_25,type,
    q2: ( $i * $i ) > $o ).

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

tff(decl_27,type,
    p2: ( $i * $i ) > $o ).

tff(decl_28,type,
    q3: ( $i * $i ) > $o ).

tff(decl_29,type,
    q4: ( $i * $i ) > $o ).

tff(decl_30,type,
    g: $i > $i ).

cnf(clause_5,negated_conjecture,
    ~ q3(X1,g(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_4,negated_conjecture,
    ( q3(f(X1),X2)
    | q4(X1,f(X2))
    | ~ p2(X1,f(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_1,negated_conjecture,
    ( q1(f(X1),X2)
    | q2(X1,f(X2))
    | ~ p1(X1,f(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_3,negated_conjecture,
    ~ q2(X1,f(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_6,negated_conjecture,
    ~ q4(f(f(X1)),f(g(f(X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

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

cnf(clause_2,negated_conjecture,
    p1(a,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(c_0_7,negated_conjecture,
    ~ q3(X1,g(X2)),
    clause_5 ).

cnf(c_0_8,negated_conjecture,
    ( q3(f(X1),X2)
    | q4(X1,f(X2))
    | ~ p2(X1,f(X2)) ),
    clause_4 ).

cnf(c_0_9,negated_conjecture,
    ( q1(f(X1),X2)
    | q2(X1,f(X2))
    | ~ p1(X1,f(X2)) ),
    clause_1 ).

cnf(c_0_10,negated_conjecture,
    ~ q2(X1,f(X2)),
    clause_3 ).

cnf(c_0_11,negated_conjecture,
    ~ q4(f(f(X1)),f(g(f(X2)))),
    clause_6 ).

cnf(c_0_12,negated_conjecture,
    ( q4(X1,f(g(X2)))
    | ~ p2(X1,f(g(X2))) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ( p2(f(X1),X2)
    | ~ q1(X1,f(X2)) ),
    clause_7 ).

cnf(c_0_14,negated_conjecture,
    ( q1(f(X1),X2)
    | ~ p1(X1,f(X2)) ),
    inference(sr,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ~ p2(f(f(X1)),f(g(f(X2)))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( p2(f(f(X1)),X2)
    | ~ p1(X1,f(f(X2))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    ~ p1(X1,f(f(f(g(f(X2)))))),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    p1(a,X1),
    clause_2 ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_17,c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n007.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 20:58:27 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.55  start to proof: theBenchmark
% 0.20/0.57  % Version  : CSE_E---1.5
% 0.20/0.57  % Problem  : theBenchmark.p
% 0.20/0.57  % Proof found
% 0.20/0.57  % SZS status Theorem for theBenchmark.p
% 0.20/0.57  % SZS output start Proof
% See solution above
% 0.20/0.57  % Total time : 0.004000 s
% 0.20/0.57  % SZS output end Proof
% 0.20/0.57  % Total time : 0.007000 s
%------------------------------------------------------------------------------