↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET933+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n028.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:29:55 EDT 2022

% Result   : Theorem 0.21s 0.46s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    8 (   5 unt;   0 nHn;   8 RR)
%            Number of literals    :   12 (   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    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    subset(u,u),
    file('SET933+1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ subset(singleton(skc3),powerset(skc3)),
    file('SET933+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ in(u,v)
    | subset(singleton(u),v) ),
    file('SET933+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ subset(u,v)
    | ~ equal(w,powerset(v))
    | in(u,w) ),
    file('SET933+1.p',unknown),
    [] ).

cnf(12,plain,
    ~ in(skc3,powerset(skc3)),
    inference(res,[status(thm),theory(equality)],[7,4]),
    [iquote('0:Res:7.1,4.0')] ).

cnf(21,plain,
    ( ~ subset(u,v)
    | in(u,powerset(v)) ),
    inference(eqr,[status(thm),theory(equality)],[10]),
    [iquote('0:EqR:10.1')] ).

cnf(22,plain,
    ~ subset(skc3,skc3),
    inference(res,[status(thm),theory(equality)],[21,12]),
    [iquote('0:Res:21.1,12.0')] ).

cnf(26,plain,
    $false,
    inference(mrr,[status(thm)],[22,3]),
    [iquote('0:MRR:22.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SET933+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n028.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sat Jul  9 17:06:41 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.46  
% 0.21/0.46  SPASS V 3.9 
% 0.21/0.46  SPASS beiseite: Proof found.
% 0.21/0.46  % SZS status Theorem
% 0.21/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.46  SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 21 clauses.
% 0.21/0.46  SPASS allocated 85115 KBytes.
% 0.21/0.46  SPASS spent	0:00:00.08 on the problem.
% 0.21/0.46  		0:00:00.03 for the input.
% 0.21/0.46  		0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.46  		0:00:00.00 for inferences.
% 0.21/0.46  		0:00:00.00 for the backtracking.
% 0.21/0.46  		0:00:00.00 for the reduction.
% 0.21/0.46  
% 0.21/0.46  
% 0.21/0.46  Here is a proof with depth 2, length 8 :
% 0.21/0.46  % SZS output start Refutation
% See solution above
% 0.21/0.46  Formulae used in the proof : reflexivity_r1_tarski t80_zfmisc_1 l2_zfmisc_1 d1_zfmisc_1
% 0.21/0.46  
%------------------------------------------------------------------------------