%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n006.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  : 600s
% DateTime : Fri Jul 15 01:44:10 EDT 2022

% Result   : Unsatisfiable 0.18s 0.43s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   23 (  12 unt;   7 nHn;  23 RR)
%            Number of literals    :   39 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ follows(u,v)
    | ~ fails(u,v) ),
    file('COM002-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ fails(u,v)
    | fails(w,v)
    | fails(u,w) ),
    file('COM002-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ labels(u,v)
    | ~ fails(v,w)
    | ~ has(w,goto(u)) ),
    file('COM002-2.p',unknown),
    [] ).

cnf(8,axiom,
    labels(loop,p3),
    file('COM002-2.p',unknown),
    [] ).

cnf(13,axiom,
    follows(p6,p3),
    file('COM002-2.p',unknown),
    [] ).

cnf(15,axiom,
    follows(p7,p6),
    file('COM002-2.p',unknown),
    [] ).

cnf(17,axiom,
    follows(p8,p7),
    file('COM002-2.p',unknown),
    [] ).

cnf(18,axiom,
    has(p8,goto(loop)),
    file('COM002-2.p',unknown),
    [] ).

cnf(19,axiom,
    fails(p3,p3),
    file('COM002-2.p',unknown),
    [] ).

cnf(21,plain,
    ( fails(u,p3)
    | fails(p3,u) ),
    inference(res,[status(thm),theory(equality)],[19,2]),
    [iquote('0:Res:19.0,2.0')] ).

cnf(34,plain,
    ( fails(p3,u)
    | fails(v,p3)
    | fails(u,v) ),
    inference(res,[status(thm),theory(equality)],[21,2]),
    [iquote('0:Res:21.0,2.0')] ).

cnf(46,plain,
    ( ~ follows(u,v)
    | fails(p3,u)
    | fails(v,p3) ),
    inference(res,[status(thm),theory(equality)],[34,1]),
    [iquote('0:Res:34.2,1.1')] ).

cnf(50,plain,
    ( ~ labels(loop,u)
    | ~ fails(u,p8) ),
    inference(res,[status(thm),theory(equality)],[18,3]),
    [iquote('0:Res:18.0,3.2')] ).

cnf(125,plain,
    ( fails(p3,p7)
    | fails(p6,p3) ),
    inference(res,[status(thm),theory(equality)],[15,46]),
    [iquote('0:Res:15.0,46.0')] ).

cnf(164,plain,
    ( fails(p6,p3)
    | fails(u,p7)
    | fails(p3,u) ),
    inference(res,[status(thm),theory(equality)],[125,2]),
    [iquote('0:Res:125.0,2.0')] ).

cnf(313,plain,
    ( fails(u,p7)
    | fails(p3,u) ),
    inference(spt,[spt(split,[position(s1)])],[164]),
    [iquote('1:Spt:164.1,164.2')] ).

cnf(318,plain,
    ( ~ labels(loop,p3)
    | fails(p8,p7) ),
    inference(res,[status(thm),theory(equality)],[313,50]),
    [iquote('1:Res:313.1,50.1')] ).

cnf(320,plain,
    fails(p8,p7),
    inference(mrr,[status(thm)],[318,8]),
    [iquote('1:MRR:318.0,8.0')] ).

cnf(322,plain,
    ~ follows(p8,p7),
    inference(res,[status(thm),theory(equality)],[320,1]),
    [iquote('1:Res:320.0,1.1')] ).

cnf(323,plain,
    $false,
    inference(mrr,[status(thm)],[322,17]),
    [iquote('1:MRR:322.0,17.0')] ).

cnf(324,plain,
    fails(p6,p3),
    inference(spt,[spt(split,[position(s2)])],[164]),
    [iquote('1:Spt:323.0,164.0')] ).

cnf(326,plain,
    ~ follows(p6,p3),
    inference(res,[status(thm),theory(equality)],[324,1]),
    [iquote('1:Res:324.0,1.1')] ).

cnf(327,plain,
    $false,
    inference(mrr,[status(thm)],[326,13]),
    [iquote('1:MRR:326.0,13.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n006.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Thu Jun 16 19:50:41 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.43  
% 0.18/0.43  SPASS V 3.9 
% 0.18/0.43  SPASS beiseite: Proof found.
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.43  SPASS derived 280 clauses, backtracked 1 clauses, performed 1 splits and kept 164 clauses.
% 0.18/0.43  SPASS allocated 63285 KBytes.
% 0.18/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.43  		0:00:00.04 for the input.
% 0.18/0.43  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.43  		0:00:00.00 for inferences.
% 0.18/0.43  		0:00:00.00 for the backtracking.
% 0.18/0.43  		0:00:00.02 for the reduction.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Here is a proof with depth 8, length 23 :
% 0.18/0.43  % SZS output start Refutation
% See solution above
% 0.18/0.43  Formulae used in the proof : direct_success transitivity_of_success goto_success label_state_3 transition_3_to_6 transition_6_to_7 transition_7_to_8 state_8 prove_there_is_a_loop_through_p3
% 0.18/0.43  
%------------------------------------------------------------------------------