%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.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 : Mon Jul 18 18:27:26 EDT 2022

% Result   : Theorem 0.20s 0.44s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   6 unt;   0 nHn;  11 RR)
%            Number of literals    :   18 (   0 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    alive(skc7),
    file('PUZ060+1.p',unknown),
    [] ).

cnf(4,axiom,
    eats(skc7,skc10),
    file('PUZ060+1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ likes(skc9,skc10),
    file('PUZ060+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ food(u)
    | likes(skc9,u) ),
    file('PUZ060+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ alive(u)
    | not_killed_by(u,v) ),
    file('PUZ060+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ not_killed_by(u,v)
    | ~ eats(u,v)
    | food(v) ),
    file('PUZ060+1.p',unknown),
    [] ).

cnf(14,plain,
    ~ food(skc10),
    inference(res,[status(thm),theory(equality)],[6,5]),
    [iquote('0:Res:6.1,5.0')] ).

cnf(16,plain,
    ( ~ alive(u)
    | ~ eats(u,v)
    | food(v) ),
    inference(res,[status(thm),theory(equality)],[7,9]),
    [iquote('0:Res:7.1,9.0')] ).

cnf(17,plain,
    ( ~ alive(skc7)
    | food(skc10) ),
    inference(res,[status(thm),theory(equality)],[4,16]),
    [iquote('0:Res:4.0,16.1')] ).

cnf(19,plain,
    food(skc10),
    inference(ssi,[status(thm)],[17,2]),
    [iquote('0:SSi:17.0,2.0')] ).

cnf(20,plain,
    $false,
    inference(mrr,[status(thm)],[19,14]),
    [iquote('0:MRR:19.0,14.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun May 29 01:22:12 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.44  
% 0.20/0.44  SPASS V 3.9 
% 0.20/0.44  SPASS beiseite: Proof found.
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.44  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 13 clauses.
% 0.20/0.44  SPASS allocated 97573 KBytes.
% 0.20/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.44  		0:00:00.04 for the input.
% 0.20/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44  		0:00:00.00 for inferences.
% 0.20/0.44  		0:00:00.00 for the backtracking.
% 0.20/0.44  		0:00:00.00 for the reduction.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Here is a proof with depth 2, length 11 :
% 0.20/0.44  % SZS output start Refutation
% See solution above
% 0.20/0.44  Formulae used in the proof : prove_this
% 0.20/0.44  
%------------------------------------------------------------------------------