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

% Computer : n024.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 : Sun Jul 17 14:37:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(9,axiom,
    r2,
    file('LCL491+1.p',unknown),
    [] ).

cnf(14,axiom,
    ~ or_2,
    file('LCL491+1.p',unknown),
    [] ).

cnf(29,axiom,
    ( ~ is_a_theorem(implies__dfg(skc76,or__dfg(skc77,skc76)))
    | or_2 ),
    file('LCL491+1.p',unknown),
    [] ).

cnf(36,axiom,
    ( ~ r2
    | is_a_theorem(implies__dfg(u,or__dfg(v,u))) ),
    file('LCL491+1.p',unknown),
    [] ).

cnf(75,plain,
    is_a_theorem(implies__dfg(u,or__dfg(v,u))),
    inference(mrr,[status(thm)],[36,9]),
    [iquote('0:MRR:36.0,9.0')] ).

cnf(77,plain,
    $false,
    inference(mrr,[status(thm)],[29,75,14]),
    [iquote('0:MRR:29.0,29.1,75.0,14.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL491+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jul  2 23:24:45 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  
% 0.19/0.45  SPASS V 3.9 
% 0.19/0.45  SPASS beiseite: Proof found.
% 0.19/0.45  % SZS status Theorem
% 0.19/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.45  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 22 clauses.
% 0.19/0.45  SPASS allocated 97813 KBytes.
% 0.19/0.45  SPASS spent	0:00:00.10 on the problem.
% 0.19/0.45  		0:00:00.04 for the input.
% 0.19/0.45  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.45  		0:00:00.00 for inferences.
% 0.19/0.45  		0:00:00.00 for the backtracking.
% 0.19/0.45  		0:00:00.00 for the reduction.
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Here is a proof with depth 0, length 6 :
% 0.19/0.45  % SZS output start Refutation
% See solution above
% 0.19/0.45  Formulae used in the proof : principia_r2 hilbert_or_2 or_2 r2
% 0.19/0.45  
%------------------------------------------------------------------------------