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

View Problem - Process Solution

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

% Computer : n016.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:34:40 EDT 2022

% Result   : Theorem 0.21s 0.49s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   17 (  10 unt;   4 nHn;  17 RR)
%            Number of literals    :   28 (   0 equ;  12 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    element(skc7,skc5),
    file('SEU171+1.p',unknown),
    [] ).

cnf(6,axiom,
    element(skc6,powerset(skc5)),
    file('SEU171+1.p',unknown),
    [] ).

cnf(7,axiom,
    ~ equal(skc5,empty_set),
    file('SEU171+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ in(skc7,skc6),
    file('SEU171+1.p',unknown),
    [] ).

cnf(15,axiom,
    ~ in(skc7,subset_complement(skc5,skc6)),
    file('SEU171+1.p',unknown),
    [] ).

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

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

cnf(26,axiom,
    ( ~ element(u,powerset(v))
    | equal(subset_complement(v,u),set_difference(v,u)) ),
    file('SEU171+1.p',unknown),
    [] ).

cnf(30,axiom,
    ( ~ in(u,v)
    | ~ equal(w,set_difference(v,x))
    | in(u,w)
    | in(u,x) ),
    file('SEU171+1.p',unknown),
    [] ).

cnf(38,plain,
    ( in(skc7,skc5)
    | empty(skc5) ),
    inference(res,[status(thm),theory(equality)],[3,20]),
    [iquote('0:Res:3.0,20.0')] ).

cnf(43,plain,
    ~ empty(skc5),
    inference(res,[status(thm),theory(equality)],[17,7]),
    [iquote('0:Res:17.1,7.0')] ).

cnf(49,plain,
    equal(subset_complement(skc5,skc6),set_difference(skc5,skc6)),
    inference(res,[status(thm),theory(equality)],[6,26]),
    [iquote('0:Res:6.0,26.0')] ).

cnf(55,plain,
    in(skc7,skc5),
    inference(mrr,[status(thm)],[38,43]),
    [iquote('0:MRR:38.1,43.0')] ).

cnf(56,plain,
    ~ in(skc7,set_difference(skc5,skc6)),
    inference(rew,[status(thm),theory(equality)],[49,15]),
    [iquote('0:Rew:49.0,15.0')] ).

cnf(209,plain,
    ( ~ in(u,v)
    | in(u,set_difference(v,w))
    | in(u,w) ),
    inference(eqr,[status(thm),theory(equality)],[30]),
    [iquote('0:EqR:30.1')] ).

cnf(650,plain,
    ( ~ in(skc7,skc5)
    | in(skc7,skc6) ),
    inference(res,[status(thm),theory(equality)],[209,56]),
    [iquote('0:Res:209.1,56.0')] ).

cnf(663,plain,
    $false,
    inference(mrr,[status(thm)],[650,55,8]),
    [iquote('0:MRR:650.0,650.1,55.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU171+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n016.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jun 20 09:24:55 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.49  
% 0.21/0.49  SPASS V 3.9 
% 0.21/0.49  SPASS beiseite: Proof found.
% 0.21/0.49  % SZS status Theorem
% 0.21/0.49  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.49  SPASS derived 529 clauses, backtracked 33 clauses, performed 2 splits and kept 297 clauses.
% 0.21/0.49  SPASS allocated 98056 KBytes.
% 0.21/0.49  SPASS spent	0:00:00.13 on the problem.
% 0.21/0.49  		0:00:00.03 for the input.
% 0.21/0.49  		0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.49  		0:00:00.01 for inferences.
% 0.21/0.49  		0:00:00.00 for the backtracking.
% 0.21/0.49  		0:00:00.03 for the reduction.
% 0.21/0.49  
% 0.21/0.49  
% 0.21/0.49  Here is a proof with depth 2, length 17 :
% 0.21/0.49  % SZS output start Refutation
% See solution above
% 0.21/0.49  Formulae used in the proof : t50_subset_1 t6_boole d2_subset_1 d5_subset_1 d4_xboole_0
% 0.21/0.49  
%------------------------------------------------------------------------------