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

View Problem - Process Solution

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

% Computer : n022.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 : Tue Jul 19 14:35:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    finite(skc23),
    file('SEU294+3.p',unknown),
    [] ).

cnf(76,axiom,
    subset(skc24,skc23),
    file('SEU294+3.p',unknown),
    [] ).

cnf(77,axiom,
    ~ finite(skc24),
    file('SEU294+3.p',unknown),
    [] ).

cnf(124,axiom,
    ( ~ subset(u,v)
    | element(u,powerset(v)) ),
    file('SEU294+3.p',unknown),
    [] ).

cnf(133,axiom,
    ( ~ finite(u)
    | ~ element(v,powerset(u))
    | finite(v) ),
    file('SEU294+3.p',unknown),
    [] ).

cnf(141,plain,
    ( ~ finite(u)
    | ~ element(skc24,powerset(u)) ),
    inference(res,[status(thm),theory(equality)],[133,77]),
    [iquote('0:Res:133.2,77.0')] ).

cnf(142,plain,
    element(skc24,powerset(skc23)),
    inference(res,[status(thm),theory(equality)],[76,124]),
    [iquote('0:Res:76.0,124.0')] ).

cnf(143,plain,
    ~ element(skc24,powerset(skc23)),
    inference(res,[status(thm),theory(equality)],[1,141]),
    [iquote('0:Res:1.0,141.0')] ).

cnf(145,plain,
    $false,
    inference(mrr,[status(thm)],[143,142]),
    [iquote('0:MRR:143.0,142.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU294+3 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n022.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 : Mon Jun 20 09:23:01 EDT 2022
% 0.12/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 6 clauses, backtracked 0 clauses, performed 0 splits and kept 131 clauses.
% 0.19/0.44  SPASS allocated 97782 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 2, length 9 :
% 0.19/0.44  % SZS output start Refutation
% See solution above
% 0.19/0.44  Formulae used in the proof : t13_finset_1 t3_subset cc2_finset_1
% 0.19/0.44  
%------------------------------------------------------------------------------