TSTP Solution File: SEU828^1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SEU828^1 : TPTP v8.1.2. Released v3.7.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.EIAHA49jVd true
% Computer : n009.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 19:18:32 EDT 2023
% Result : Theorem 0.22s 0.74s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of formulae : 28 ( 16 unt; 7 typ; 0 def)
% Number of atoms : 43 ( 13 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 51 ( 9 ~; 2 |; 0 &; 32 @)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 46 ( 46 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 22 ^; 16 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(subseteq_type,type,
subseteq: ( $i > $o ) > ( $i > $o ) > $o ).
thf(sk__2_type,type,
sk__2: $i > $o ).
thf(emptyset_type,type,
emptyset: $i > $o ).
thf(seteq_type,type,
seteq: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
thf(powerset_type,type,
powerset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(sk__3_type,type,
sk__3: $i ).
thf(sk__4_type,type,
sk__4: $i ).
thf(emptyset,axiom,
( emptyset
= ( ^ [X: $i] : $false ) ) ).
thf('0',plain,
( emptyset
= ( ^ [X: $i] : $false ) ),
inference(simplify_rw_rule,[status(thm)],[emptyset]) ).
thf('1',plain,
( emptyset
= ( ^ [V_1: $i] : $false ) ),
define([status(thm)]) ).
thf(poserset,axiom,
( powerset
= ( ^ [X: $i > $o,Y: $i > $o] : ( subseteq @ Y @ X ) ) ) ).
thf(subseteq,axiom,
( subseteq
= ( ^ [X: $i > $o,Y: $i > $o] :
! [U: $i] :
( ( X @ U )
=> ( Y @ U ) ) ) ) ).
thf('2',plain,
( subseteq
= ( ^ [X: $i > $o,Y: $i > $o] :
! [U: $i] :
( ( X @ U )
=> ( Y @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[subseteq]) ).
thf('3',plain,
( subseteq
= ( ^ [V_1: $i > $o,V_2: $i > $o] :
! [X4: $i] :
( ( V_1 @ X4 )
=> ( V_2 @ X4 ) ) ) ),
define([status(thm)]) ).
thf('4',plain,
( powerset
= ( ^ [X: $i > $o,Y: $i > $o] : ( subseteq @ Y @ X ) ) ),
inference(simplify_rw_rule,[status(thm)],[poserset,'3']) ).
thf('5',plain,
( powerset
= ( ^ [V_1: $i > $o,V_2: $i > $o] : ( subseteq @ V_2 @ V_1 ) ) ),
define([status(thm)]) ).
thf(seteq,axiom,
( seteq
= ( ^ [X: ( $i > $o ) > $o,Y: ( $i > $o ) > $o] :
! [U: $i > $o] :
( ( X @ U )
<=> ( Y @ U ) ) ) ) ).
thf('6',plain,
( seteq
= ( ^ [X: ( $i > $o ) > $o,Y: ( $i > $o ) > $o] :
! [U: $i > $o] :
( ( X @ U )
<=> ( Y @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[seteq]) ).
thf('7',plain,
( seteq
= ( ^ [V_1: ( $i > $o ) > $o,V_2: ( $i > $o ) > $o] :
! [X4: $i > $o] :
( ( V_1 @ X4 )
<=> ( V_2 @ X4 ) ) ) ),
define([status(thm)]) ).
thf(conj,conjecture,
( seteq @ ( powerset @ emptyset )
@ ^ [X: $i > $o] : ( X = emptyset ) ) ).
thf(zf_stmt_0,conjecture,
! [X4: $i > $o] :
( ! [X6: $i] :
~ ( X4 @ X6 )
<=> ! [V_1: $i] :
~ ( X4 @ V_1 ) ) ).
thf(zf_stmt_1,negated_conjecture,
~ ! [X4: $i > $o] :
( ! [X6: $i] :
~ ( X4 @ X6 )
<=> ! [V_1: $i] :
~ ( X4 @ V_1 ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl1,plain,
( ( sk__2 @ sk__3 )
| ( sk__2 @ sk__4 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl0,plain,
! [X0: $i,X1: $i] :
( ~ ( sk__2 @ X0 )
| ~ ( sk__2 @ X1 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl2,plain,
! [X0: $i] :
~ ( sk__2 @ X0 ),
inference(condensation,[status(thm)],[zip_derived_cl0]) ).
thf(zip_derived_cl3,plain,
sk__2 @ sk__4,
inference(demod,[status(thm)],[zip_derived_cl1,zip_derived_cl2]) ).
thf(zip_derived_cl2_001,plain,
! [X0: $i] :
~ ( sk__2 @ X0 ),
inference(condensation,[status(thm)],[zip_derived_cl0]) ).
thf(zip_derived_cl4,plain,
$false,
inference('sup-',[status(thm)],[zip_derived_cl3,zip_derived_cl2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU828^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.EIAHA49jVd true
% 0.14/0.34 % Computer : n009.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.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Aug 23 12:22:51 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running portfolio for 300 s
% 0.14/0.35 % File : /export/starexec/sandbox/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.22/0.66 % Total configuration time : 828
% 0.22/0.66 % Estimated wc time : 1656
% 0.22/0.66 % Estimated cpu time (8 cpus) : 207.0
% 0.22/0.72 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.22/0.74 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.22/0.74 % Solved by lams/40_c.s.sh.
% 0.22/0.74 % done 2 iterations in 0.007s
% 0.22/0.74 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.22/0.74 % SZS output start Refutation
% See solution above
% 0.22/0.75
% 0.22/0.75
% 0.22/0.75 % Terminating...
% 0.22/0.78 % Runner terminated.
% 0.79/0.79 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------