%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET077+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 : n001.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:39 AM UTC 2026
% Result : Theorem 0.08s 0.41s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 11 unt; 0 def)
% Number of atoms : 11 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 2 sgn 5 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(singletons_are_sets,conjecture,
! [X] : member(singleton(X),universal_class),
file('theBenchmark.p',singletons_are_sets) ).
fof(singletons_are_sets_neg,negated_conjecture,
~ ! [X] : member(singleton(X),universal_class),
inference(assume_negation,[status(cth)],[singletons_are_sets]) ).
fof(nnf_42,plain,
? [X] : ~ member(singleton(X),universal_class),
inference(fof_nnf,[status(thm)],[singletons_are_sets_neg]) ).
fof(sk_singletons_are_sets_neg,plain,
~ member(singleton(sK0),universal_class),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_42]) ).
cnf(c_64,negated_conjecture,
~ member(singleton(sK0),universal_class),
inference(split_conjunct,[status(thm)],[sk_singletons_are_sets_neg]) ).
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_193,negated_conjecture,
~ member(unordered_pair(sK0,sK0),universal_class),
inference(paramod,[status(thm)],[c_127,c_64]) ).
cnf(c_192,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_128,c_193]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET077+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n001.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 07:09:12 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.37 % Process 1191383 was started by sandbox2 on n001,
% 0.08/0.37 % Sat Sep 26 07:09:12 2026
% 0.08/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.38
% 0.08/0.38 % From the command line: assign(max_seconds, 300).
% 0.08/0.41
% 0.08/0.41 % SZS status Theorem for theBenchmark
% 0.08/0.41
% 0.08/0.41 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.08/0.41 % Length of proof is 7.
% 0.08/0.41 % Level of proof is 2.
% 0.08/0.41 % Maximum clause weight is 6.000.
% 0.08/0.41 % Given clauses 0.
% 0.08/0.41
% 0.08/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------