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

% Computer : n026.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 : Thu Jul 21 12:17:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( p
    | q ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ q
    | r ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ r
    | p ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ r
    | q ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ p
    | ~ q ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ p
    | q
    | r ),
    file('SYN044+1.p',unknown),
    [] ).

cnf(7,plain,
    r,
    inference(mrr,[status(thm)],[6,1,2]),
    [iquote('0:MRR:6.0,6.1,1.0,2.0')] ).

cnf(8,plain,
    q,
    inference(mrr,[status(thm)],[4,7]),
    [iquote('0:MRR:4.0,7.0')] ).

cnf(9,plain,
    p,
    inference(mrr,[status(thm)],[3,7]),
    [iquote('0:MRR:3.0,7.0')] ).

cnf(10,plain,
    $false,
    inference(mrr,[status(thm)],[5,9,8]),
    [iquote('0:MRR:5.0,5.1,9.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SYN044+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n026.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jul 11 23:48:12 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.45  
% 0.21/0.45  SPASS V 3.9 
% 0.21/0.45  SPASS beiseite: Proof found.
% 0.21/0.45  % SZS status Theorem
% 0.21/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.45  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 8 clauses.
% 0.21/0.45  SPASS allocated 85048 KBytes.
% 0.21/0.45  SPASS spent	0:00:00.08 on the problem.
% 0.21/0.45  		0:00:00.04 for the input.
% 0.21/0.45  		0:00:00.02 for the FLOTTER CNF translation.
% 0.21/0.45  		0:00:00.00 for inferences.
% 0.21/0.45  		0:00:00.00 for the backtracking.
% 0.21/0.45  		0:00:00.00 for the reduction.
% 0.21/0.45  
% 0.21/0.45  
% 0.21/0.45  Here is a proof with depth 0, length 10 :
% 0.21/0.45  % SZS output start Refutation
% See solution above
% 0.21/0.45  Formulae used in the proof : pel10 pel10_1 pel10_2 pel10_3
% 0.21/0.45  
%------------------------------------------------------------------------------