%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : CSR031+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.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 : Fri Jul 15 23:24:22 EDT 2022

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

cnf(22,axiom,
    disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    file('CSR031+2.p',unknown),
    [] ).

cnf(474,axiom,
    ( ~ individual(u)
    | ~ collection(u) ),
    file('CSR031+2.p',unknown),
    [] ).

cnf(992,axiom,
    ( ~ disjointwith(u,v)
    | collection(u) ),
    file('CSR031+2.p',unknown),
    [] ).

cnf(1138,plain,
    collection(c_tptptptpcol_16_8398),
    inference(res,[status(thm),theory(equality)],[22,992]),
    [iquote('0:Res:22.0,992.0')] ).

cnf(1656,plain,
    $false,
    inference(ems,[status(thm)],[474,16,1138]),
    [iquote('0:EmS:474.0,474.1,16.0,1138.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR031+2 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n023.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.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 10 00:56:07 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.71/0.90  
% 0.71/0.90  SPASS V 3.9 
% 0.71/0.90  SPASS beiseite: Proof found.
% 0.71/0.90  % SZS status Theorem
% 0.71/0.90  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.71/0.90  SPASS derived 30 clauses, backtracked 0 clauses, performed 0 splits and kept 1121 clauses.
% 0.71/0.90  SPASS allocated 99825 KBytes.
% 0.71/0.90  SPASS spent	0:00:00.54 on the problem.
% 0.71/0.90  		0:00:00.05 for the input.
% 0.71/0.90  		0:00:00.19 for the FLOTTER CNF translation.
% 0.71/0.90  		0:00:00.00 for inferences.
% 0.71/0.90  		0:00:00.00 for the backtracking.
% 0.71/0.90  		0:00:00.15 for the reduction.
% 0.71/0.90  
% 0.71/0.90  
% 0.71/0.90  Here is a proof with depth 2, length 6 :
% 0.71/0.90  % SZS output start Refutation
% See solution above
% 0.71/0.90  Formulae used in the proof : ax1_447 query81 ax1_289 ax1_1119
% 0.71/0.90  
%------------------------------------------------------------------------------