%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET119-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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:50 AM UTC 2026
% Result : Unsatisfiable 6.86s 1.38s
% Output : CNFRefutation 6.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 21 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 2 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_corollary_1_to_OP_determines_components1_2,axiom,
first(ordered_pair(x,y)) != ordered_pair(x,y),
file('theBenchmark.p',prove_corollary_1_to_OP_determines_components1_2) ).
cnf(c_33,plain,
first(ordered_pair(x,y)) != ordered_pair(x,y),
inference(clausify,[status(thm)],[prove_corollary_1_to_OP_determines_components1_2]) ).
fof(prove_corollary_1_to_OP_determines_components1_1,axiom,
~ member(x,universal_class),
file('theBenchmark.p',prove_corollary_1_to_OP_determines_components1_1) ).
cnf(c_34,plain,
~ member(x,universal_class),
inference(clausify,[status(thm)],[prove_corollary_1_to_OP_determines_components1_1]) ).
fof(unique_1st_and_2nd_in_pair_of_non_sets3,axiom,
! [VAR_0] :
( first(VAR_0) = VAR_0
| ordered_pair(first(VAR_0),second(VAR_0)) = VAR_0 ),
file('theBenchmark.p',unique_1st_and_2nd_in_pair_of_non_sets3) ).
cnf(c_38,plain,
( first(A) = A
| ordered_pair(first(A),second(A)) = A ),
inference(clausify,[status(thm)],[unique_1st_and_2nd_in_pair_of_non_sets3]) ).
fof(unique_1st_and_2nd_in_pair_of_non_sets1,axiom,
! [VAR_0] :
( first(VAR_0) = VAR_0
| member(ordered_pair(first(VAR_0),second(VAR_0)),cross_product(universal_class,universal_class)) ),
file('theBenchmark.p',unique_1st_and_2nd_in_pair_of_non_sets1) ).
cnf(c_40,plain,
( first(A) = A
| member(ordered_pair(first(A),second(A)),cross_product(universal_class,universal_class)) ),
inference(clausify,[status(thm)],[unique_1st_and_2nd_in_pair_of_non_sets1]) ).
fof(cartesian_product1,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( member(VAR_0,VAR_2)
| ~ member(ordered_pair(VAR_0,VAR_1),cross_product(VAR_2,VAR_3)) ),
file('theBenchmark.p',cartesian_product1) ).
cnf(c_181,plain,
( member(A,C)
| ~ member(ordered_pair(A,B),cross_product(C,D)) ),
inference(clausify,[status(thm)],[cartesian_product1]) ).
cnf(c_225,plain,
ordered_pair(first(ordered_pair(x,y)),second(ordered_pair(x,y))) = ordered_pair(x,y),
inference(resolve,[status(thm)],[c_38,c_33]) ).
cnf(c_226,plain,
member(ordered_pair(first(ordered_pair(x,y)),second(ordered_pair(x,y))),cross_product(universal_class,universal_class)),
inference(resolve,[status(thm)],[c_40,c_33]) ).
cnf(c_1485,plain,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
inference(paramod,[status(thm)],[c_225,c_226]) ).
cnf(c_3891,plain,
member(x,universal_class),
inference(resolve,[status(thm)],[c_1485,c_181]) ).
cnf(c_3890,plain,
$false,
inference(resolve,[status(thm)],[c_34,c_3891]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET119-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n011.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sat Sep 26 07:10:30 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43 % Process 4050276 was started by sandbox on n011,
% 0.17/0.43 % Sat Sep 26 07:10:30 2026
% 0.17/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 6.86/1.38
% 6.86/1.38 % SZS status Unsatisfiable for theBenchmark
% 6.86/1.38
% 6.86/1.38 % Proof 1 at 0.73 (+ 0.18) seconds.
% 6.86/1.38 % Length of proof is 9.
% 6.86/1.38 % Level of proof is 3.
% 6.86/1.38 % Maximum clause weight is 33.000.
% 6.86/1.38 % Given clauses 400.
% 6.86/1.38
% 6.86/1.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------