%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SET639+3 : TPTP v9.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.9YknfEfroL true
% 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 : Thu Oct 2 04:52:32 PM UTC 2025
% Result : Theorem 0.49s 0.92s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 20 ( 13 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 4 ~; 2 |; 2 &; 32 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 ^; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk__4_type,type,
sk__4: $i ).
thf(intersection_type,type,
intersection: $i > $i > $i ).
thf(empty_set_type,type,
empty_set: $i ).
thf(subset_type,type,
subset: $i > $i > $o ).
thf(sk__3_type,type,
sk__3: $i ).
thf(prove_th121,conjecture,
! [B: $i,C: $i] :
( ( ( subset @ B @ C )
& ( ( intersection @ C @ B )
= empty_set ) )
=> ( B = empty_set ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [B: $i,C: $i] :
( ( ( subset @ B @ C )
& ( ( intersection @ C @ B )
= empty_set ) )
=> ( B = empty_set ) ),
inference('cnf.neg',[status(esa)],[prove_th121]) ).
thf(zip_derived_cl19,plain,
( ( intersection @ sk__4 @ sk__3 )
= empty_set ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(commutativity_of_intersection,axiom,
! [B: $i,C: $i] :
( ( intersection @ B @ C )
= ( intersection @ C @ B ) ) ).
thf(zip_derived_cl11,plain,
! [X0: $i,X1: $i] :
( ( intersection @ X1 @ X0 )
= ( intersection @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[commutativity_of_intersection]) ).
thf(zip_derived_cl94,plain,
( empty_set
= ( intersection @ sk__3 @ sk__4 ) ),
inference('sup+',[status(thm)],[zip_derived_cl19,zip_derived_cl11]) ).
thf(subset_intersection,axiom,
! [B: $i,C: $i] :
( ( subset @ B @ C )
=> ( ( intersection @ B @ C )
= B ) ) ).
thf(zip_derived_cl0,plain,
! [X0: $i,X1: $i] :
( ( ( intersection @ X0 @ X1 )
= X0 )
| ~ ( subset @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[subset_intersection]) ).
thf(zip_derived_cl102,plain,
( ( empty_set = sk__3 )
| ~ ( subset @ sk__3 @ sk__4 ) ),
inference('sup+',[status(thm)],[zip_derived_cl94,zip_derived_cl0]) ).
thf(zip_derived_cl20,plain,
subset @ sk__3 @ sk__4,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl103,plain,
empty_set = sk__3,
inference(demod,[status(thm)],[zip_derived_cl102,zip_derived_cl20]) ).
thf(zip_derived_cl21,plain,
sk__3 != empty_set,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl104,plain,
$false,
inference('simplify_reflect-',[status(thm)],[zip_derived_cl103,zip_derived_cl21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET639+3 : TPTP v9.2.0. Released v2.2.0.
% 0.00/0.11 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.9YknfEfroL true
% 0.10/0.31 % Computer : n008.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Wed Oct 1 13:14:38 EDT 2025
% 0.10/0.32 % CPUTime :
% 0.10/0.32 % Running portfolio for 300 s
% 0.10/0.32 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.32 % Number of cores: 8
% 0.10/0.32 % Python version: Python 3.6.8
% 0.10/0.32 % Running in FO mode
% 0.48/0.62 % Total configuration time : 435
% 0.48/0.62 % Estimated wc time : 1092
% 0.48/0.62 % Estimated cpu time (7 cpus) : 156.0
% 0.48/0.86 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.48/0.86 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.48/0.86 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.48/0.86 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.48/0.86 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.49/0.87 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.49/0.89 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.49/0.92 % Solved by fo/fo3_bce.sh.
% 0.49/0.92 % BCE start: 22
% 0.49/0.92 % BCE eliminated: 0
% 0.49/0.92 % PE start: 22
% 0.49/0.92 logic: eq
% 0.49/0.92 % PE eliminated: 1
% 0.49/0.92 % done 11 iterations in 0.015s
% 0.49/0.92 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.49/0.92 % SZS output start Refutation
% See solution above
% 0.49/0.92
% 0.49/0.92
% 0.49/0.92 % Terminating...
% 0.52/1.03 % Runner terminated.
% 0.52/1.05 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------