%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : COM001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/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:35:41 EDT 2023

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

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

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

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

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

tff(decl_26,type,
    labels: ( $i * $i ) > $o ).

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

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

tff(decl_29,type,
    p3: $i ).

tff(decl_30,type,
    register_j: $i ).

tff(decl_31,type,
    n: $i ).

tff(decl_32,type,
    equal_function: ( $i * $i ) > $i ).

tff(decl_33,type,
    p4: $i ).

tff(decl_34,type,
    out: $i ).

tff(decl_35,type,
    p5: $i ).

tff(decl_36,type,
    p8: $i ).

cnf(direct_success,axiom,
    ( succeeds(X1,X2)
    | ~ follows(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).

cnf(transition_3_to_8,hypothesis,
    follows(p8,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_8) ).

cnf(goto_success,axiom,
    ( succeeds(X1,X2)
    | ~ has(X2,goto(X3))
    | ~ labels(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).

cnf(state_8,hypothesis,
    has(p8,goto(loop)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).

cnf(transitivity_of_success,axiom,
    ( succeeds(X1,X2)
    | ~ succeeds(X1,X3)
    | ~ succeeds(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).

cnf(label_state_3,hypothesis,
    labels(loop,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).

cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
    ~ succeeds(p3,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).

cnf(c_0_7,axiom,
    ( succeeds(X1,X2)
    | ~ follows(X1,X2) ),
    direct_success ).

cnf(c_0_8,hypothesis,
    follows(p8,p3),
    transition_3_to_8 ).

cnf(c_0_9,axiom,
    ( succeeds(X1,X2)
    | ~ has(X2,goto(X3))
    | ~ labels(X3,X1) ),
    goto_success ).

cnf(c_0_10,hypothesis,
    has(p8,goto(loop)),
    state_8 ).

cnf(c_0_11,axiom,
    ( succeeds(X1,X2)
    | ~ succeeds(X1,X3)
    | ~ succeeds(X3,X2) ),
    transitivity_of_success ).

cnf(c_0_12,hypothesis,
    succeeds(p8,p3),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,hypothesis,
    ( succeeds(X1,p8)
    | ~ labels(loop,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,hypothesis,
    labels(loop,p3),
    label_state_3 ).

cnf(c_0_15,hypothesis,
    ( succeeds(X1,p3)
    | ~ succeeds(X1,p8) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    succeeds(p3,p8),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    ~ succeeds(p3,p3),
    prove_there_is_a_loop_through_p3 ).

cnf(c_0_18,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : COM001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/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   : Tue Aug 29 12:40:52 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.004000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.007000 s
%------------------------------------------------------------------------------