%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET073-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:38 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.41s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 10 unt; 0 def)
% Number of atoms : 14 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 8 ( 4 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_corollary_to_unordered_pair_axiom1_2,axiom,
unordered_pair(x,y) = null_class,
file('theBenchmark.p',prove_corollary_to_unordered_pair_axiom1_2) ).
cnf(c_33,plain,
unordered_pair(x,y) = null_class,
inference(clausify,[status(thm)],[prove_corollary_to_unordered_pair_axiom1_2]) ).
cnf(c_34,plain,
null_class = unordered_pair(x,y),
inference(copy,[status(thm)],[c_33]) ).
fof(prove_corollary_to_unordered_pair_axiom1_1,axiom,
member(x,universal_class),
file('theBenchmark.p',prove_corollary_to_unordered_pair_axiom1_1) ).
cnf(c_35,plain,
member(x,universal_class),
inference(clausify,[status(thm)],[prove_corollary_to_unordered_pair_axiom1_1]) ).
fof(existence_of_null_class,axiom,
! [VAR_0] : ~ member(VAR_0,null_class),
file('theBenchmark.p',existence_of_null_class) ).
cnf(c_50,plain,
~ member(A,null_class),
inference(clausify,[status(thm)],[existence_of_null_class]) ).
fof(unordered_pair2,axiom,
! [VAR_0,VAR_1] :
( member(VAR_0,unordered_pair(VAR_0,VAR_1))
| ~ member(VAR_0,universal_class) ),
file('theBenchmark.p',unordered_pair2) ).
cnf(c_139,plain,
( member(A,unordered_pair(A,B))
| ~ member(A,universal_class) ),
inference(clausify,[status(thm)],[unordered_pair2]) ).
cnf(c_176,plain,
~ member(A,unordered_pair(x,y)),
inference(paramod,[status(thm)],[c_34,c_50]) ).
cnf(c_400,plain,
member(x,unordered_pair(x,A)),
inference(resolve,[status(thm)],[c_139,c_35]) ).
cnf(c_401,plain,
$false,
inference(resolve,[status(thm)],[c_400,c_176]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET073-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % 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:03:30 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 2741490 was started by sandbox on n010,
% 0.09/0.37 % Sat Sep 26 07:03:30 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.09/0.41
% 0.09/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.41
% 0.09/0.41 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.09/0.41 % Length of proof is 8.
% 0.09/0.41 % Level of proof is 3.
% 0.09/0.41 % Maximum clause weight is 18.000.
% 0.09/0.41 % Given clauses 89.
% 0.09/0.41
% 0.09/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------