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

% Computer : n008.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:24:04 EDT 2022

% Result   : Unsatisfiable 0.19s 0.44s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   5 unt;   0 nHn;   7 RR)
%            Number of literals    :    9 (   0 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ member(unordered_pair(x__dfg,singleton(y__dfg)),ordered_pair(x__dfg,y__dfg)),
    file('SET102-6.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ member(u,universal_class)
    | member(u,unordered_pair(v,u)) ),
    file('SET102-6.p',unknown),
    [] ).

cnf(12,axiom,
    member(unordered_pair(u,v),universal_class),
    file('SET102-6.p',unknown),
    [] ).

cnf(14,axiom,
    equal(unordered_pair(singleton(u),unordered_pair(u,singleton(v))),ordered_pair(u,v)),
    file('SET102-6.p',unknown),
    [] ).

cnf(201,plain,
    ( ~ member(unordered_pair(u,singleton(v)),universal_class)
    | member(unordered_pair(u,singleton(v)),ordered_pair(u,v)) ),
    inference(spr,[status(thm),theory(equality)],[14,11]),
    [iquote('0:SpR:14.0,11.1')] ).

cnf(206,plain,
    member(unordered_pair(u,singleton(v)),ordered_pair(u,v)),
    inference(mrr,[status(thm)],[201,12]),
    [iquote('0:MRR:201.0,12.0')] ).

cnf(207,plain,
    $false,
    inference(unc,[status(thm)],[206,1]),
    [iquote('0:UnC:206.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SET102-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.10/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 00:23:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.44  
% 0.19/0.44  SPASS V 3.9 
% 0.19/0.44  SPASS beiseite: Proof found.
% 0.19/0.44  % SZS status Theorem
% 0.19/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.44  SPASS derived 99 clauses, backtracked 0 clauses, performed 0 splits and kept 167 clauses.
% 0.19/0.44  SPASS allocated 75908 KBytes.
% 0.19/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.44  		0:00:00.04 for the input.
% 0.19/0.44  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.44  		0:00:00.00 for inferences.
% 0.19/0.44  		0:00:00.00 for the backtracking.
% 0.19/0.44  		0:00:00.02 for the reduction.
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Here is a proof with depth 1, length 7 :
% 0.19/0.44  % SZS output start Refutation
% See solution above
% 0.19/0.44  Formulae used in the proof : prove_unordered_pair_member_of_ordered_pair_1 unordered_pair3 unordered_pairs_in_universal ordered_pair
% 0.19/0.44  
%------------------------------------------------------------------------------