%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN366+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:20:48 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    big_r(skc2,skc2),
    file('SYN366+1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ big_r(skc3,skc3),
    file('SYN366+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big_r(u,u)
    | big_r(u,v) ),
    file('SYN366+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big_r(u,u)
    | big_r(v,u) ),
    file('SYN366+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ big_r(u,v)
    | big_r(v,v) ),
    file('SYN366+1.p',unknown),
    [] ).

cnf(7,plain,
    big_r(u,skc2),
    inference(res,[status(thm),theory(equality)],[1,5]),
    [iquote('0:Res:1.0,5.0')] ).

cnf(9,plain,
    big_r(skc2,u),
    inference(res,[status(thm),theory(equality)],[7,3]),
    [iquote('0:Res:7.0,3.0')] ).

cnf(12,plain,
    big_r(u,u),
    inference(res,[status(thm),theory(equality)],[9,6]),
    [iquote('0:Res:9.0,6.0')] ).

cnf(14,plain,
    $false,
    inference(unc,[status(thm)],[12,2]),
    [iquote('0:UnC:12.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN366+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n026.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 : Tue Jul 12 08:50:28 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.42  
% 0.19/0.42  SPASS V 3.9 
% 0.19/0.42  SPASS beiseite: Proof found.
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.42  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.19/0.42  SPASS allocated 85067 KBytes.
% 0.19/0.42  SPASS spent	0:00:00.08 on the problem.
% 0.19/0.42  		0:00:00.03 for the input.
% 0.19/0.42  		0:00:00.02 for the FLOTTER CNF translation.
% 0.19/0.42  		0:00:00.00 for inferences.
% 0.19/0.42  		0:00:00.00 for the backtracking.
% 0.19/0.42  		0:00:00.00 for the reduction.
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Here is a proof with depth 3, length 9 :
% 0.19/0.42  % SZS output start Refutation
% See solution above
% 0.19/0.42  Formulae used in the proof : x2117
% 0.19/0.42  
%------------------------------------------------------------------------------