TSTP Solution File: SEU341+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU341+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n019.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:36:25 EDT 2022

% Result   : Theorem 0.20s 0.47s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   15 (   9 unt;   1 nHn;  15 RR)
%            Number of literals    :   45 (   0 equ;  31 neg)
%            Maximal clause size   :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    topological_space(skc6),
    file('SEU341+1.p',unknown),
    [] ).

cnf(2,axiom,
    top_str(skc6),
    file('SEU341+1.p',unknown),
    [] ).

cnf(16,axiom,
    ~ empty_carrier(skc6),
    file('SEU341+1.p',unknown),
    [] ).

cnf(17,axiom,
    in(skc8,skc7),
    file('SEU341+1.p',unknown),
    [] ).

cnf(18,axiom,
    open_subset(skc7,skc6),
    file('SEU341+1.p',unknown),
    [] ).

cnf(22,axiom,
    element(skc8,the_carrier(skc6)),
    file('SEU341+1.p',unknown),
    [] ).

cnf(25,axiom,
    element(skc7,powerset(the_carrier(skc6))),
    file('SEU341+1.p',unknown),
    [] ).

cnf(26,axiom,
    ~ point_neighbourhood(skc7,skc6,skc8),
    file('SEU341+1.p',unknown),
    [] ).

cnf(84,axiom,
    ( ~ top_str(u)
    | ~ topological_space(u)
    | ~ element(v,the_carrier(u))
    | ~ element(w,powerset(the_carrier(u)))
    | ~ in(v,interior(u,w))
    | empty_carrier(u)
    | point_neighbourhood(w,u,v) ),
    file('SEU341+1.p',unknown),
    [] ).

cnf(86,axiom,
    ( ~ topological_space(u)
    | ~ top_str(u)
    | ~ top_str(v)
    | ~ open_subset(w,v)
    | ~ element(x,powerset(the_carrier(u)))
    | ~ element(w,powerset(the_carrier(v)))
    | equal(interior(v,w),w) ),
    file('SEU341+1.p',unknown),
    [] ).

cnf(134,plain,
    ( ~ topological_space(skc6)
    | ~ top_str(skc6)
    | ~ in(skc8,interior(skc6,skc7))
    | ~ element(skc8,the_carrier(skc6))
    | ~ element(skc7,powerset(the_carrier(skc6)))
    | empty_carrier(skc6) ),
    inference(res,[status(thm),theory(equality)],[84,26]),
    [iquote('0:Res:84.5,26.0')] ).

cnf(168,plain,
    ( ~ topological_space(u)
    | ~ top_str(u)
    | ~ top_str(skc6)
    | ~ open_subset(skc7,skc6)
    | ~ element(v,powerset(the_carrier(u)))
    | equal(interior(skc6,skc7),skc7) ),
    inference(res,[status(thm),theory(equality)],[25,86]),
    [iquote('0:Res:25.0,86.5')] ).

cnf(184,plain,
    ( ~ top_str(u)
    | ~ topological_space(u)
    | ~ element(v,powerset(the_carrier(u)))
    | equal(interior(skc6,skc7),skc7) ),
    inference(mrr,[status(thm)],[168,2,18]),
    [iquote('0:MRR:168.2,168.3,2.0,18.0')] ).

cnf(187,plain,
    ( ~ topological_space(skc6)
    | ~ top_str(skc6)
    | ~ in(skc8,skc7)
    | ~ element(skc8,the_carrier(skc6))
    | ~ element(skc7,powerset(the_carrier(skc6)))
    | empty_carrier(skc6) ),
    inference(rew,[status(thm),theory(equality)],[184,134]),
    [iquote('0:Rew:184.3,134.2')] ).

cnf(188,plain,
    $false,
    inference(mrr,[status(thm)],[187,1,2,17,22,25,16]),
    [iquote('0:MRR:187.0,187.1,187.2,187.3,187.4,187.5,1.0,2.0,17.0,22.0,25.0,16.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SEU341+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 19 10:44:39 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  
% 0.20/0.47  SPASS V 3.9 
% 0.20/0.47  SPASS beiseite: Proof found.
% 0.20/0.47  % SZS status Theorem
% 0.20/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.47  SPASS derived 86 clauses, backtracked 0 clauses, performed 0 splits and kept 156 clauses.
% 0.20/0.47  SPASS allocated 97785 KBytes.
% 0.20/0.47  SPASS spent	0:00:00.10 on the problem.
% 0.20/0.47  		0:00:00.04 for the input.
% 0.20/0.47  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.47  		0:00:00.00 for inferences.
% 0.20/0.47  		0:00:00.00 for the backtracking.
% 0.20/0.47  		0:00:00.00 for the reduction.
% 0.20/0.47  
% 0.20/0.47  
% 0.20/0.47  Here is a proof with depth 1, length 15 :
% 0.20/0.47  % SZS output start Refutation
% See solution above
% 0.20/0.47  Formulae used in the proof : t5_connsp_2 d1_connsp_2 t55_tops_1
% 0.20/0.47  
%------------------------------------------------------------------------------