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

% Computer : n020.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:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    grocer(skc1),
    file('PUZ129+2.p',unknown),
    [] ).

cnf(2,axiom,
    cyclist(skc1),
    file('PUZ129+2.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ cyclist(u)
    | person(u) ),
    file('PUZ129+2.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ cyclist(u)
    | property1(u,industrious,pos) ),
    file('PUZ129+2.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ grocer(u)
    | ~ property1(u,healthy,pos) ),
    file('PUZ129+2.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ grocer(u)
    | ~ property1(u,industrious,pos)
    | property1(u,honest,pos) ),
    file('PUZ129+2.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ person(u)
    | ~ property1(u,industrious,pos)
    | ~ property1(u,honest,pos)
    | property1(u,healthy,pos) ),
    file('PUZ129+2.p',unknown),
    [] ).

cnf(16,plain,
    ( ~ cyclist(u)
    | ~ grocer(u)
    | property1(u,honest,pos) ),
    inference(res,[status(thm),theory(equality)],[5,7]),
    [iquote('0:Res:5.1,7.1')] ).

cnf(17,plain,
    ( ~ cyclist(u)
    | ~ person(u)
    | ~ property1(u,honest,pos)
    | property1(u,healthy,pos) ),
    inference(res,[status(thm),theory(equality)],[5,11]),
    [iquote('0:Res:5.1,11.1')] ).

cnf(18,plain,
    ( ~ cyclist(u)
    | ~ property1(u,honest,pos)
    | property1(u,healthy,pos) ),
    inference(ssi,[status(thm)],[17,4]),
    [iquote('0:SSi:17.1,4.1')] ).

cnf(19,plain,
    ( ~ cyclist(u)
    | ~ grocer(u)
    | ~ cyclist(u)
    | property1(u,healthy,pos) ),
    inference(res,[status(thm),theory(equality)],[16,18]),
    [iquote('0:Res:16.2,18.1')] ).

cnf(20,plain,
    ( ~ grocer(u)
    | ~ cyclist(u)
    | property1(u,healthy,pos) ),
    inference(obv,[status(thm),theory(equality)],[19]),
    [iquote('0:Obv:19.0')] ).

cnf(21,plain,
    ( ~ grocer(u)
    | ~ cyclist(u) ),
    inference(mrr,[status(thm)],[20,6]),
    [iquote('0:MRR:20.2,6.1')] ).

cnf(22,plain,
    $false,
    inference(ems,[status(thm)],[21,1,2]),
    [iquote('0:EmS:21.0,21.1,1.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.15/0.36  % Computer : n020.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Sat May 28 21:15:09 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.22/0.46  
% 0.22/0.46  SPASS V 3.9 
% 0.22/0.46  SPASS beiseite: Proof found.
% 0.22/0.46  % SZS status Theorem
% 0.22/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.46  SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.22/0.46  SPASS allocated 97613 KBytes.
% 0.22/0.46  SPASS spent	0:00:00.08 on the problem.
% 0.22/0.46  		0:00:00.03 for the input.
% 0.22/0.46  		0:00:00.03 for the FLOTTER CNF translation.
% 0.22/0.46  		0:00:00.00 for inferences.
% 0.22/0.46  		0:00:00.00 for the backtracking.
% 0.22/0.46  		0:00:00.00 for the reduction.
% 0.22/0.46  
% 0.22/0.46  
% 0.22/0.46  Here is a proof with depth 3, length 14 :
% 0.22/0.46  % SZS output start Refutation
% See solution above
% 0.22/0.46  Formulae used in the proof : prove
% 0.22/0.46  
%------------------------------------------------------------------------------