TSTP Solution File: SET638+3 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SET638+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.nO0iYpHEyt true
% Computer : n005.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 Aug 31 16:15:14 EDT 2023
% Result : Theorem 1.15s 0.77s
% Output : Refutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 17 unt; 7 typ; 0 def)
% Number of atoms : 29 ( 15 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 111 ( 4 ~; 2 |; 2 &; 100 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 31 ( 0 ^; 31 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(empty_set_type,type,
empty_set: $i ).
thf(sk__5_type,type,
sk__5: $i ).
thf(intersection_type,type,
intersection: $i > $i > $i ).
thf(union_type,type,
union: $i > $i > $i ).
thf(subset_type,type,
subset: $i > $i > $o ).
thf(sk__4_type,type,
sk__4: $i ).
thf(sk__3_type,type,
sk__3: $i ).
thf(prove_th120,conjecture,
! [B: $i,C: $i,D: $i] :
( ( ( subset @ B @ ( union @ C @ D ) )
& ( ( intersection @ B @ D )
= empty_set ) )
=> ( subset @ B @ C ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [B: $i,C: $i,D: $i] :
( ( ( subset @ B @ ( union @ C @ D ) )
& ( ( intersection @ B @ D )
= empty_set ) )
=> ( subset @ B @ C ) ),
inference('cnf.neg',[status(esa)],[prove_th120]) ).
thf(zip_derived_cl28,plain,
~ ( subset @ sk__3 @ sk__4 ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl27,plain,
subset @ sk__3 @ ( union @ sk__4 @ sk__5 ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl26,plain,
( ( intersection @ sk__3 @ sk__5 )
= empty_set ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(intersection_distributes_over_union,axiom,
! [B: $i,C: $i,D: $i] :
( ( intersection @ B @ ( union @ C @ D ) )
= ( union @ ( intersection @ B @ C ) @ ( intersection @ B @ D ) ) ) ).
thf(zip_derived_cl3,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( intersection @ X0 @ ( union @ X1 @ X2 ) )
= ( union @ ( intersection @ X0 @ X1 ) @ ( intersection @ X0 @ X2 ) ) ),
inference(cnf,[status(esa)],[intersection_distributes_over_union]) ).
thf(zip_derived_cl121,plain,
! [X0: $i] :
( ( intersection @ sk__3 @ ( union @ X0 @ sk__5 ) )
= ( union @ ( intersection @ sk__3 @ X0 ) @ empty_set ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl26,zip_derived_cl3]) ).
thf(union_empty_set,axiom,
! [B: $i] :
( ( union @ B @ empty_set )
= B ) ).
thf(zip_derived_cl2,plain,
! [X0: $i] :
( ( union @ X0 @ empty_set )
= X0 ),
inference(cnf,[status(esa)],[union_empty_set]) ).
thf(zip_derived_cl124,plain,
! [X0: $i] :
( ( intersection @ sk__3 @ ( union @ X0 @ sk__5 ) )
= ( intersection @ sk__3 @ X0 ) ),
inference(demod,[status(thm)],[zip_derived_cl121,zip_derived_cl2]) ).
thf(subset_intersection,axiom,
! [B: $i,C: $i] :
( ( subset @ B @ C )
=> ( ( intersection @ B @ C )
= B ) ) ).
thf(zip_derived_cl1,plain,
! [X0: $i,X1: $i] :
( ( ( intersection @ X0 @ X1 )
= X0 )
| ~ ( subset @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[subset_intersection]) ).
thf(zip_derived_cl217,plain,
! [X0: $i] :
( ( ( intersection @ sk__3 @ X0 )
= sk__3 )
| ~ ( subset @ sk__3 @ ( union @ X0 @ sk__5 ) ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl124,zip_derived_cl1]) ).
thf(zip_derived_cl316,plain,
( ( intersection @ sk__3 @ sk__4 )
= sk__3 ),
inference('s_sup-',[status(thm)],[zip_derived_cl27,zip_derived_cl217]) ).
thf(commutativity_of_intersection,axiom,
! [B: $i,C: $i] :
( ( intersection @ B @ C )
= ( intersection @ C @ B ) ) ).
thf(zip_derived_cl18,plain,
! [X0: $i,X1: $i] :
( ( intersection @ X1 @ X0 )
= ( intersection @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[commutativity_of_intersection]) ).
thf(intersection_is_subset,axiom,
! [B: $i,C: $i] : ( subset @ ( intersection @ B @ C ) @ B ) ).
thf(zip_derived_cl0,plain,
! [X0: $i,X1: $i] : ( subset @ ( intersection @ X0 @ X1 ) @ X0 ),
inference(cnf,[status(esa)],[intersection_is_subset]) ).
thf(zip_derived_cl147,plain,
! [X0: $i,X1: $i] : ( subset @ ( intersection @ X1 @ X0 ) @ X0 ),
inference('s_sup+',[status(thm)],[zip_derived_cl18,zip_derived_cl0]) ).
thf(zip_derived_cl340,plain,
subset @ sk__3 @ sk__4,
inference('s_sup+',[status(thm)],[zip_derived_cl316,zip_derived_cl147]) ).
thf(zip_derived_cl347,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl28,zip_derived_cl340]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET638+3 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.nO0iYpHEyt true
% 0.13/0.35 % Computer : n005.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 : Sat Aug 26 14:26:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in FO mode
% 0.20/0.66 % Total configuration time : 435
% 0.20/0.66 % Estimated wc time : 1092
% 0.20/0.66 % Estimated cpu time (7 cpus) : 156.0
% 0.20/0.71 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 1.15/0.74 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 1.15/0.76 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 1.15/0.76 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 1.15/0.76 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 1.15/0.76 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 1.15/0.76 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 1.15/0.77 % Solved by fo/fo6_bce.sh.
% 1.15/0.77 % BCE start: 29
% 1.15/0.77 % BCE eliminated: 0
% 1.15/0.77 % PE start: 29
% 1.15/0.77 logic: eq
% 1.15/0.77 % PE eliminated: 1
% 1.15/0.77 % done 81 iterations in 0.042s
% 1.15/0.77 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.15/0.77 % SZS output start Refutation
% See solution above
% 1.15/0.77
% 1.15/0.77
% 1.15/0.77 % Terminating...
% 1.42/0.86 % Runner terminated.
% 1.42/0.87 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------