%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN072-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 : n031.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:49:56 EDT 2023

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

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

tff(decl_23,type,
    d: $i ).

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

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

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

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

cnf(prove_this,negated_conjecture,
    ~ big_p(e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(clause_1,axiom,
    ( X1 = c
    | X1 = d ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_3,axiom,
    big_p(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_2,axiom,
    big_p(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_4,axiom,
    a != b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(c_0_5,negated_conjecture,
    ~ big_p(e),
    prove_this ).

cnf(c_0_6,axiom,
    ( X1 = c
    | X1 = d ),
    clause_1 ).

cnf(c_0_7,negated_conjecture,
    ( e = c
    | ~ big_p(d) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    ( e = c
    | X1 = c
    | ~ big_p(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_9,axiom,
    big_p(b),
    clause_3 ).

cnf(c_0_10,negated_conjecture,
    ( c = b
    | e = c ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    big_p(a),
    clause_2 ).

cnf(c_0_12,negated_conjecture,
    ( c = b
    | ~ big_p(c) ),
    inference(spm,[status(thm)],[c_0_5,c_0_10]) ).

cnf(c_0_13,plain,
    ( X1 = c
    | X2 = c
    | X2 = X1 ),
    inference(spm,[status(thm)],[c_0_6,c_0_6]) ).

cnf(c_0_14,negated_conjecture,
    ( c = a
    | e = c ),
    inference(spm,[status(thm)],[c_0_8,c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    ( X1 = c
    | X2 = b
    | X1 = X2
    | ~ big_p(X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,axiom,
    a != b,
    clause_4 ).

cnf(c_0_17,negated_conjecture,
    ( c = a
    | ~ big_p(c) ),
    inference(spm,[status(thm)],[c_0_5,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( X1 = a
    | X1 = c ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ( X1 = a
    | ~ big_p(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_9]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SYN072-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n031.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   : Sat Aug 26 21:11:23 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.57  start to proof: theBenchmark
% 0.21/0.59  % Version  : CSE_E---1.5
% 0.21/0.59  % Problem  : theBenchmark.p
% 0.21/0.59  % Proof found
% 0.21/0.59  % SZS status Theorem for theBenchmark.p
% 0.21/0.59  % SZS output start Proof
% See solution above
% 0.21/0.59  % Total time : 0.004000 s
% 0.21/0.59  % SZS output end Proof
% 0.21/0.59  % Total time : 0.006000 s
%------------------------------------------------------------------------------