%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SEU116+1 : TPTP v9.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n011.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:26:55 AM UTC 2025
% Result : Theorem 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 8 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 22 ( 9 ~; 5 |; 0 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 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 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 18 ( 16 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
tff(element_type,type,
element: ( $i * $i ) > $o ).
tff(finite_subsets_type,type,
finite_subsets: $i > $i ).
tff(finite_type,type,
finite: $i > $o ).
tff(1,plain,
( ~ ! [A: $i,B: $i] :
( element(B,finite_subsets(A))
=> finite(B) )
<=> ~ ! [A: $i,B: $i] :
( finite(B)
| ~ element(B,finite_subsets(A)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
~ ! [A: $i,B: $i] :
( element(B,finite_subsets(A))
=> finite(B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t30_finsub_1) ).
tff(3,plain,
~ ! [A: $i,B: $i] :
( finite(B)
| ~ element(B,finite_subsets(A)) ),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [A: $i,B: $i] :
rewrite(( ( element(B,finite_subsets(A))
=> finite(B) )
<=> ( finite(B)
| ~ element(B,finite_subsets(A)) ) )),
inference(bind,[status(th)],[]) ).
tff(5,plain,
( ! [A: $i,B: $i] :
( element(B,finite_subsets(A))
=> finite(B) )
<=> ! [A: $i,B: $i] :
( finite(B)
| ~ element(B,finite_subsets(A)) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,axiom,
! [A: $i,B: $i] :
( element(B,finite_subsets(A))
=> finite(B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc3_finsub_1) ).
tff(7,plain,
! [A: $i,B: $i] :
( finite(B)
| ~ element(B,finite_subsets(A)) ),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
$false,
inference(unit_resolution,[status(thm)],[7,3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU116+1 : TPTP v9.0.0. Released v3.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Jun 20 06:05:41 EDT 2025
% 0.13/0.35 % CPUTime :
% 0.13/0.38 % SZS status Theorem
% 0.13/0.38 % SZS output start Proof
% See solution above
% 0.13/0.38 % E exiting
%------------------------------------------------------------------------------