TSTP Solution File: SET081-7 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n017.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:43 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(34,axiom,
    member(y__dfg,singleton(x__dfg)),
    file('SET081-7.p',unknown),
    [] ).

cnf(35,axiom,
    ~ equal(x__dfg,y__dfg),
    file('SET081-7.p',unknown),
    [] ).

cnf(43,axiom,
    ( ~ member(u,unordered_pair(v,w))
    | equal(u,w)
    | equal(u,v) ),
    file('SET081-7.p',unknown),
    [] ).

cnf(47,axiom,
    equal(unordered_pair(u,u),singleton(u)),
    file('SET081-7.p',unknown),
    [] ).

cnf(144,plain,
    ( ~ member(y__dfg,unordered_pair(u,x__dfg))
    | equal(y__dfg,u) ),
    inference(res,[status(thm),theory(equality)],[43,35]),
    [iquote('0:Res:43.2,35.0')] ).

cnf(160,plain,
    ~ member(y__dfg,unordered_pair(x__dfg,x__dfg)),
    inference(res,[status(thm),theory(equality)],[144,35]),
    [iquote('0:Res:144.1,35.0')] ).

cnf(164,plain,
    ~ member(y__dfg,singleton(x__dfg)),
    inference(rew,[status(thm),theory(equality)],[47,160]),
    [iquote('0:Rew:47.0,160.0')] ).

cnf(165,plain,
    $false,
    inference(mrr,[status(thm)],[164,34]),
    [iquote('0:MRR:164.0,34.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : SET081-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.15  % Command  : run_spass %d %s
% 0.15/0.37  % Computer : n017.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 600
% 0.15/0.37  % DateTime : Sat Jul  9 18:37:02 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.22/0.46  
% 0.22/0.46  SPASS V 3.9 
% 0.22/0.46  SPASS beiseite: Proof found.
% 0.22/0.46  % SZS status Theorem
% 0.22/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.22/0.46  SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 141 clauses.
% 0.22/0.46  SPASS allocated 75789 KBytes.
% 0.22/0.46  SPASS spent	0:00:00.07 on the problem.
% 0.22/0.46  		0:00:00.04 for the input.
% 0.22/0.46  		0:00:00.00 for the FLOTTER CNF translation.
% 0.22/0.46  		0:00:00.00 for inferences.
% 0.22/0.46  		0:00:00.00 for the backtracking.
% 0.22/0.46  		0:00:00.01 for the reduction.
% 0.22/0.46  
% 0.22/0.46  
% 0.22/0.46  Here is a proof with depth 2, length 8 :
% 0.22/0.46  % SZS output start Refutation
% See solution above
% 0.22/0.46  Formulae used in the proof : prove_only_member_in_singleton_1 prove_only_member_in_singleton_2 unordered_pair_member singleton_set
% 0.22/0.46  
%------------------------------------------------------------------------------