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

% Computer : n015.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:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    big(u,skf6(u)),
    file('SYN386+1.p',unknown),
    [] ).

cnf(2,axiom,
    big_s(u,skf10(v,u)),
    file('SYN386+1.p',unknown),
    [] ).

cnf(3,axiom,
    big(skf10(u,v),skf11(v,u)),
    file('SYN386+1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ big_d(skf11(u,v),v,skf9(v)),
    file('SYN386+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big_s(skf7(u),v)
    | big_d(v,skc1,u) ),
    file('SYN386+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ big(u,v)
    | ~ big(w,x)
    | ~ big_d(w,u,skf8(y))
    | big_d(x,v,y) ),
    file('SYN386+1.p',unknown),
    [] ).

cnf(8,plain,
    ( ~ big_s(skf7(skf8(u)),v)
    | ~ big(skc1,w)
    | ~ big(v,x)
    | big_d(x,w,u) ),
    inference(res,[status(thm),theory(equality)],[5,6]),
    [iquote('0:Res:5.1,6.2')] ).

cnf(9,plain,
    ( ~ big(skc1,u)
    | ~ big(skf10(v,skf7(skf8(w))),x)
    | big_d(x,u,w) ),
    inference(res,[status(thm),theory(equality)],[2,8]),
    [iquote('0:Res:2.0,8.0')] ).

cnf(11,plain,
    ( ~ big(skc1,u)
    | big_d(skf11(skf7(skf8(v)),w),u,v) ),
    inference(res,[status(thm),theory(equality)],[3,9]),
    [iquote('0:Res:3.0,9.1')] ).

cnf(12,plain,
    ~ big(skc1,u),
    inference(res,[status(thm),theory(equality)],[11,4]),
    [iquote('0:Res:11.1,4.0')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN386+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n015.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.34  % DateTime : Mon Jul 11 13:25:54 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.44  
% 0.19/0.44  SPASS V 3.9 
% 0.19/0.44  SPASS beiseite: Proof found.
% 0.19/0.44  % SZS status Theorem
% 0.19/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.44  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 13 clauses.
% 0.19/0.44  SPASS allocated 85085 KBytes.
% 0.19/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.44  		0:00:00.04 for the input.
% 0.19/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44  		0:00:00.00 for inferences.
% 0.19/0.44  		0:00:00.00 for the backtracking.
% 0.19/0.44  		0:00:00.00 for the reduction.
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Here is a proof with depth 4, length 11 :
% 0.19/0.44  % SZS output start Refutation
% See solution above
% 0.19/0.44  Formulae used in the proof : x2138
% 0.19/0.44  
%------------------------------------------------------------------------------