TSTP Solution File: SYO538^1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SYO538^1 : TPTP v8.1.2. Released v5.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.OMdAo51lF1 true
% Computer : n001.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 : Fri Sep 1 05:51:59 EDT 2023
% Result : Theorem 0.21s 0.80s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 72 ( 63 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 96 ( 22 ~; 20 |; 15 &; 38 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-3 aty)
% Number of variables : 48 ( 32 ^; 15 !; 1 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(eps_type,type,
eps: ( $i > $o ) > $i ).
thf(sk__1_type,type,
sk__1: $i ).
thf(if_type,type,
if: $o > $i > $i > $i ).
thf(sk__type,type,
sk_: $i ).
thf(ifd,axiom,
( if
= ( ^ [B: $o,X: $i,Y: $i] :
( eps
@ ^ [Z: $i] :
( ( B
& ( Z = X ) )
| ( ~ B
& ( Z = Y ) ) ) ) ) ) ).
thf('0',plain,
( if
= ( ^ [B: $o,X: $i,Y: $i] :
( eps
@ ^ [Z: $i] :
( ( B
& ( Z = X ) )
| ( ~ B
& ( Z = Y ) ) ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[ifd]) ).
thf('1',plain,
( if
= ( ^ [V_1: $o,V_2: $i,V_3: $i] :
( eps
@ ^ [V_4: $i] :
( ( V_1
& ( V_4 = V_2 ) )
| ( ~ V_1
& ( V_4 = V_3 ) ) ) ) ) ),
define([status(thm)]) ).
thf(conj,conjecture,
! [X: $i,Y: $i] :
( ( ( if @ $false @ X @ Y )
= Y )
& ( ( if @ $true @ X @ Y )
= X ) ) ).
thf(zf_stmt_0,conjecture,
! [X4: $i,X6: $i] :
( ( ( eps
@ ^ [V_1: $i] :
( ( V_1 = X6 )
| ( ( V_1 = X4 )
& $false ) ) )
= X6 )
& ( ( eps
@ ^ [V_2: $i] :
( ( ( V_2 = X6 )
& $false )
| ( V_2 = X4 ) ) )
= X4 ) ) ).
thf(zf_stmt_1,negated_conjecture,
~ ! [X4: $i,X6: $i] :
( ( ( eps
@ ^ [V_1: $i] :
( ( V_1 = X6 )
| ( ( V_1 = X4 )
& $false ) ) )
= X6 )
& ( ( eps
@ ^ [V_2: $i] :
( ( ( V_2 = X6 )
& $false )
| ( V_2 = X4 ) ) )
= X4 ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl1,plain,
( ( ( eps
@ ^ [Y0: $i] :
( ( Y0 = sk__1 )
| ( ( Y0 = sk_ )
& $false ) ) )
!= sk__1 )
| ( ( eps
@ ^ [Y0: $i] :
( ( ( Y0 = sk__1 )
& $false )
| ( Y0 = sk_ ) ) )
!= sk_ ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl2,plain,
( ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk__1 ) )
!= sk__1 )
| ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk_ ) )
!= sk_ ) ),
inference('simplify boolean subterms',[status(thm)],[zip_derived_cl1]) ).
thf(choiceax,axiom,
! [P: $i > $o] :
( ? [X: $i] : ( P @ X )
=> ( P @ ( eps @ P ) ) ) ).
thf(zip_derived_cl0,plain,
! [X0: $i > $o,X1: $i] :
( ( X0 @ ( eps @ X0 ) )
| ~ ( X0 @ X1 ) ),
inference(cnf,[status(esa)],[choiceax]) ).
thf(zip_derived_cl2_001,plain,
( ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk__1 ) )
!= sk__1 )
| ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk_ ) )
!= sk_ ) ),
inference('simplify boolean subterms',[status(thm)],[zip_derived_cl1]) ).
thf(zip_derived_cl6,plain,
! [X4: $i] :
( ( X4 != sk_ )
| ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk_ ) )
= sk_ ) ),
inference('inst_choice(((^[Y0 : $i]: (((Y0) = (sk_))))))',[status(thm)],[zip_derived_cl0,zip_derived_cl2]) ).
thf(zip_derived_cl8,plain,
! [X4: $i] :
( ( X4 != sk_ )
| ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk_ ) )
= sk_ ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl6]) ).
thf(zip_derived_cl9,plain,
( ( eps
@ ^ [Y0: $i] : ( Y0 = sk_ ) )
= sk_ ),
inference(simplify,[status(thm)],[zip_derived_cl8]) ).
thf(zip_derived_cl13,plain,
( ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk__1 ) )
!= sk__1 )
| ( sk_ != sk_ ) ),
inference(demod,[status(thm)],[zip_derived_cl2,zip_derived_cl9]) ).
thf(zip_derived_cl14,plain,
( ( eps
@ ^ [Y0: $i] : ( Y0 = sk__1 ) )
!= sk__1 ),
inference(simplify,[status(thm)],[zip_derived_cl13]) ).
thf(zip_derived_cl0_002,plain,
! [X0: $i > $o,X1: $i] :
( ( X0 @ ( eps @ X0 ) )
| ~ ( X0 @ X1 ) ),
inference(cnf,[status(esa)],[choiceax]) ).
thf(zip_derived_cl2_003,plain,
( ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk__1 ) )
!= sk__1 )
| ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk_ ) )
!= sk_ ) ),
inference('simplify boolean subterms',[status(thm)],[zip_derived_cl1]) ).
thf(zip_derived_cl4,plain,
! [X2: $i] :
( ( X2 != sk__1 )
| ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk__1 ) )
= sk__1 ) ),
inference('inst_choice(((^[Y0 : $i]: (((Y0) = (sk__1))))))',[status(thm)],[zip_derived_cl0,zip_derived_cl2]) ).
thf(zip_derived_cl11,plain,
! [X2: $i] :
( ( X2 != sk__1 )
| ( ( eps
@ ^ [Y0: $i] : ( Y0 = sk__1 ) )
= sk__1 ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl4]) ).
thf(zip_derived_cl12,plain,
( ( eps
@ ^ [Y0: $i] : ( Y0 = sk__1 ) )
= sk__1 ),
inference(simplify,[status(thm)],[zip_derived_cl11]) ).
thf(zip_derived_cl27,plain,
sk__1 != sk__1,
inference(demod,[status(thm)],[zip_derived_cl14,zip_derived_cl12]) ).
thf(zip_derived_cl28,plain,
$false,
inference(simplify,[status(thm)],[zip_derived_cl27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO538^1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.OMdAo51lF1 true
% 0.12/0.34 % Computer : n001.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 08:39:45 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running portfolio for 300 s
% 0.12/0.34 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34 % Number of cores: 8
% 0.12/0.35 % Python version: Python 3.6.8
% 0.12/0.35 % Running in HO mode
% 0.21/0.66 % Total configuration time : 828
% 0.21/0.66 % Estimated wc time : 1656
% 0.21/0.66 % Estimated cpu time (8 cpus) : 207.0
% 0.21/0.74 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.21/0.77 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.21/0.77 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.21/0.77 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.21/0.78 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.21/0.80 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.21/0.80 % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.21/0.80 % Solved by lams/40_c.s.sh.
% 0.21/0.80 % done 6 iterations in 0.010s
% 0.21/0.80 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.21/0.80 % SZS output start Refutation
% See solution above
% 0.21/0.81
% 0.21/0.81
% 0.21/0.81 % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 0.21/0.81 % Terminating...
% 1.14/0.88 % Runner terminated.
% 1.14/0.89 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------