%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SET907^7 : TPTP v9.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.C5gin0aLIs true
% Computer : n023.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:53:07 PM UTC 2025
% Result : Theorem 1.48s 1.01s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 43 ( 32 unt; 0 typ; 0 def)
% Number of atoms : 150 ( 21 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 352 ( 36 ~; 27 |; 0 &; 275 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 84 ( 50 ^; 34 !; 0 ?; 84 :)
% Comments :
%------------------------------------------------------------------------------
thf(mu_type,type,
mu: $tType ).
thf(sk__11_type,type,
sk__11: mu ).
thf(sk__13_type,type,
sk__13: mu ).
thf(unordered_pair_type,type,
unordered_pair: mu > mu > mu ).
thf(mforall_ind_type,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(set_union2_type,type,
set_union2: mu > mu > mu ).
thf(mnot_type,type,
mnot: ( $i > $o ) > $i > $o ).
thf(mor_type,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(sk__10_type,type,
sk__10: $i ).
thf(mimplies_type,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(in_type,type,
in: mu > mu > $i > $o ).
thf(exists_in_world_type,type,
exists_in_world: mu > $i > $o ).
thf(qmltpeq_type,type,
qmltpeq: mu > mu > $i > $o ).
thf(sk__12_type,type,
sk__12: mu ).
thf(mequiv_type,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mand_type,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(subset_type,type,
subset: mu > mu > $i > $o ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid,axiom,
( mvalid
= ( ^ [Phi: $i > $o] :
! [W: $i] : ( Phi @ W ) ) ) ).
thf('0',plain,
( mvalid
= ( ^ [Phi: $i > $o] :
! [W: $i] : ( Phi @ W ) ) ),
inference(simplify_rw_rule,[status(thm)],[mvalid]) ).
thf('1',plain,
( mvalid
= ( ^ [V_1: $i > $o] :
! [X4: $i] : ( V_1 @ X4 ) ) ),
define([status(thm)]) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [Phi: mu > $i > $o,W: $i] :
! [X: mu] :
( ( exists_in_world @ X @ W )
=> ( Phi @ X @ W ) ) ) ) ).
thf('2',plain,
( mforall_ind
= ( ^ [Phi: mu > $i > $o,W: $i] :
! [X: mu] :
( ( exists_in_world @ X @ W )
=> ( Phi @ X @ W ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mforall_ind]) ).
thf('3',plain,
( mforall_ind
= ( ^ [V_1: mu > $i > $o,V_2: $i] :
! [X4: mu] :
( ( exists_in_world @ X4 @ V_2 )
=> ( V_1 @ X4 @ V_2 ) ) ) ),
define([status(thm)]) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).
thf(mor,axiom,
( mor
= ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
( ( Phi @ W )
| ( Psi @ W ) ) ) ) ).
thf('4',plain,
( mor
= ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
( ( Phi @ W )
| ( Psi @ W ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mor]) ).
thf('5',plain,
( mor
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
( ( V_1 @ V_3 )
| ( V_2 @ V_3 ) ) ) ),
define([status(thm)]) ).
thf(mnot,axiom,
( mnot
= ( ^ [Phi: $i > $o,W: $i] :
~ ( Phi @ W ) ) ) ).
thf('6',plain,
( mnot
= ( ^ [Phi: $i > $o,W: $i] :
~ ( Phi @ W ) ) ),
inference(simplify_rw_rule,[status(thm)],[mnot]) ).
thf('7',plain,
( mnot
= ( ^ [V_1: $i > $o,V_2: $i] :
~ ( V_1 @ V_2 ) ) ),
define([status(thm)]) ).
thf('8',plain,
( mimplies
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ),
inference(simplify_rw_rule,[status(thm)],[mimplies,'5','7']) ).
thf('9',plain,
( mimplies
= ( ^ [V_1: $i > $o,V_2: $i > $o] : ( mor @ ( mnot @ V_1 ) @ V_2 ) ) ),
define([status(thm)]) ).
thf(mand,axiom,
( mand
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ) ).
thf('10',plain,
( mand
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mand,'5','7']) ).
thf('11',plain,
( mand
= ( ^ [V_1: $i > $o,V_2: $i > $o] : ( mnot @ ( mor @ ( mnot @ V_1 ) @ ( mnot @ V_2 ) ) ) ) ),
define([status(thm)]) ).
thf('12',plain,
( mequiv
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mequiv,'9','11','5','7']) ).
thf('13',plain,
( mequiv
= ( ^ [V_1: $i > $o,V_2: $i > $o] : ( mand @ ( mimplies @ V_1 @ V_2 ) @ ( mimplies @ V_2 @ V_1 ) ) ) ),
define([status(thm)]) ).
thf(t38_zfmisc_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [A: mu] :
( mforall_ind
@ ^ [B: mu] :
( mforall_ind
@ ^ [C: mu] : ( mequiv @ ( subset @ ( unordered_pair @ A @ B ) @ C ) @ ( mand @ ( in @ A @ C ) @ ( in @ B @ C ) ) ) ) ) ) ) ).
thf(zf_stmt_0,axiom,
! [X4: $i,X6: mu] :
( ( exists_in_world @ X6 @ X4 )
=> ! [X8: mu] :
( ( exists_in_world @ X8 @ X4 )
=> ! [X10: mu] :
( ( exists_in_world @ X10 @ X4 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X6 @ X8 ) @ X10 @ X4 )
| ~ ( ~ ( in @ X6 @ X10 @ X4 )
| ~ ( in @ X8 @ X10 @ X4 ) ) )
| ~ ( ~ ( in @ X8 @ X10 @ X4 )
| ~ ( in @ X6 @ X10 @ X4 )
| ( subset @ ( unordered_pair @ X6 @ X8 ) @ X10 @ X4 ) ) ) ) ) ) ).
thf(zip_derived_cl30,plain,
! [X0: mu,X1: $i,X2: mu,X3: mu] :
( ~ ( exists_in_world @ X0 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X0 ) @ X3 @ X1 )
| ~ ( in @ X2 @ X3 @ X1 )
| ~ ( in @ X0 @ X3 @ X1 )
| ~ ( exists_in_world @ X3 @ X1 )
| ~ ( exists_in_world @ X2 @ X1 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(t12_xboole_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [A: mu] :
( mforall_ind
@ ^ [B: mu] : ( mimplies @ ( subset @ A @ B ) @ ( qmltpeq @ ( set_union2 @ A @ B ) @ B ) ) ) ) ) ).
thf(zf_stmt_1,axiom,
! [X4: $i,X6: mu] :
( ( exists_in_world @ X6 @ X4 )
=> ! [X8: mu] :
( ( exists_in_world @ X8 @ X4 )
=> ( ~ ( subset @ X6 @ X8 @ X4 )
| ( qmltpeq @ ( set_union2 @ X6 @ X8 ) @ X8 @ X4 ) ) ) ) ).
thf(zip_derived_cl29,plain,
! [X0: mu,X1: $i,X2: mu] :
( ~ ( exists_in_world @ X0 @ X1 )
| ~ ( subset @ X2 @ X0 @ X1 )
| ( qmltpeq @ ( set_union2 @ X2 @ X0 ) @ X0 @ X1 )
| ~ ( exists_in_world @ X2 @ X1 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(t48_zfmisc_1,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [A: mu] :
( mforall_ind
@ ^ [B: mu] :
( mforall_ind
@ ^ [C: mu] : ( mimplies @ ( mand @ ( in @ A @ B ) @ ( in @ C @ B ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ A @ C ) @ B ) @ B ) ) ) ) ) ) ).
thf(zf_stmt_2,conjecture,
! [X4: $i,X6: mu] :
( ( exists_in_world @ X6 @ X4 )
=> ! [X8: mu] :
( ( exists_in_world @ X8 @ X4 )
=> ! [X10: mu] :
( ( exists_in_world @ X10 @ X4 )
=> ( ~ ( in @ X10 @ X8 @ X4 )
| ~ ( in @ X6 @ X8 @ X4 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X6 @ X10 ) @ X8 ) @ X8 @ X4 ) ) ) ) ) ).
thf(zf_stmt_3,negated_conjecture,
~ ! [X4: $i,X6: mu] :
( ( exists_in_world @ X6 @ X4 )
=> ! [X8: mu] :
( ( exists_in_world @ X8 @ X4 )
=> ! [X10: mu] :
( ( exists_in_world @ X10 @ X4 )
=> ( ~ ( in @ X10 @ X8 @ X4 )
| ~ ( in @ X6 @ X8 @ X4 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X6 @ X10 ) @ X8 ) @ X8 @ X4 ) ) ) ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_2]) ).
thf(zip_derived_cl36,plain,
~ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sk__11 @ sk__13 ) @ sk__12 ) @ sk__12 @ sk__10 ),
inference(cnf,[status(esa)],[zf_stmt_3]) ).
thf(zip_derived_cl372,plain,
( ~ ( exists_in_world @ ( unordered_pair @ sk__11 @ sk__13 ) @ sk__10 )
| ~ ( subset @ ( unordered_pair @ sk__11 @ sk__13 ) @ sk__12 @ sk__10 )
| ~ ( exists_in_world @ sk__12 @ sk__10 ) ),
inference('sup-',[status(thm)],[zip_derived_cl29,zip_derived_cl36]) ).
thf(existence_of_unordered_pair_ax,axiom,
! [V: $i,V2: mu,V1: mu] : ( exists_in_world @ ( unordered_pair @ V2 @ V1 ) @ V ) ).
thf(zip_derived_cl4,plain,
! [X0: mu,X1: mu,X2: $i] : ( exists_in_world @ ( unordered_pair @ X0 @ X1 ) @ X2 ),
inference(cnf,[status(esa)],[existence_of_unordered_pair_ax]) ).
thf(zip_derived_cl38,plain,
exists_in_world @ sk__12 @ sk__10,
inference(cnf,[status(esa)],[zf_stmt_3]) ).
thf(zip_derived_cl391,plain,
~ ( subset @ ( unordered_pair @ sk__11 @ sk__13 ) @ sk__12 @ sk__10 ),
inference(demod,[status(thm)],[zip_derived_cl372,zip_derived_cl4,zip_derived_cl38]) ).
thf(zip_derived_cl488,plain,
( ~ ( exists_in_world @ sk__11 @ sk__10 )
| ~ ( exists_in_world @ sk__12 @ sk__10 )
| ~ ( in @ sk__13 @ sk__12 @ sk__10 )
| ~ ( in @ sk__11 @ sk__12 @ sk__10 )
| ~ ( exists_in_world @ sk__13 @ sk__10 ) ),
inference('sup-',[status(thm)],[zip_derived_cl30,zip_derived_cl391]) ).
thf(zip_derived_cl33,plain,
exists_in_world @ sk__11 @ sk__10,
inference(cnf,[status(esa)],[zf_stmt_3]) ).
thf(zip_derived_cl38_001,plain,
exists_in_world @ sk__12 @ sk__10,
inference(cnf,[status(esa)],[zf_stmt_3]) ).
thf(zip_derived_cl35,plain,
in @ sk__13 @ sk__12 @ sk__10,
inference(cnf,[status(esa)],[zf_stmt_3]) ).
thf(zip_derived_cl37,plain,
in @ sk__11 @ sk__12 @ sk__10,
inference(cnf,[status(esa)],[zf_stmt_3]) ).
thf(zip_derived_cl34,plain,
exists_in_world @ sk__13 @ sk__10,
inference(cnf,[status(esa)],[zf_stmt_3]) ).
thf(zip_derived_cl494,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl488,zip_derived_cl33,zip_derived_cl38,zip_derived_cl35,zip_derived_cl37,zip_derived_cl34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET907^7 : TPTP v9.2.0. Released v5.5.0.
% 0.08/0.14 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.C5gin0aLIs true
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Oct 1 12:58:38 EDT 2025
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running portfolio for 300 s
% 0.14/0.35 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.35 % Number of cores: 8
% 0.14/0.35 % Python version: Python 3.6.8
% 0.14/0.35 % Running in HO mode
% 0.19/0.62 % Total configuration time : 828
% 0.19/0.62 % Estimated wc time : 1656
% 0.19/0.62 % Estimated cpu time (8 cpus) : 207.0
% 1.01/0.66 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 1.01/0.69 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 1.01/0.70 % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 1.36/0.71 % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 1.36/0.71 % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 1.36/0.71 % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 1.36/0.71 % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 1.36/0.74 % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 1.41/0.77 % /export/starexec/sandbox2/solver/bin/lams/30_b.l.sh running for 90s
% 1.48/1.01 % Solved by lams/40_noforms.sh.
% 1.48/1.01 % done 84 iterations in 0.270s
% 1.48/1.01 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.48/1.01 % SZS output start Refutation
% See solution above
% 1.48/1.01
% 1.48/1.01
% 1.48/1.01 % Terminating...
% 1.79/1.13 % Runner terminated.
% 1.79/1.15 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------