TSTP Solution File: SEU150+1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SEU150+1 : TPTP v8.1.2. Released v3.3.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.tN1qn85seX true
% Computer : n016.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:10:46 EDT 2023
% Result : Theorem 0.21s 0.74s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 11 unt; 5 typ; 0 def)
% Number of atoms : 27 ( 26 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 59 ( 8 ~; 5 |; 0 &; 43 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 ^; 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk__1_type,type,
sk__1: $i ).
thf(singleton_type,type,
singleton: $i > $i ).
thf(unordered_pair_type,type,
unordered_pair: $i > $i > $i ).
thf(sk__2_type,type,
sk__2: $i ).
thf(sk__type,type,
sk_: $i ).
thf(t9_zfmisc_1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( singleton @ A )
= ( unordered_pair @ B @ C ) )
=> ( B = C ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ( singleton @ A )
= ( unordered_pair @ B @ C ) )
=> ( B = C ) ),
inference('cnf.neg',[status(esa)],[t9_zfmisc_1]) ).
thf(zip_derived_cl4,plain,
( ( singleton @ sk_ )
= ( unordered_pair @ sk__1 @ sk__2 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl4_001,plain,
( ( singleton @ sk_ )
= ( unordered_pair @ sk__1 @ sk__2 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(t8_zfmisc_1,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( singleton @ A )
= ( unordered_pair @ B @ C ) )
=> ( A = B ) ) ).
thf(zip_derived_cl3,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X0 )
| ( ( singleton @ X1 )
!= ( unordered_pair @ X0 @ X2 ) ) ),
inference(cnf,[status(esa)],[t8_zfmisc_1]) ).
thf(zip_derived_cl10,plain,
! [X0: $i,X1: $i] :
( ( sk_ = X1 )
| ( ( unordered_pair @ sk__1 @ sk__2 )
!= ( unordered_pair @ X1 @ X0 ) ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl4,zip_derived_cl3]) ).
thf(zip_derived_cl14,plain,
sk_ = sk__1,
inference(eq_res,[status(thm)],[zip_derived_cl10]) ).
thf(zip_derived_cl15,plain,
( ( singleton @ sk_ )
= ( unordered_pair @ sk_ @ sk__2 ) ),
inference(demod,[status(thm)],[zip_derived_cl4,zip_derived_cl14]) ).
thf(commutativity_k2_tarski,axiom,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ) ).
thf(zip_derived_cl0,plain,
! [X0: $i,X1: $i] :
( ( unordered_pair @ X1 @ X0 )
= ( unordered_pair @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[commutativity_k2_tarski]) ).
thf(zip_derived_cl3_002,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X0 )
| ( ( singleton @ X1 )
!= ( unordered_pair @ X0 @ X2 ) ) ),
inference(cnf,[status(esa)],[t8_zfmisc_1]) ).
thf(zip_derived_cl6,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( ( singleton @ X2 )
!= ( unordered_pair @ X1 @ X0 ) ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl0,zip_derived_cl3]) ).
thf(zip_derived_cl19,plain,
! [X0: $i,X1: $i] :
( ( sk_ = X0 )
| ( ( unordered_pair @ sk_ @ sk__2 )
!= ( unordered_pair @ X1 @ X0 ) ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl15,zip_derived_cl6]) ).
thf(zip_derived_cl25,plain,
sk_ = sk__2,
inference(eq_res,[status(thm)],[zip_derived_cl19]) ).
thf(zip_derived_cl5,plain,
sk__1 != sk__2,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl14_003,plain,
sk_ = sk__1,
inference(eq_res,[status(thm)],[zip_derived_cl10]) ).
thf(zip_derived_cl16,plain,
sk_ != sk__2,
inference(demod,[status(thm)],[zip_derived_cl5,zip_derived_cl14]) ).
thf(zip_derived_cl26,plain,
$false,
inference('simplify_reflect-',[status(thm)],[zip_derived_cl25,zip_derived_cl16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU150+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.tN1qn85seX true
% 0.14/0.34 % Computer : n016.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 16:51:22 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.21/0.35 % Python version: Python 3.6.8
% 0.21/0.35 % Running in FO mode
% 0.21/0.64 % Total configuration time : 435
% 0.21/0.64 % Estimated wc time : 1092
% 0.21/0.64 % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.74 % Solved by fo/fo6_bce.sh.
% 0.21/0.74 % BCE start: 6
% 0.21/0.74 % BCE eliminated: 0
% 0.21/0.74 % PE start: 6
% 0.21/0.74 logic: eq
% 0.21/0.74 % PE eliminated: 0
% 0.21/0.74 % done 16 iterations in 0.009s
% 0.21/0.74 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.21/0.74 % SZS output start Refutation
% See solution above
% 0.21/0.74
% 0.21/0.74
% 0.21/0.74 % Terminating...
% 0.21/0.85 % Runner terminated.
% 0.21/0.86 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------