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

View Problem - Process Solution

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

% Computer : n004.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:50 EDT 2022

% Result   : Theorem 0.19s 0.47s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   22 (  16 unt;   1 nHn;  22 RR)
%            Number of literals    :   63 (   0 equ;  42 neg)
%            Maximal clause size   :   12 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   14 (  13 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    empty(skc20),
    file('SEU387+1.p',unknown),
    [] ).

cnf(85,axiom,
    in(skc20,skc19),
    file('SEU387+1.p',unknown),
    [] ).

cnf(89,axiom,
    rel_str(boole_POSet(u)),
    file('SEU387+1.p',unknown),
    [] ).

cnf(121,axiom,
    reflexive_relstr(boole_POSet(u)),
    file('SEU387+1.p',unknown),
    [] ).

cnf(122,axiom,
    transitive_relstr(boole_POSet(u)),
    file('SEU387+1.p',unknown),
    [] ).

cnf(123,axiom,
    antisymmetric_relstr(boole_POSet(u)),
    file('SEU387+1.p',unknown),
    [] ).

cnf(124,axiom,
    lower_bounded_relstr(boole_POSet(u)),
    file('SEU387+1.p',unknown),
    [] ).

cnf(149,axiom,
    filtered_subset(skc19,boole_POSet(skc18)),
    file('SEU387+1.p',unknown),
    [] ).

cnf(150,axiom,
    upper_relstr_subset(skc19,boole_POSet(skc18)),
    file('SEU387+1.p',unknown),
    [] ).

cnf(157,axiom,
    ~ empty_carrier(boole_POSet(u)),
    file('SEU387+1.p',unknown),
    [] ).

cnf(185,axiom,
    equal(bottom_of_relstr(boole_POSet(u)),empty_set),
    file('SEU387+1.p',unknown),
    [] ).

cnf(186,axiom,
    proper_element(skc19,powerset(the_carrier(boole_POSet(skc18)))),
    file('SEU387+1.p',unknown),
    [] ).

cnf(187,axiom,
    element(skc19,powerset(the_carrier(boole_POSet(skc18)))),
    file('SEU387+1.p',unknown),
    [] ).

cnf(201,axiom,
    ( ~ empty(u)
    | equal(u,empty_set) ),
    file('SEU387+1.p',unknown),
    [] ).

cnf(205,axiom,
    ( ~ empty(u)
    | ~ in(v,u) ),
    file('SEU387+1.p',unknown),
    [] ).

cnf(260,axiom,
    ( ~ reflexive_relstr(u)
    | ~ transitive_relstr(u)
    | ~ antisymmetric_relstr(u)
    | ~ lower_bounded_relstr(u)
    | ~ rel_str(u)
    | ~ in(bottom_of_relstr(u),v)
    | ~ proper_element(v,powerset(the_carrier(u)))
    | ~ filtered_subset(v,u)
    | ~ upper_relstr_subset(v,u)
    | ~ element(v,powerset(the_carrier(u)))
    | empty_carrier(u)
    | empty(v) ),
    file('SEU387+1.p',unknown),
    [] ).

cnf(264,plain,
    ( ~ rel_str(u)
    | ~ lower_bounded_relstr(u)
    | ~ antisymmetric_relstr(u)
    | ~ transitive_relstr(u)
    | ~ reflexive_relstr(u)
    | ~ upper_relstr_subset(v,u)
    | ~ filtered_subset(v,u)
    | ~ element(v,powerset(the_carrier(u)))
    | ~ proper_element(v,powerset(the_carrier(u)))
    | ~ in(bottom_of_relstr(u),v)
    | empty_carrier(u) ),
    inference(mrr,[status(thm)],[260,205]),
    [iquote('0:MRR:260.11,205.0')] ).

cnf(268,plain,
    equal(skc20,empty_set),
    inference(res,[status(thm),theory(equality)],[1,201]),
    [iquote('0:Res:1.0,201.0')] ).

cnf(309,plain,
    ( ~ reflexive_relstr(boole_POSet(skc18))
    | ~ transitive_relstr(boole_POSet(skc18))
    | ~ antisymmetric_relstr(boole_POSet(skc18))
    | ~ lower_bounded_relstr(boole_POSet(skc18))
    | ~ rel_str(boole_POSet(skc18))
    | ~ in(bottom_of_relstr(boole_POSet(skc18)),skc19)
    | ~ filtered_subset(skc19,boole_POSet(skc18))
    | ~ upper_relstr_subset(skc19,boole_POSet(skc18))
    | ~ element(skc19,powerset(the_carrier(boole_POSet(skc18))))
    | empty_carrier(boole_POSet(skc18)) ),
    inference(res,[status(thm),theory(equality)],[186,264]),
    [iquote('0:Res:186.0,264.6')] ).

cnf(311,plain,
    in(empty_set,skc19),
    inference(rew,[status(thm),theory(equality)],[268,85]),
    [iquote('0:Rew:268.0,85.0')] ).

cnf(323,plain,
    ( ~ reflexive_relstr(boole_POSet(skc18))
    | ~ transitive_relstr(boole_POSet(skc18))
    | ~ antisymmetric_relstr(boole_POSet(skc18))
    | ~ lower_bounded_relstr(boole_POSet(skc18))
    | ~ rel_str(boole_POSet(skc18))
    | ~ in(empty_set,skc19)
    | ~ filtered_subset(skc19,boole_POSet(skc18))
    | ~ upper_relstr_subset(skc19,boole_POSet(skc18))
    | ~ element(skc19,powerset(the_carrier(boole_POSet(skc18))))
    | empty_carrier(boole_POSet(skc18)) ),
    inference(rew,[status(thm),theory(equality)],[185,309]),
    [iquote('0:Rew:185.0,309.5')] ).

cnf(324,plain,
    $false,
    inference(mrr,[status(thm)],[323,121,122,123,124,89,311,149,150,187,157]),
    [iquote('0:MRR:323.0,323.1,323.2,323.3,323.4,323.5,323.6,323.7,323.8,323.9,121.0,122.0,123.0,124.0,89.0,311.0,149.0,150.0,187.0,157.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU387+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n004.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 : Sun Jun 19 09:54:38 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  
% 0.19/0.47  SPASS V 3.9 
% 0.19/0.47  SPASS beiseite: Proof found.
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.47  SPASS derived 45 clauses, backtracked 0 clauses, performed 0 splits and kept 244 clauses.
% 0.19/0.47  SPASS allocated 98061 KBytes.
% 0.19/0.47  SPASS spent	0:00:00.12 on the problem.
% 0.19/0.47  		0:00:00.04 for the input.
% 0.19/0.47  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.47  		0:00:00.00 for inferences.
% 0.19/0.47  		0:00:00.00 for the backtracking.
% 0.19/0.47  		0:00:00.01 for the reduction.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Here is a proof with depth 1, length 22 :
% 0.19/0.47  % SZS output start Refutation
% See solution above
% 0.19/0.47  Formulae used in the proof : t2_yellow19 dt_k3_yellow_1 fc8_yellow_6 t18_yellow_1 t6_boole t7_boole t8_waybel_7
% 0.19/0.47  
%------------------------------------------------------------------------------