%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SET612^3 : TPTP v9.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.dNs1Xm2Mc7 true
% Computer : n017.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:25 PM UTC 2025
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 122 ( 22 equ; 29 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 245 ( 49 ~; 16 |; 41 &; 133 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 7 usr; 5 con; 0-3 aty)
% ( 6 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 56 ( 47 ^; 9 !; 0 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(intersection_type,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(union_type,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf('#sk1_type',type,
'#sk1': $i > $o ).
thf('#sk2_type',type,
'#sk2': $i > $o ).
thf('#sk4_type',type,
'#sk4': $i ).
thf('#sk3_type',type,
'#sk3': $i > $o ).
thf(setminus_type,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(setminus,axiom,
( setminus
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
& ~ ( Y @ U ) ) ) ) ).
thf('0',plain,
( setminus
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
& ~ ( Y @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[setminus]) ).
thf('1',plain,
( setminus
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
( ( V_1 @ V_3 )
& ~ ( V_2 @ V_3 ) ) ) ),
define([status(thm)]) ).
thf(intersection,axiom,
( intersection
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
& ( Y @ U ) ) ) ) ).
thf('2',plain,
( intersection
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
& ( Y @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[intersection]) ).
thf('3',plain,
( intersection
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
( ( V_1 @ V_3 )
& ( V_2 @ V_3 ) ) ) ),
define([status(thm)]) ).
thf(union,axiom,
( union
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
| ( Y @ U ) ) ) ) ).
thf('4',plain,
( union
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
| ( Y @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[union]) ).
thf('5',plain,
( union
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
( ( V_1 @ V_3 )
| ( V_2 @ V_3 ) ) ) ),
define([status(thm)]) ).
thf(thm,conjecture,
! [X: $i > $o,Y: $i > $o,Z: $i > $o] :
( ( setminus @ X @ ( union @ Y @ Z ) )
= ( intersection @ ( setminus @ X @ Y ) @ ( setminus @ X @ Z ) ) ) ).
thf(zf_stmt_0,conjecture,
! [X4: $i > $o,X6: $i > $o,X8: $i > $o] :
( ( ^ [V_1: $i] :
( ~ ( ( X8 @ V_1 )
| ( X6 @ V_1 ) )
& ( X4 @ V_1 ) ) )
= ( ^ [V_2: $i] :
( ~ ( X6 @ V_2 )
& ~ ( X8 @ V_2 )
& ( X4 @ V_2 ) ) ) ) ).
thf(zf_stmt_1,negated_conjecture,
~ ! [X4: $i > $o,X6: $i > $o,X8: $i > $o] :
( ( ^ [V_1: $i] :
( ~ ( ( X8 @ V_1 )
| ( X6 @ V_1 ) )
& ( X4 @ V_1 ) ) )
= ( ^ [V_2: $i] :
( ~ ( X6 @ V_2 )
& ~ ( X8 @ V_2 )
& ( X4 @ V_2 ) ) ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl0,plain,
~ ( !!
@ ^ [Y0: $i > $o] :
( !!
@ ^ [Y1: $i > $o] :
( !!
@ ^ [Y2: $i > $o] :
( ( ^ [Y3: $i] :
( ( (~)
@ ( ( Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
& ( Y0 @ Y3 ) ) )
= ( ^ [Y3: $i] :
( ( (~) @ ( Y1 @ Y3 ) )
& ( (~) @ ( Y2 @ Y3 ) )
& ( Y0 @ Y3 ) ) ) ) ) ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl1,plain,
~ ( !!
@ ^ [Y0: $i > $o] :
( !!
@ ^ [Y1: $i > $o] :
( ( ^ [Y2: $i] :
( ( (~)
@ ( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) )
& ( '#sk1' @ Y2 ) ) )
= ( ^ [Y2: $i] :
( ( (~) @ ( Y0 @ Y2 ) )
& ( (~) @ ( Y1 @ Y2 ) )
& ( '#sk1' @ Y2 ) ) ) ) ) ),
inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl0]) ).
thf(zip_derived_cl2,plain,
~ ( !!
@ ^ [Y0: $i > $o] :
( ( ^ [Y1: $i] :
( ( (~)
@ ( ( Y0 @ Y1 )
| ( '#sk2' @ Y1 ) ) )
& ( '#sk1' @ Y1 ) ) )
= ( ^ [Y1: $i] :
( ( (~) @ ( '#sk2' @ Y1 ) )
& ( (~) @ ( Y0 @ Y1 ) )
& ( '#sk1' @ Y1 ) ) ) ) ),
inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl1]) ).
thf(zip_derived_cl3,plain,
( ( ^ [Y0: $i] :
( ( (~)
@ ( ( '#sk3' @ Y0 )
| ( '#sk2' @ Y0 ) ) )
& ( '#sk1' @ Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( (~) @ ( '#sk2' @ Y0 ) )
& ( (~) @ ( '#sk3' @ Y0 ) )
& ( '#sk1' @ Y0 ) ) ) ),
inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl2]) ).
thf(zip_derived_cl4,plain,
( ( ^ [Y0: $i] :
( ( (~)
@ ( ( '#sk3' @ Y0 )
| ( '#sk2' @ Y0 ) ) )
& ( '#sk1' @ Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( (~) @ ( '#sk2' @ Y0 ) )
& ( (~) @ ( '#sk3' @ Y0 ) )
& ( '#sk1' @ Y0 ) ) ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl3]) ).
thf(zip_derived_cl5,plain,
( ( ( (~)
@ ( ( '#sk3' @ '#sk4' )
| ( '#sk2' @ '#sk4' ) ) )
& ( '#sk1' @ '#sk4' ) )
!= ( ( (~) @ ( '#sk2' @ '#sk4' ) )
& ( (~) @ ( '#sk3' @ '#sk4' ) )
& ( '#sk1' @ '#sk4' ) ) ),
inference(neg_ext,[status(thm)],[zip_derived_cl4]) ).
thf(zip_derived_cl5_001,plain,
( ( ( (~)
@ ( ( '#sk3' @ '#sk4' )
| ( '#sk2' @ '#sk4' ) ) )
& ( '#sk1' @ '#sk4' ) )
!= ( ( (~) @ ( '#sk2' @ '#sk4' ) )
& ( (~) @ ( '#sk3' @ '#sk4' ) )
& ( '#sk1' @ '#sk4' ) ) ),
inference(neg_ext,[status(thm)],[zip_derived_cl4]) ).
thf(zip_derived_cl8,plain,
( ( '#sk2' @ '#sk4' )
| ( ( ( (~)
@ ( ( '#sk3' @ '#sk4' )
| $false ) )
& ( '#sk1' @ '#sk4' ) )
!= ( ( (~) @ $false )
& ( (~) @ ( '#sk3' @ '#sk4' ) )
& ( '#sk1' @ '#sk4' ) ) ) ),
inference(bool_hoist,[status(thm)],[zip_derived_cl5]) ).
thf(zip_derived_cl9,plain,
( ( '#sk2' @ '#sk4' )
| ( ( ( (~) @ ( '#sk3' @ '#sk4' ) )
& ( '#sk1' @ '#sk4' ) )
!= ( ( (~) @ ( '#sk3' @ '#sk4' ) )
& ( '#sk1' @ '#sk4' ) ) ) ),
inference('simplify boolean subterms',[status(thm)],[zip_derived_cl8]) ).
thf(zip_derived_cl10,plain,
'#sk2' @ '#sk4',
inference(simplify,[status(thm)],[zip_derived_cl9]) ).
thf(zip_derived_cl10_002,plain,
'#sk2' @ '#sk4',
inference(simplify,[status(thm)],[zip_derived_cl9]) ).
thf(zip_derived_cl11,plain,
( ( ( (~)
@ ( ( '#sk3' @ '#sk4' )
| $true ) )
& ( '#sk1' @ '#sk4' ) )
!= ( ( (~) @ $true )
& ( (~) @ ( '#sk3' @ '#sk4' ) )
& ( '#sk1' @ '#sk4' ) ) ),
inference(demod,[status(thm)],[zip_derived_cl5,zip_derived_cl10,zip_derived_cl10]) ).
thf(zip_derived_cl12,plain,
$false,
inference('simplify boolean subterms',[status(thm)],[zip_derived_cl11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET612^3 : TPTP v9.2.0. Released v3.6.0.
% 0.06/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.dNs1Xm2Mc7 true
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Oct 1 13:21:53 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running portfolio for 300 s
% 0.12/0.34 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35 % Number of cores: 8
% 0.12/0.35 % Python version: Python 3.6.8
% 0.12/0.35 % Running in HO mode
% 0.55/0.67 % Total configuration time : 828
% 0.55/0.67 % Estimated wc time : 1656
% 0.55/0.67 % Estimated cpu time (8 cpus) : 207.0
% 0.55/0.71 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.55/0.72 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.55/0.75 % Solved by lams/35_full_unif4.sh.
% 0.55/0.75 % done 2 iterations in 0.012s
% 0.55/0.75 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.55/0.75 % SZS output start Refutation
% See solution above
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75 % Terminating...
% 0.68/0.86 % Runner terminated.
% 0.68/0.87 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------