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

% Computer : n024.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:22:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    p4(u,u),
    file('SYN555-1.p',unknown),
    [] ).

cnf(4,axiom,
    p4(f5(c7,c10,c9),c9),
    file('SYN555-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ p4(f5(c7,c10,c8),c8),
    file('SYN555-1.p',unknown),
    [] ).

cnf(6,axiom,
    p4(f5(c7,u,c8),f5(c7,u,c9)),
    file('SYN555-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ p4(u,v)
    | ~ p4(u,w)
    | p4(w,v) ),
    file('SYN555-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ p4(f5(c7,u,v),v)
    | ~ p4(f5(c7,f6(u,v,w),v),f5(c7,f6(u,v,w),w))
    | p4(f5(c7,u,w),w) ),
    file('SYN555-1.p',unknown),
    [] ).

cnf(16,plain,
    ( ~ p4(u,v)
    | p4(v,u) ),
    inference(res,[status(thm),theory(equality)],[2,8]),
    [iquote('0:Res:2.0,8.0')] ).

cnf(22,plain,
    p4(f5(c7,u,c9),f5(c7,u,c8)),
    inference(res,[status(thm),theory(equality)],[6,16]),
    [iquote('0:Res:6.0,16.0')] ).

cnf(60,plain,
    ( ~ p4(f5(c7,u,c9),c9)
    | p4(f5(c7,u,c8),c8) ),
    inference(res,[status(thm),theory(equality)],[22,12]),
    [iquote('0:Res:22.0,12.1')] ).

cnf(66,plain,
    p4(f5(c7,c10,c8),c8),
    inference(res,[status(thm),theory(equality)],[4,60]),
    [iquote('0:Res:4.0,60.0')] ).

cnf(69,plain,
    $false,
    inference(mrr,[status(thm)],[66,5]),
    [iquote('0:MRR:66.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN555-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jul 12 08:53:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.41  
% 0.18/0.41  SPASS V 3.9 
% 0.18/0.41  SPASS beiseite: Proof found.
% 0.18/0.41  % SZS status Theorem
% 0.18/0.41  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.41  SPASS derived 55 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.18/0.41  SPASS allocated 63150 KBytes.
% 0.18/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.18/0.41  		0:00:00.03 for the input.
% 0.18/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.41  		0:00:00.00 for inferences.
% 0.18/0.41  		0:00:00.00 for the backtracking.
% 0.18/0.41  		0:00:00.00 for the reduction.
% 0.18/0.41  
% 0.18/0.41  
% 0.18/0.41  Here is a proof with depth 4, length 11 :
% 0.18/0.41  % SZS output start Refutation
% See solution above
% 0.18/0.41  Formulae used in the proof : p4_2 p4_4 not_p4_5 p4_6 p4_8 p4_12
% 0.18/0.41  
%------------------------------------------------------------------------------