%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SET025-9 : TPTP v9.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n008.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:24:53 AM UTC 2025
% Result : Unsatisfiable 0.20s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 43 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 85 ( 35 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 70 ( 31 ~; 24 |; 0 &)
% ( 15 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 53 ( 48 !; 0 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
tff(little_set_type,type,
little_set: $i > $o ).
tff(non_ordered_pair_type,type,
non_ordered_pair: ( $i * $i ) > $i ).
tff(f3_type,type,
f3: $i > $i ).
tff(a_type,type,
a: $i ).
tff(f2_type,type,
f2: $i > $i ).
tff(singleton_set_type,type,
singleton_set: $i > $i ).
tff(ordered_pair_type,type,
ordered_pair: ( $i * $i ) > $i ).
tff(ordered_pair_predicate_type,type,
ordered_pair_predicate: $i > $o ).
tff(1,plain,
( ordered_pair_predicate(a)
<=> ordered_pair_predicate(a) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
ordered_pair_predicate(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_ordered_pair_predicate) ).
tff(3,plain,
ordered_pair_predicate(a),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [X: $i] :
refl(( ( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) )
<=> ( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) ) )),
inference(bind,[status(th)],[]) ).
tff(5,plain,
( ! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) )
<=> ! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) )
<=> ! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(7,axiom,
! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate3) ).
tff(8,plain,
! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) ),
inference(modus_ponens,[status(thm)],[7,6]) ).
tff(9,plain,
! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) ),
inference(skolemize,[status(sab)],[8]) ).
tff(10,plain,
! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) ),
inference(modus_ponens,[status(thm)],[9,5]) ).
tff(11,plain,
( ( ~ ! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) )
| ~ ordered_pair_predicate(a)
| ( a = ordered_pair(f2(a),f3(a)) ) )
<=> ( ~ ! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) )
| ~ ordered_pair_predicate(a)
| ( a = ordered_pair(f2(a),f3(a)) ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(12,plain,
( ~ ! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) )
| ~ ordered_pair_predicate(a)
| ( a = ordered_pair(f2(a),f3(a)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(13,plain,
( ~ ! [X: $i] :
( ~ ordered_pair_predicate(X)
| ( X = ordered_pair(f2(X),f3(X)) ) )
| ~ ordered_pair_predicate(a)
| ( a = ordered_pair(f2(a),f3(a)) ) ),
inference(modus_ponens,[status(thm)],[12,11]) ).
tff(14,plain,
a = ordered_pair(f2(a),f3(a)),
inference(unit_resolution,[status(thm)],[13,10,3]) ).
tff(15,plain,
ordered_pair(f2(a),f3(a)) = a,
inference(symmetry,[status(thm)],[14]) ).
tff(16,plain,
^ [Y: $i,X: $i] :
refl(( ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) )
<=> ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) ) )),
inference(bind,[status(th)],[]) ).
tff(17,plain,
( ! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) )
<=> ! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) ) ),
inference(quant_intro,[status(thm)],[16]) ).
tff(18,plain,
( ! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) )
<=> ! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(19,axiom,
! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair) ).
tff(20,plain,
! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) ),
inference(modus_ponens,[status(thm)],[19,18]) ).
tff(21,plain,
! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) ),
inference(skolemize,[status(sab)],[20]) ).
tff(22,plain,
! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) ),
inference(modus_ponens,[status(thm)],[21,17]) ).
tff(23,plain,
( ~ ! [Y: $i,X: $i] : ( ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)) )
| ( ordered_pair(f2(a),f3(a)) = non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(24,plain,
ordered_pair(f2(a),f3(a)) = non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))),
inference(unit_resolution,[status(thm)],[23,22]) ).
tff(25,plain,
non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))) = ordered_pair(f2(a),f3(a)),
inference(symmetry,[status(thm)],[24]) ).
tff(26,plain,
non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))) = a,
inference(transitivity,[status(thm)],[25,15]) ).
tff(27,plain,
( little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))))
<=> little_set(a) ),
inference(monotonicity,[status(thm)],[26]) ).
tff(28,plain,
( little_set(a)
<=> little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))) ),
inference(symmetry,[status(thm)],[27]) ).
tff(29,plain,
( ~ little_set(a)
<=> ~ little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))) ),
inference(monotonicity,[status(thm)],[28]) ).
tff(30,plain,
( ~ little_set(a)
<=> ~ little_set(a) ),
inference(rewrite,[status(thm)],[]) ).
tff(31,axiom,
~ little_set(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_predicate_is_small) ).
tff(32,plain,
~ little_set(a),
inference(modus_ponens,[status(thm)],[31,30]) ).
tff(33,plain,
~ little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))),
inference(modus_ponens,[status(thm)],[32,29]) ).
tff(34,plain,
^ [Y: $i,X: $i] :
refl(( little_set(non_ordered_pair(X,Y))
<=> little_set(non_ordered_pair(X,Y)) )),
inference(bind,[status(th)],[]) ).
tff(35,plain,
( ! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y))
<=> ! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y)) ),
inference(quant_intro,[status(thm)],[34]) ).
tff(36,plain,
( ! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y))
<=> ! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y)) ),
inference(rewrite,[status(thm)],[]) ).
tff(37,axiom,
! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair4) ).
tff(38,plain,
! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y)),
inference(modus_ponens,[status(thm)],[37,36]) ).
tff(39,plain,
! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y)),
inference(skolemize,[status(sab)],[38]) ).
tff(40,plain,
! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y)),
inference(modus_ponens,[status(thm)],[39,35]) ).
tff(41,plain,
( ~ ! [Y: $i,X: $i] : little_set(non_ordered_pair(X,Y))
| little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(42,plain,
little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))),
inference(unit_resolution,[status(thm)],[41,40]) ).
tff(43,plain,
$false,
inference(unit_resolution,[status(thm)],[42,33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET025-9 : TPTP v9.0.0. Released v1.0.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n008.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:03:18 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.20/0.41 % SZS status Unsatisfiable
% 0.20/0.41 % SZS output start Proof
% See solution above
% 0.20/0.42 % E exiting
%------------------------------------------------------------------------------