%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET102+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:35:47 AM UTC 2026
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 17 unt; 0 def)
% Number of atoms : 26 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 11 ~; 4 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 5 sgn 12 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(unordered_pair_defn,axiom,
! [U,X,Y] :
( member(U,unordered_pair(X,Y))
<=> ( ( U = Y
| U = X )
& member(U,universal_class) ) ),
file('theBenchmark.p',unordered_pair_defn) ).
fof(unordered_pair,axiom,
! [X,Y] : member(unordered_pair(X,Y),universal_class),
file('theBenchmark.p',unordered_pair) ).
fof(singleton_set_defn,axiom,
! [X] : singleton(X) = unordered_pair(X,X),
file('theBenchmark.p',singleton_set_defn) ).
fof(ordered_pair_defn,axiom,
! [X,Y] : ordered_pair(X,Y) = unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),
file('theBenchmark.p',ordered_pair_defn) ).
fof(unordered_pair_member_of_ordered_pair,conjecture,
! [X,Y] : member(unordered_pair(X,singleton(Y)),ordered_pair(X,Y)),
file('theBenchmark.p',unordered_pair_member_of_ordered_pair) ).
fof(unordered_pair_member_of_ordered_pair_neg,negated_conjecture,
~ ! [X,Y] : member(unordered_pair(X,singleton(Y)),ordered_pair(X,Y)),
inference(assume_negation,[status(cth)],[unordered_pair_member_of_ordered_pair]) ).
fof(nnf_42,plain,
? [X,Y] : ~ member(unordered_pair(X,singleton(Y)),ordered_pair(X,Y)),
inference(fof_nnf,[status(thm)],[unordered_pair_member_of_ordered_pair_neg]) ).
fof(sk_unordered_pair_member_of_ordered_pair_neg,plain,
~ member(unordered_pair(sK0,singleton(sK1)),ordered_pair(sK0,sK1)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_42]) ).
cnf(c_64,negated_conjecture,
~ member(unordered_pair(sK0,singleton(sK1)),ordered_pair(sK0,sK1)),
inference(split_conjunct,[status(thm)],[sk_unordered_pair_member_of_ordered_pair_neg]) ).
cnf(c_126,plain,
ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,singleton(B))),
inference(clausify,[status(thm)],[ordered_pair_defn]) ).
cnf(c_127,plain,
singleton(A) = unordered_pair(A,A),
inference(clausify,[status(thm)],[singleton_set_defn]) ).
cnf(c_128,plain,
member(unordered_pair(A,B),universal_class),
inference(clausify,[status(thm)],[unordered_pair]) ).
cnf(c_129,plain,
( A != C
| ~ member(A,universal_class)
| member(A,unordered_pair(B,C)) ),
inference(clausify,[status(thm)],[unordered_pair_defn]) ).
cnf(c_304,negated_conjecture,
~ member(unordered_pair(sK0,unordered_pair(sK1,sK1)),ordered_pair(sK0,sK1)),
inference(paramod,[status(thm)],[c_127,c_64]) ).
cnf(c_305,negated_conjecture,
~ member(unordered_pair(sK0,unordered_pair(sK1,sK1)),unordered_pair(singleton(sK0),unordered_pair(sK0,singleton(sK1)))),
inference(paramod,[status(thm)],[c_126,c_304]) ).
cnf(c_306,negated_conjecture,
~ member(unordered_pair(sK0,unordered_pair(sK1,sK1)),unordered_pair(unordered_pair(sK0,sK0),unordered_pair(sK0,singleton(sK1)))),
inference(paramod,[status(thm)],[c_127,c_305]) ).
cnf(c_190,negated_conjecture,
~ member(unordered_pair(sK0,unordered_pair(sK1,sK1)),unordered_pair(unordered_pair(sK0,sK0),unordered_pair(sK0,unordered_pair(sK1,sK1)))),
inference(paramod,[status(thm)],[c_127,c_306]) ).
cnf(c_307,plain,
( unordered_pair(A,B) != D
| member(unordered_pair(A,B),unordered_pair(C,D)) ),
inference(resolve,[status(thm)],[c_129,c_128]) ).
cnf(c_302,plain,
member(unordered_pair(A,B),unordered_pair(C,unordered_pair(A,B))),
inference(xxres,[status(thm)],[c_307]) ).
cnf(c_303,plain,
$false,
inference(resolve,[status(thm)],[c_302,c_190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET102+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 07:07:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 1078365 was started by sandbox on n004,
% 0.10/0.37 % Sat Sep 26 07:07:37 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.38
% 0.15/0.38 % From the command line: assign(max_seconds, 300).
% 0.15/0.42
% 0.15/0.42 % SZS status Theorem for theBenchmark
% 0.15/0.42
% 0.15/0.42 % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.15/0.42 % Length of proof is 13.
% 0.15/0.42 % Level of proof is 3.
% 0.15/0.42 % Maximum clause weight is 55.000.
% 0.15/0.42 % Given clauses 38.
% 0.15/0.42
% 0.15/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------