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

% Computer : n021.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:42 EDT 2022

% Result   : Theorem 0.20s 0.44s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   12 (   8 unt;   0 nHn;  12 RR)
%            Number of literals    :   16 (   0 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 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(a,b),
    file('SYN356+1.p',unknown),
    [] ).

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

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

cnf(4,axiom,
    ( ~ big_q(u,v)
    | big_q(u,u) ),
    file('SYN356+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big_q(b,b)
    | ~ big_q(a,a) ),
    file('SYN356+1.p',unknown),
    [] ).

cnf(6,plain,
    big_r(b,a),
    inference(res,[status(thm),theory(equality)],[1,2]),
    [iquote('0:Res:1.0,2.0')] ).

cnf(8,plain,
    big_q(a,b),
    inference(res,[status(thm),theory(equality)],[1,3]),
    [iquote('0:Res:1.0,3.0')] ).

cnf(9,plain,
    big_q(b,a),
    inference(res,[status(thm),theory(equality)],[6,3]),
    [iquote('0:Res:6.0,3.0')] ).

cnf(10,plain,
    big_q(a,a),
    inference(res,[status(thm),theory(equality)],[8,4]),
    [iquote('0:Res:8.0,4.0')] ).

cnf(11,plain,
    ~ big_q(b,b),
    inference(mrr,[status(thm)],[5,10]),
    [iquote('0:MRR:5.1,10.0')] ).

cnf(12,plain,
    big_q(b,b),
    inference(res,[status(thm),theory(equality)],[9,4]),
    [iquote('0:Res:9.0,4.0')] ).

cnf(13,plain,
    $false,
    inference(mrr,[status(thm)],[12,11]),
    [iquote('0:MRR:12.0,11.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN356+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jul 12 03:06:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.44  
% 0.20/0.44  SPASS V 3.9 
% 0.20/0.44  SPASS beiseite: Proof found.
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.44  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.20/0.44  SPASS allocated 85061 KBytes.
% 0.20/0.44  SPASS spent	0:00:00.08 on the problem.
% 0.20/0.44  		0:00:00.04 for the input.
% 0.20/0.44  		0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.44  		0:00:00.00 for inferences.
% 0.20/0.44  		0:00:00.00 for the backtracking.
% 0.20/0.44  		0:00:00.00 for the reduction.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Here is a proof with depth 3, length 12 :
% 0.20/0.44  % SZS output start Refutation
% See solution above
% 0.20/0.44  Formulae used in the proof : x2107
% 0.20/0.44  
%------------------------------------------------------------------------------