%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET102-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n006.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 : Unsatisfiable 0.11s 0.37s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 16 unt; 0 def)
% Number of atoms : 20 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 8 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 20 ( 4 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_unordered_pair_member_of_ordered_pair_1,axiom,
~ member(unordered_pair(x,singleton(y)),ordered_pair(x,y)),
file('theBenchmark.p',prove_unordered_pair_member_of_ordered_pair_1) ).
cnf(c_34,plain,
~ member(unordered_pair(x,singleton(y)),ordered_pair(x,y)),
inference(clausify,[status(thm)],[prove_unordered_pair_member_of_ordered_pair_1]) ).
fof(ordered_pair,axiom,
! [VAR_0,VAR_1] : unordered_pair(singleton(VAR_0),unordered_pair(VAR_0,singleton(VAR_1))) = ordered_pair(VAR_0,VAR_1),
file('theBenchmark.p',ordered_pair) ).
cnf(c_106,plain,
unordered_pair(singleton(A),unordered_pair(A,singleton(B))) = ordered_pair(A,B),
inference(clausify,[status(thm)],[ordered_pair]) ).
cnf(c_107,plain,
ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,singleton(B))),
inference(copy,[status(thm)],[c_106]) ).
fof(singleton_set,axiom,
! [VAR_0] : unordered_pair(VAR_0,VAR_0) = singleton(VAR_0),
file('theBenchmark.p',singleton_set) ).
cnf(c_108,plain,
unordered_pair(A,A) = singleton(A),
inference(clausify,[status(thm)],[singleton_set]) ).
cnf(c_109,plain,
singleton(A) = unordered_pair(A,A),
inference(copy,[status(thm)],[c_108]) ).
fof(unordered_pairs_in_universal,axiom,
! [VAR_0,VAR_1] : member(unordered_pair(VAR_0,VAR_1),universal_class),
file('theBenchmark.p',unordered_pairs_in_universal) ).
cnf(c_110,plain,
member(unordered_pair(A,B),universal_class),
inference(clausify,[status(thm)],[unordered_pairs_in_universal]) ).
fof(unordered_pair3,axiom,
! [VAR_0,VAR_1] :
( member(VAR_0,unordered_pair(VAR_1,VAR_0))
| ~ member(VAR_0,universal_class) ),
file('theBenchmark.p',unordered_pair3) ).
cnf(c_111,plain,
( member(A,unordered_pair(B,A))
| ~ member(A,universal_class) ),
inference(clausify,[status(thm)],[unordered_pair3]) ).
cnf(c_222,plain,
~ member(unordered_pair(x,unordered_pair(y,y)),ordered_pair(x,y)),
inference(paramod,[status(thm)],[c_109,c_34]) ).
cnf(c_223,plain,
~ member(unordered_pair(x,unordered_pair(y,y)),unordered_pair(singleton(x),unordered_pair(x,singleton(y)))),
inference(paramod,[status(thm)],[c_107,c_222]) ).
cnf(c_224,plain,
~ member(unordered_pair(x,unordered_pair(y,y)),unordered_pair(unordered_pair(x,x),unordered_pair(x,singleton(y)))),
inference(paramod,[status(thm)],[c_109,c_223]) ).
cnf(c_194,plain,
~ member(unordered_pair(x,unordered_pair(y,y)),unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))),
inference(paramod,[status(thm)],[c_109,c_224]) ).
cnf(c_220,plain,
member(unordered_pair(A,B),unordered_pair(C,unordered_pair(A,B))),
inference(resolve,[status(thm)],[c_111,c_110]) ).
cnf(c_221,plain,
$false,
inference(resolve,[status(thm)],[c_220,c_194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET102-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n006.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 26 07:07:25 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.34 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.34 % Process 631402 was started by sandbox2 on n006,
% 0.07/0.34 % Sat Sep 26 07:07:25 2026
% 0.07/0.34 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.07/0.35
% 0.07/0.35 % From the command line: assign(max_seconds, 300).
% 0.11/0.37
% 0.11/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.37
% 0.11/0.37 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.11/0.37 % Length of proof is 10.
% 0.11/0.37 % Level of proof is 3.
% 0.11/0.37 % Maximum clause weight is 15.000.
% 0.11/0.37 % Given clauses 26.
% 0.11/0.37
% 0.11/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------