%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET073+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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:37 AM UTC 2026
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 25 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 4 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 3 sgn 8 !; 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(null_class_defn,axiom,
! [X] : ~ member(X,null_class),
file('theBenchmark.p',null_class_defn) ).
fof(corollary1_1,conjecture,
! [X,Y] :
( member(X,universal_class)
=> unordered_pair(X,Y) != null_class ),
file('theBenchmark.p',corollary1_1) ).
fof(corollary1_1_neg,negated_conjecture,
~ ! [X,Y] :
( member(X,universal_class)
=> unordered_pair(X,Y) != null_class ),
inference(assume_negation,[status(cth)],[corollary1_1]) ).
fof(nnf_42,plain,
? [X,Y] :
( unordered_pair(X,Y) = null_class
& member(X,universal_class) ),
inference(fof_nnf,[status(thm)],[corollary1_1_neg]) ).
fof(sk_corollary1_1_neg,plain,
( unordered_pair(sK0,sK1) = null_class
& member(sK0,universal_class) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_42]) ).
cnf(c_64,negated_conjecture,
unordered_pair(sK0,sK1) = null_class,
inference(split_conjunct,[status(thm)],[sk_corollary1_1_neg]) ).
cnf(c_65,negated_conjecture,
null_class = unordered_pair(sK0,sK1),
inference(copy,[status(thm)],[c_64]) ).
cnf(c_66,negated_conjecture,
member(sK0,universal_class),
inference(split_conjunct,[status(thm)],[sk_corollary1_1_neg]) ).
cnf(c_115,plain,
~ member(A,null_class),
inference(clausify,[status(thm)],[null_class_defn]) ).
cnf(c_116,plain,
~ member(A,unordered_pair(sK0,sK1)),
inference(paramod,[status(thm)],[c_65,c_115]) ).
cnf(c_138,plain,
( A != B
| ~ member(A,universal_class)
| member(A,unordered_pair(B,C)) ),
inference(clausify,[status(thm)],[unordered_pair_defn]) ).
cnf(c_303,plain,
( A != sK0
| ~ member(A,universal_class) ),
inference(resolve,[status(thm)],[c_138,c_116]) ).
cnf(c_304,plain,
~ member(sK0,universal_class),
inference(xxres,[status(thm)],[c_303]) ).
cnf(c_302,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_66,c_304]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET073+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 07:00:38 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 3069682 was started by sandbox2 on n007,
% 0.09/0.37 % Sat Sep 26 07:00:38 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.38
% 0.14/0.38 % From the command line: assign(max_seconds, 300).
% 0.14/0.42
% 0.14/0.42 % SZS status Theorem for theBenchmark
% 0.14/0.42
% 0.14/0.42 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.14/0.42 % Length of proof is 10.
% 0.14/0.42 % Level of proof is 4.
% 0.14/0.42 % Maximum clause weight is 11.000.
% 0.14/0.42 % Given clauses 39.
% 0.14/0.42
% 0.14/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------