%------------------------------------------------------------------------------
% File       : SPASS---3.7
% Problem    : SET780-1 : TPTP v6.0.0. Released v2.5.0.
% Transform  : none
% Format     : tptp
% Command    : run_spass %d %s

% Computer   : n031.star.cs.uiowa.edu
% Model      : x86_64 x86_64
% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory     : 16127.75MB
% OS         : Linux 2.6.32-431.1.2.el6.x86_64
% CPULimit   : 300s
% DateTime   : Fri Apr  4 05:54:39 EDT 2014

% Result     : Satisfiable 1.07s
% Output     : Saturation 1.07s
% Verified   : 
% Statistics : ERROR: Analysing output (Could not find formula named 30)

% Comments   : 
%------------------------------------------------------------------------------
cnf(31,plain,
    ( member(k(U,V,U),V)
    | difference(U,V,U) ),
    inference(mrr,[status(thm)],[30,18]),
    [iquote('0:MRR:30.0,18.0')]).

cnf(12,axiom,
    ( ~ member(k(U,V,W),U)
    | ~ member(k(U,V,W),W)
    | member(k(U,V,W),V)
    | difference(U,V,W) ),
    file('SET780-1.p',unknown),
    []).

cnf(23,plain,
    ( member(k(U,U,V),V)
    | difference(U,U,V) ),
    inference(obv,[status(thm),theory(equality)],[20]),
    [iquote('0:Obv:20.1')]).

cnf(11,axiom,
    ( ~ member(k(U,V,W),V)
    | member(k(U,V,W),W)
    | difference(U,V,W) ),
    file('SET780-1.p',unknown),
    []).

cnf(18,plain,
    ( member(k(U,V,U),U)
    | difference(U,V,U) ),
    inference(fac,[status(thm)],[10]),
    [iquote('0:Fac:10.0,10.1')]).

cnf(10,axiom,
    ( member(k(U,V,W),W)
    | member(k(U,V,W),U)
    | difference(U,V,W) ),
    file('SET780-1.p',unknown),
    []).

cnf(9,axiom,
    ( ~ member(U,V)
    | ~ difference(V,W,X)
    | member(U,W)
    | member(U,X) ),
    file('SET780-1.p',unknown),
    []).

cnf(8,axiom,
    ( ~ member(U,V)
    | ~ member(U,W)
    | ~ difference(X,W,V) ),
    file('SET780-1.p',unknown),
    []).

cnf(7,axiom,
    ( ~ member(U,V)
    | ~ difference(W,X,V)
    | member(U,W) ),
    file('SET780-1.p',unknown),
    []).

cnf(1,axiom,
    ( ~ subset(U,V)
    | ~ member(W,U)
    | member(W,V) ),
    file('SET780-1.p',unknown),
    []).

cnf(14,plain,
    ( subset(U,U) ),
    inference(obv,[status(thm),theory(equality)],[13]),
    [iquote('0:Obv:13.0')]).

cnf(6,axiom,
    ( ~ subset(U,V)
    | ~ subset(V,U)
    | equal_sets(U,V) ),
    file('SET780-1.p',unknown),
    []).

cnf(3,axiom,
    ( ~ member(member_of_1_not_of_2(U,V),V)
    | subset(U,V) ),
    file('SET780-1.p',unknown),
    []).

cnf(2,axiom,
    ( subset(U,V)
    | member(member_of_1_not_of_2(U,V),U) ),
    file('SET780-1.p',unknown),
    []).

cnf(4,axiom,
    ( ~ equal_sets(U,V)
    | subset(U,V) ),
    file('SET780-1.p',unknown),
    []).

cnf(5,axiom,
    ( ~ equal_sets(U,V)
    | subset(V,U) ),
    file('SET780-1.p',unknown),
    []).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem    : SET780-1 : TPTP v6.0.0. Released v2.5.0.
% % Command    : run_spass %d %s
% % Computer   : n031.star.cs.uiowa.edu
% % Model      : x86_64 x86_64
% % CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory     : 16127.75MB
% % OS         : Linux 2.6.32-431.1.2.el6.x86_64
% % CPULimit   : 300
% % DateTime   : Wed Apr  2 23:45:30 CDT 2014
% % CPUTime    : 1.07 
% 
% SPASS V 3.7 
% SPASS beiseite: Completion found.
% % SZS status CounterSatisfiable
% Problem: /export/starexec/sandbox/benchmark/SET780-1.p 
% SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% SPASS allocated 20636 KBytes.
% SPASS spent	0:00:00.01 on the problem.
% 0:00:00.01 for the input.
% 0:00:00.00 for the FLOTTER CNF translation.
% 0:00:00.00 for inferences.
% 0:00:00.00 for the backtracking.
% 0:00:00.00 for the reduction.
% 
% 
% The saturated set of worked-off clauses is :
% % SZS output start Saturation
% 31[0:MRR:30.0,18.0] ||  -> member(k(U,V,U),V)* difference(U,V,U).
% 12[0:Inp] || member(k(U,V,W),U)*+ member(k(U,V,W),W)* -> member(k(U,V,W),V)* difference(U,V,W).
% 23[0:Obv:20.1] ||  -> member(k(U,U,V),V)* difference(U,U,V).
% 11[0:Inp] || member(k(U,V,W),V)*+ -> member(k(U,V,W),W)* difference(U,V,W).
% 18[0:Fac:10.0,10.1] ||  -> member(k(U,V,U),U)* difference(U,V,U).
% 10[0:Inp] ||  -> member(k(U,V,W),W)* member(k(U,V,W),U)* difference(U,V,W).
% 9[0:Inp] || member(U,V)* difference(V,W,X)*+ -> member(U,W)* member(U,X)*.
% 8[0:Inp] || member(U,V)* member(U,W)* difference(X,W,V)*+ -> .
% 7[0:Inp] || member(U,V)* difference(W,X,V)*+ -> member(U,W)*.
% 1[0:Inp] || subset(U,V)*+ member(W,U)* -> member(W,V)*.
% 14[0:Obv:13.0] ||  -> subset(U,U)*.
% 6[0:Inp] || subset(U,V) subset(V,U) -> equal_sets(U,V)*.
% 3[0:Inp] || member(member_of_1_not_of_2(U,V),V)* -> subset(U,V).
% 2[0:Inp] ||  -> subset(U,V) member(member_of_1_not_of_2(U,V),U)*.
% 4[0:Inp] || equal_sets(U,V)* -> subset(U,V).
% 5[0:Inp] || equal_sets(U,V)* -> subset(V,U).
% % SZS output end Saturation
% 
% EOF
%------------------------------------------------------------------------------