%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LCL656+1.001 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 14:38:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    p100(skc1),
    file('LCL656+1.001.p',unknown),
    [] ).

cnf(2,axiom,
    ~ p101(skc1),
    file('LCL656+1.001.p',unknown),
    [] ).

cnf(3,axiom,
    r1(u,u),
    file('LCL656+1.001.p',unknown),
    [] ).

cnf(5,axiom,
    r1(u,skf2(u)),
    file('LCL656+1.001.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ r1(skc1,u)
    | p2(u) ),
    file('LCL656+1.001.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ p100(u)
    | ~ p2(skf2(u))
    | ~ r1(skc1,u)
    | p101(u) ),
    file('LCL656+1.001.p',unknown),
    [] ).

cnf(35,plain,
    p2(skc1),
    inference(res,[status(thm),theory(equality)],[3,6]),
    [iquote('0:Res:3.0,6.0')] ).

cnf(36,plain,
    p2(skf2(skc1)),
    inference(res,[status(thm),theory(equality)],[5,6]),
    [iquote('0:Res:5.0,6.0')] ).

cnf(65,plain,
    ( ~ p100(skc1)
    | ~ r1(skc1,skc1)
    | p101(skc1) ),
    inference(res,[status(thm),theory(equality)],[36,12]),
    [iquote('0:Res:36.0,12.1')] ).

cnf(66,plain,
    ( ~ r1(skc1,skc1)
    | p101(skc1) ),
    inference(ssi,[status(thm)],[65,1,35]),
    [iquote('0:SSi:65.0,1.0,35.0')] ).

cnf(67,plain,
    $false,
    inference(mrr,[status(thm)],[66,3,2]),
    [iquote('0:MRR:66.0,66.1,3.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL656+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.32  % Computer : n023.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 600
% 0.13/0.32  % DateTime : Sun Jul  3 07:45:58 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.43  
% 0.18/0.43  SPASS V 3.9 
% 0.18/0.43  SPASS beiseite: Proof found.
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.43  SPASS derived 18 clauses, backtracked 0 clauses, performed 0 splits and kept 31 clauses.
% 0.18/0.43  SPASS allocated 97654 KBytes.
% 0.18/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.43  		0:00:00.04 for the input.
% 0.18/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43  		0:00:00.00 for inferences.
% 0.18/0.43  		0:00:00.00 for the backtracking.
% 0.18/0.43  		0:00:00.00 for the reduction.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Here is a proof with depth 2, length 11 :
% 0.18/0.43  % SZS output start Refutation
% See solution above
% 0.18/0.43  Formulae used in the proof : main reflexivity
% 0.18/0.43  
%------------------------------------------------------------------------------