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

% Computer : n007.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:38:00 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    p100(skc3),
    file('LCL636+1.001.p',unknown),
    [] ).

cnf(3,axiom,
    ~ p2(skc6),
    file('LCL636+1.001.p',unknown),
    [] ).

cnf(5,axiom,
    ~ p101(skc3),
    file('LCL636+1.001.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ r1(skc3,u)
    | p2(u) ),
    file('LCL636+1.001.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ p100(skc3)
    | r1(skc3,skc6)
    | p101(skc3) ),
    file('LCL636+1.001.p',unknown),
    [] ).

cnf(34,plain,
    r1(skc3,skc6),
    inference(mrr,[status(thm)],[11,2,5]),
    [iquote('0:MRR:11.0,11.2,2.0,5.0')] ).

cnf(65,plain,
    p2(skc6),
    inference(res,[status(thm),theory(equality)],[34,8]),
    [iquote('0:Res:34.0,8.0')] ).

cnf(66,plain,
    $false,
    inference(mrr,[status(thm)],[65,3]),
    [iquote('0:MRR:65.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LCL636+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n007.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul  4 23:50:57 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 7 clauses, backtracked 0 clauses, performed 1 splits and kept 33 clauses.
% 0.19/0.43  SPASS allocated 97709 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.43  		0:00:00.04 for the input.
% 0.19/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.00 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 1, length 8 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : main
% 0.19/0.43  
%------------------------------------------------------------------------------