TSTP Solution File: CSR031+3 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n028.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 84.84s 85.03s
% Output   : Refutation 84.84s
% 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(182,axiom,
    individual(c_tptptptpcol_16_8398),
    file('CSR031+3.p',unknown),
    [] ).

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

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

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

cnf(8012,plain,
    collection(c_tptptptpcol_16_8398),
    inference(res,[status(thm),theory(equality)],[313,6286]),
    [iquote('0:Res:313.0,6286.0')] ).

cnf(17361,plain,
    $false,
    inference(ems,[status(thm)],[3964,182,8012]),
    [iquote('0:EmS:3964.0,3964.1,182.0,8012.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR031+3 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n028.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 : Fri Jun 10 03:37:48 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 84.84/85.03  
% 84.84/85.03  SPASS V 3.9 
% 84.84/85.03  SPASS beiseite: Proof found.
% 84.84/85.03  % SZS status Theorem
% 84.84/85.03  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 84.84/85.03  SPASS derived 6283 clauses, backtracked 0 clauses, performed 0 splits and kept 13468 clauses.
% 84.84/85.03  SPASS allocated 113481 KBytes.
% 84.84/85.03  SPASS spent	0:1:22.02 on the problem.
% 84.84/85.03  		0:00:00.07 for the input.
% 84.84/85.03  		0:00:06.88 for the FLOTTER CNF translation.
% 84.84/85.03  		0:00:00.29 for inferences.
% 84.84/85.03  		0:00:00.00 for the backtracking.
% 84.84/85.03  		0:0:58.38 for the reduction.
% 84.84/85.03  
% 84.84/85.03  
% 84.84/85.03  Here is a proof with depth 2, length 6 :
% 84.84/85.03  % SZS output start Refutation
% See solution above
% 84.84/85.03  Formulae used in the proof : ax2_2816 query131 ax2_3226 ax2_7583
% 84.84/85.03  
%------------------------------------------------------------------------------