TSTP Solution File: SET628+3 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SET628+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.M2GHvPJcei true
% Computer : n004.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:09 EDT 2023
% Result : Theorem 1.24s 0.76s
% Output : Refutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 34 ( 9 unt; 7 typ; 0 def)
% Number of atoms : 49 ( 15 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 113 ( 17 ~; 15 |; 1 &; 74 @)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 ^; 28 !; 1 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(member_type,type,
member: $i > $i > $o ).
thf(intersect_type,type,
intersect: $i > $i > $o ).
thf(sk__3_type,type,
sk__3: $i ).
thf(sk__1_type,type,
sk__1: $i > $i > $i ).
thf(sk__type,type,
sk_: $i > $i > $i ).
thf(empty_set_type,type,
empty_set: $i ).
thf(not_equal_type,type,
not_equal: $i > $i > $o ).
thf(prove_th110,conjecture,
! [B: $i] :
( ( intersect @ B @ B )
<=> ( not_equal @ B @ empty_set ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [B: $i] :
( ( intersect @ B @ B )
<=> ( not_equal @ B @ empty_set ) ),
inference('cnf.neg',[status(esa)],[prove_th110]) ).
thf(zip_derived_cl13,plain,
( ( not_equal @ sk__3 @ empty_set )
| ( intersect @ sk__3 @ sk__3 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(not_equal_defn,axiom,
! [B: $i,C: $i] :
( ( not_equal @ B @ C )
<=> ( B != C ) ) ).
thf(zip_derived_cl8,plain,
! [X0: $i,X1: $i] :
( ( X1 != X0 )
| ~ ( not_equal @ X1 @ X0 ) ),
inference(cnf,[status(esa)],[not_equal_defn]) ).
thf(zip_derived_cl78,plain,
( ( intersect @ sk__3 @ sk__3 )
| ( sk__3 != empty_set ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl13,zip_derived_cl8]) ).
thf(equal_member_defn,axiom,
! [B: $i,C: $i] :
( ( B = C )
<=> ! [D: $i] :
( ( member @ D @ B )
<=> ( member @ D @ C ) ) ) ).
thf(zip_derived_cl7,plain,
! [X0: $i,X1: $i] :
( ( X1 = X0 )
| ( member @ ( sk__1 @ X0 @ X1 ) @ X0 )
| ( member @ ( sk__1 @ X0 @ X1 ) @ X1 ) ),
inference(cnf,[status(esa)],[equal_member_defn]) ).
thf(empty_set_defn,axiom,
! [B: $i] :
~ ( member @ B @ empty_set ) ).
thf(zip_derived_cl3,plain,
! [X0: $i] :
~ ( member @ X0 @ empty_set ),
inference(cnf,[status(esa)],[empty_set_defn]) ).
thf(zip_derived_cl99,plain,
! [X0: $i] :
( ( member @ ( sk__1 @ empty_set @ X0 ) @ X0 )
| ( X0 = empty_set ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl7,zip_derived_cl3]) ).
thf(intersect_defn,axiom,
! [B: $i,C: $i] :
( ( intersect @ B @ C )
<=> ? [D: $i] :
( ( member @ D @ C )
& ( member @ D @ B ) ) ) ).
thf(zip_derived_cl2,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( intersect @ X0 @ X1 )
| ~ ( member @ X2 @ X0 )
| ~ ( member @ X2 @ X1 ) ),
inference(cnf,[status(esa)],[intersect_defn]) ).
thf(zip_derived_cl87,plain,
! [X0: $i,X1: $i] :
( ~ ( member @ X1 @ X0 )
| ( intersect @ X0 @ X0 ) ),
inference(eq_fact,[status(thm)],[zip_derived_cl2]) ).
thf(zip_derived_cl116,plain,
! [X0: $i] :
( ( X0 = empty_set )
| ( intersect @ X0 @ X0 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl99,zip_derived_cl87]) ).
thf(zip_derived_cl9,plain,
! [X0: $i,X1: $i] :
( ( not_equal @ X0 @ X1 )
| ( X0 = X1 ) ),
inference(cnf,[status(esa)],[not_equal_defn]) ).
thf(zip_derived_cl14,plain,
( ~ ( not_equal @ sk__3 @ empty_set )
| ~ ( intersect @ sk__3 @ sk__3 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl77,plain,
( ( sk__3 = empty_set )
| ~ ( intersect @ sk__3 @ sk__3 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl9,zip_derived_cl14]) ).
thf(zip_derived_cl131,plain,
( ( sk__3 = empty_set )
| ( sk__3 = empty_set ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl116,zip_derived_cl77]) ).
thf(zip_derived_cl132,plain,
sk__3 = empty_set,
inference(simplify,[status(thm)],[zip_derived_cl131]) ).
thf(zip_derived_cl132_001,plain,
sk__3 = empty_set,
inference(simplify,[status(thm)],[zip_derived_cl131]) ).
thf(zip_derived_cl1,plain,
! [X0: $i,X1: $i] :
( ( member @ ( sk_ @ X0 @ X1 ) @ X1 )
| ~ ( intersect @ X1 @ X0 ) ),
inference(cnf,[status(esa)],[intersect_defn]) ).
thf(zip_derived_cl3_002,plain,
! [X0: $i] :
~ ( member @ X0 @ empty_set ),
inference(cnf,[status(esa)],[empty_set_defn]) ).
thf(zip_derived_cl84,plain,
! [X0: $i] :
~ ( intersect @ empty_set @ X0 ),
inference('s_sup-',[status(thm)],[zip_derived_cl1,zip_derived_cl3]) ).
thf(zip_derived_cl132_003,plain,
sk__3 = empty_set,
inference(simplify,[status(thm)],[zip_derived_cl131]) ).
thf(zip_derived_cl133,plain,
empty_set != empty_set,
inference(demod,[status(thm)],[zip_derived_cl78,zip_derived_cl132,zip_derived_cl132,zip_derived_cl84,zip_derived_cl132]) ).
thf(zip_derived_cl134,plain,
$false,
inference(simplify,[status(thm)],[zip_derived_cl133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SET628+3 : TPTP v8.1.2. Released v2.2.0.
% 0.13/0.15 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.M2GHvPJcei true
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat Aug 26 14:54:08 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % Running portfolio for 300 s
% 0.15/0.36 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.36 % Number of cores: 8
% 0.22/0.37 % Python version: Python 3.6.8
% 0.22/0.37 % Running in FO mode
% 0.23/0.67 % Total configuration time : 435
% 0.23/0.67 % Estimated wc time : 1092
% 0.23/0.67 % Estimated cpu time (7 cpus) : 156.0
% 0.23/0.73 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 1.24/0.76 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 1.24/0.76 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 1.24/0.76 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 1.24/0.76 % Solved by fo/fo6_bce.sh.
% 1.24/0.76 % BCE start: 15
% 1.24/0.76 % BCE eliminated: 0
% 1.24/0.76 % PE start: 15
% 1.24/0.76 logic: eq
% 1.24/0.76 % PE eliminated: 3
% 1.24/0.76 % done 23 iterations in 0.014s
% 1.24/0.76 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.24/0.76 % SZS output start Refutation
% See solution above
% 1.24/0.76
% 1.24/0.76
% 1.24/0.76 % Terminating...
% 1.59/0.86 % Runner terminated.
% 1.61/0.88 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------