%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SET114-7 : TPTP v9.0.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat Jun 21 05:25:16 AM UTC 2025
% Result : Unsatisfiable 0.19s 0.41s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 17 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 22 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 40 ( 12 ~; 22 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 12 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
tff(x_type,type,
x: $i ).
tff(second_type,type,
second: $i > $i ).
tff(member_type,type,
member: ( $i * $i ) > $o ).
tff(cross_product_type,type,
cross_product: ( $i * $i ) > $i ).
tff(universal_class_type,type,
universal_class: $i ).
tff(ordered_pair_type,type,
ordered_pair: ( $i * $i ) > $i ).
tff(first_type,type,
first: $i > $i ).
tff(1,plain,
( ( second(x) != x )
<=> ( second(x) != x ) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
second(x) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_2nd_in_pair_of_non_sets) ).
tff(3,plain,
second(x) != x,
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
( ~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class))
<=> ~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)) ),
inference(rewrite,[status(thm)],[]) ).
tff(5,axiom,
~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets2_1) ).
tff(6,plain,
~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)),
inference(modus_ponens,[status(thm)],[5,4]) ).
tff(7,plain,
^ [X: $i] :
refl(( ( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) )
<=> ( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) ) )),
inference(bind,[status(th)],[]) ).
tff(8,plain,
( ! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) )
<=> ! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) ) ),
inference(quant_intro,[status(thm)],[7]) ).
tff(9,plain,
( ! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) )
<=> ! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(10,axiom,
! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_3) ).
tff(11,plain,
! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) ),
inference(modus_ponens,[status(thm)],[10,9]) ).
tff(12,plain,
! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) ),
inference(skolemize,[status(sab)],[11]) ).
tff(13,plain,
! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) ),
inference(modus_ponens,[status(thm)],[12,8]) ).
tff(14,plain,
( ( ~ ! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) )
| member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class))
| ( second(x) = x ) )
<=> ( ~ ! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) )
| member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class))
| ( second(x) = x ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(15,plain,
( ~ ! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) )
| member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class))
| ( second(x) = x ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(16,plain,
( ~ ! [X: $i] :
( member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class))
| ( second(X) = X ) )
| member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class))
| ( second(x) = x ) ),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
$false,
inference(unit_resolution,[status(thm)],[16,13,6,3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET114-7 : TPTP v9.0.0. Bugfixed v7.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 20 04:20:35 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Proof
% See solution above
% 0.19/0.42 % E exiting
%------------------------------------------------------------------------------