%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET025-7 : 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 : n003.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:24 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 6 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_ordered_pair_is_set_1,axiom,
~ member(ordered_pair(x,y),universal_class),
file('theBenchmark.p',prove_ordered_pair_is_set_1) ).
cnf(c_33,plain,
~ member(ordered_pair(x,y),universal_class),
inference(clausify,[status(thm)],[prove_ordered_pair_is_set_1]) ).
fof(unordered_pairs_and_singletons,axiom,
! [VAR_0,VAR_1] : unordered_pair(VAR_0,VAR_1) = union(singleton(VAR_0),singleton(VAR_1)),
file('theBenchmark.p',unordered_pairs_and_singletons) ).
cnf(c_34,plain,
unordered_pair(A,B) = union(singleton(A),singleton(B)),
inference(clausify,[status(thm)],[unordered_pairs_and_singletons]) ).
fof(union,axiom,
! [VAR_0,VAR_1] : complement(intersection(complement(VAR_0),complement(VAR_1))) = union(VAR_0,VAR_1),
file('theBenchmark.p',union) ).
cnf(c_162,plain,
complement(intersection(complement(A),complement(B))) = union(A,B),
inference(clausify,[status(thm)],[union]) ).
cnf(c_163,plain,
union(A,B) = complement(intersection(complement(A),complement(B))),
inference(copy,[status(thm)],[c_162]) ).
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_176,plain,
unordered_pair(singleton(A),unordered_pair(A,singleton(B))) = ordered_pair(A,B),
inference(clausify,[status(thm)],[ordered_pair]) ).
cnf(c_286,plain,
unordered_pair(singleton(A),union(singleton(A),singleton(singleton(B)))) = ordered_pair(A,B),
inference(paramod,[status(thm)],[c_34,c_176]) ).
cnf(c_287,plain,
unordered_pair(singleton(A),complement(intersection(complement(singleton(A)),complement(singleton(singleton(B)))))) = ordered_pair(A,B),
inference(paramod,[status(thm)],[c_163,c_286]) ).
cnf(c_288,plain,
union(singleton(singleton(A)),singleton(complement(intersection(complement(singleton(A)),complement(singleton(singleton(B))))))) = ordered_pair(A,B),
inference(paramod,[status(thm)],[c_34,c_287]) ).
cnf(c_289,plain,
complement(intersection(complement(singleton(singleton(A))),complement(singleton(complement(intersection(complement(singleton(A)),complement(singleton(singleton(B))))))))) = ordered_pair(A,B),
inference(paramod,[status(thm)],[c_163,c_288]) ).
cnf(c_177,plain,
ordered_pair(A,B) = complement(intersection(complement(singleton(singleton(A))),complement(singleton(complement(intersection(complement(singleton(A)),complement(singleton(singleton(B))))))))),
inference(copy,[status(thm)],[c_289]) ).
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_180,plain,
member(unordered_pair(A,B),universal_class),
inference(clausify,[status(thm)],[unordered_pairs_in_universal]) ).
cnf(c_290,plain,
member(union(singleton(A),singleton(B)),universal_class),
inference(paramod,[status(thm)],[c_34,c_180]) ).
cnf(c_181,plain,
member(complement(intersection(complement(singleton(A)),complement(singleton(B)))),universal_class),
inference(paramod,[status(thm)],[c_163,c_290]) ).
cnf(c_291,plain,
~ member(complement(intersection(complement(singleton(singleton(x))),complement(singleton(complement(intersection(complement(singleton(x)),complement(singleton(singleton(y))))))))),universal_class),
inference(paramod,[status(thm)],[c_177,c_33]) ).
cnf(c_285,plain,
$false,
inference(resolve,[status(thm)],[c_181,c_291]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET025-7 : 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.35 % Computer : n003.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.36 % CPULimit : 300
% 0.07/0.36 % WCLimit : 300
% 0.07/0.36 % DateTime : Sat Sep 26 06:56:10 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.36 % Process 2259506 was started by sandbox2 on n003,
% 0.07/0.36 % Sat Sep 26 06:56:10 2026
% 0.07/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.36
% 0.12/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.42
% 0.12/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.42
% 0.12/0.42 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.12/0.42 % Length of proof is 9.
% 0.12/0.42 % Level of proof is 3.
% 0.12/0.42 % Maximum clause weight is 21.000.
% 0.12/0.42 % Given clauses 0.
% 0.12/0.42
% 0.12/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------