%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL041-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 : n004.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 06:51:55 EDT 2023

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

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

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

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

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

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

cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(cn_21,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_21) ).

cnf(cn_54,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_54) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

cnf(prove_cn_30,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_30) ).

cnf(c_0_5,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_6,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
    cn_21 ).

cnf(c_0_7,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
    cn_54 ).

cnf(c_0_9,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(implies(X1,X2),X2))),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    cn_3 ).

cnf(c_0_11,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(implies(not(X1),X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_9]) ).

cnf(c_0_12,plain,
    is_a_theorem(implies(not(X1),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_7,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
    prove_cn_30 ).

cnf(c_0_14,plain,
    is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LCL041-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n004.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   : Thu Aug 24 18:05:38 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.57  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.019000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.021000 s
%------------------------------------------------------------------------------