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

% Computer : n006.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:17 EDT 2022

% Result   : Theorem 0.20s 0.43s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   3 unt;   1 nHn;   7 RR)
%            Number of literals    :   11 (   0 equ;   4 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    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( big(u,v)
    | big_g(u,v) ),
    file('SYN323+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ big(u,v)
    | big_g(v,u) ),
    file('SYN323+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big_g(u,v)
    | big(u,v) ),
    file('SYN323+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ big(u,v)
    | ~ big_g(v,u) ),
    file('SYN323+1.p',unknown),
    [] ).

cnf(5,plain,
    big(u,v),
    inference(mrr,[status(thm)],[3,1]),
    [iquote('0:MRR:3.0,1.1')] ).

cnf(6,plain,
    big_g(u,v),
    inference(mrr,[status(thm)],[2,5]),
    [iquote('0:MRR:2.0,5.0')] ).

cnf(7,plain,
    $false,
    inference(mrr,[status(thm)],[4,5,6]),
    [iquote('0:MRR:4.0,4.1,5.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN323+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n006.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 11 19:23:50 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.43  
% 0.20/0.43  SPASS V 3.9 
% 0.20/0.43  SPASS beiseite: Proof found.
% 0.20/0.43  % SZS status Theorem
% 0.20/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.43  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 4 clauses.
% 0.20/0.43  SPASS allocated 85051 KBytes.
% 0.20/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.43  		0:00:00.04 for the input.
% 0.20/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.43  		0:00:00.00 for inferences.
% 0.20/0.43  		0:00:00.00 for the backtracking.
% 0.20/0.43  		0:00:00.00 for the reduction.
% 0.20/0.43  
% 0.20/0.43  
% 0.20/0.43  Here is a proof with depth 0, length 7 :
% 0.20/0.43  % SZS output start Refutation
% See solution above
% 0.20/0.43  Formulae used in the proof : church_46_4_2
% 0.20/0.43  
%------------------------------------------------------------------------------