TSTP Solution File: SET053-6 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET053-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n003.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 05:23:10 EDT 2022

% Result   : Unsatisfiable 0.18s 0.41s
% Output   : Refutation 0.18s
% 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  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    member(ordered_pair(u__dfg,v__dfg),cross_product(x__dfg,y__dfg)),
    file('SET053-6.p',unknown),
    [] ).

cnf(2,axiom,
    ~ member(v__dfg,universal_class),
    file('SET053-6.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ member(u,v)
    | ~ subclass(v,w)
    | member(u,w) ),
    file('SET053-6.p',unknown),
    [] ).

cnf(6,axiom,
    subclass(u,universal_class),
    file('SET053-6.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ member(ordered_pair(u,v),cross_product(w,x))
    | member(v,x) ),
    file('SET053-6.p',unknown),
    [] ).

cnf(101,plain,
    ( ~ subclass(u,universal_class)
    | ~ member(v__dfg,u) ),
    inference(res,[status(thm),theory(equality)],[3,2]),
    [iquote('0:Res:3.2,2.0')] ).

cnf(105,plain,
    member(v__dfg,y__dfg),
    inference(res,[status(thm),theory(equality)],[1,17]),
    [iquote('0:Res:1.0,17.0')] ).

cnf(113,plain,
    ~ member(v__dfg,u),
    inference(mrr,[status(thm)],[101,6]),
    [iquote('0:MRR:101.0,6.0')] ).

cnf(114,plain,
    $false,
    inference(unc,[status(thm)],[113,105]),
    [iquote('0:UnC:113.0,105.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET053-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n003.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sat Jul  9 19:33:58 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.41  
% 0.18/0.41  SPASS V 3.9 
% 0.18/0.41  SPASS beiseite: Proof found.
% 0.18/0.41  % SZS status Theorem
% 0.18/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.41  SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 99 clauses.
% 0.18/0.41  SPASS allocated 75742 KBytes.
% 0.18/0.41  SPASS spent	0:00:00.07 on the problem.
% 0.18/0.41  		0:00:00.04 for the input.
% 0.18/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.41  		0:00:00.00 for inferences.
% 0.18/0.41  		0:00:00.00 for the backtracking.
% 0.18/0.41  		0:00:00.01 for the reduction.
% 0.18/0.41  
% 0.18/0.41  
% 0.18/0.41  Here is a proof with depth 1, length 9 :
% 0.18/0.41  % SZS output start Refutation
% See solution above
% 0.18/0.41  Formulae used in the proof : prove_corollary_2_to_cartesian_product_1 prove_corollary_2_to_cartesian_product_2 subclass_members class_elements_are_sets cartesian_product2
% 0.18/0.41  
%------------------------------------------------------------------------------