%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : COL075-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 : 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 : Wed Aug 30 18:22:28 EDT 2023

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

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

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

tff(decl_24,type,
    projection1: $i ).

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

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

tff(decl_27,type,
    abstraction: $i ).

tff(decl_28,type,
    eq: $i ).

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

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

tff(decl_31,type,
    c: $i > $i ).

cnf(abstraction,axiom,
    apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,apply(k,X3)),apply(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',abstraction) ).

cnf(k_definition,axiom,
    apply(apply(k,X1),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_definition) ).

cnf(prove_diagonal_combinator,negated_conjecture,
    apply(apply(X1,b(X1)),c(X1)) != apply(b(X1),b(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_diagonal_combinator) ).

cnf(c_0_3,axiom,
    apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,apply(k,X3)),apply(X2,X3)),
    abstraction ).

cnf(c_0_4,axiom,
    apply(apply(k,X1),X2) = X1,
    k_definition ).

cnf(c_0_5,plain,
    apply(apply(apply(abstraction,X1),apply(k,X2)),X3) = apply(apply(X1,apply(k,X3)),X2),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    apply(apply(X1,b(X1)),c(X1)) != apply(b(X1),b(X1)),
    prove_diagonal_combinator ).

cnf(c_0_7,plain,
    apply(apply(apply(apply(abstraction,abstraction),k),X1),X2) = apply(X1,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_3]),c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_6,c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : COL075-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 : n004.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   : Sun Aug 27 04:49:22 EDT 2023
% 0.14/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.010000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.013000 s
%------------------------------------------------------------------------------