TSTP Solution File: NUM635^4 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM635^4 : TPTP v8.1.2. Released v7.1.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.fLiN3QGMeG true
% Computer : n029.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 12:42:55 EDT 2023
% Result : Theorem 0.57s 0.95s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 29
% Syntax : Number of formulae : 43 ( 25 unt; 12 typ; 0 def)
% Number of atoms : 87 ( 37 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 92 ( 10 ~; 2 |; 0 &; 66 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 52 ( 40 ^; 12 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk__45_type,type,
sk__45: $i ).
thf(sk__44_type,type,
sk__44: $i ).
thf(nat_type,type,
nat: $i ).
thf(is_of_type,type,
is_of: $i > ( $i > $o ) > $o ).
thf(in_type,type,
in: $i > $i > $o ).
thf(nis_type,type,
nis: $i > $i > $o ).
thf(n_is_type,type,
n_is: $i > $i > $o ).
thf(imp_type,type,
imp: $o > $o > $o ).
thf(all_of_type,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(ordsucc_type,type,
ordsucc: $i > $i ).
thf(d_not_type,type,
d_not: $o > $o ).
thf(e_is_type,type,
e_is: $i > $i > $i > $o ).
thf(def_nis,axiom,
( nis
= ( ^ [X0: $i,X1: $i] : ( d_not @ ( n_is @ X0 @ X1 ) ) ) ) ).
thf(def_n_is,axiom,
( n_is
= ( e_is @ nat ) ) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X0: $i,X: $i,Y: $i] : ( X = Y ) ) ) ).
thf('0',plain,
( e_is
= ( ^ [X0: $i,X: $i,Y: $i] : ( X = Y ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_e_is]) ).
thf('1',plain,
( e_is
= ( ^ [V_1: $i,V_2: $i,V_3: $i] : ( V_2 = V_3 ) ) ),
define([status(thm)]) ).
thf('2',plain,
( n_is
= ( e_is @ nat ) ),
inference(simplify_rw_rule,[status(thm)],[def_n_is,'1']) ).
thf('3',plain,
( n_is
= ( e_is @ nat ) ),
define([status(thm)]) ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X0: $o] : ( imp @ X0 @ $false ) ) ) ).
thf(def_imp,axiom,
( imp
= ( ^ [X0: $o,X1: $o] :
( X0
=> X1 ) ) ) ).
thf('4',plain,
( imp
= ( ^ [X0: $o,X1: $o] :
( X0
=> X1 ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_imp]) ).
thf('5',plain,
( imp
= ( ^ [V_1: $o,V_2: $o] :
( V_1
=> V_2 ) ) ),
define([status(thm)]) ).
thf('6',plain,
( d_not
= ( ^ [X0: $o] : ( imp @ X0 @ $false ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_d_not,'5']) ).
thf('7',plain,
( d_not
= ( ^ [V_1: $o] : ( imp @ V_1 @ $false ) ) ),
define([status(thm)]) ).
thf('8',plain,
( nis
= ( ^ [X0: $i,X1: $i] : ( d_not @ ( n_is @ X0 @ X1 ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_nis,'3','1','7']) ).
thf('9',plain,
( nis
= ( ^ [V_1: $i,V_2: $i] : ( d_not @ ( n_is @ V_1 @ V_2 ) ) ) ),
define([status(thm)]) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( is_of @ X2 @ X0 )
=> ( X1 @ X2 ) ) ) ) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X0: $i,X1: $i > $o] : ( X1 @ X0 ) ) ) ).
thf('10',plain,
( is_of
= ( ^ [X0: $i,X1: $i > $o] : ( X1 @ X0 ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_is_of]) ).
thf('11',plain,
( is_of
= ( ^ [V_1: $i,V_2: $i > $o] : ( V_2 @ V_1 ) ) ),
define([status(thm)]) ).
thf('12',plain,
( all_of
= ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( is_of @ X2 @ X0 )
=> ( X1 @ X2 ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[def_all_of,'11']) ).
thf('13',plain,
( all_of
= ( ^ [V_1: $i > $o,V_2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ V_1 )
=> ( V_2 @ X4 ) ) ) ),
define([status(thm)]) ).
thf(satz1,conjecture,
( all_of
@ ^ [X0: $i] : ( in @ X0 @ nat )
@ ^ [X0: $i] :
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( ( nis @ X0 @ X1 )
=> ( nis @ ( ordsucc @ X0 ) @ ( ordsucc @ X1 ) ) ) ) ) ).
thf(zf_stmt_0,conjecture,
! [X4: $i] :
( ( in @ X4 @ nat )
=> ! [X6: $i] :
( ( in @ X6 @ nat )
=> ( ( X4 != X6 )
=> ( ( ordsucc @ X4 )
!= ( ordsucc @ X6 ) ) ) ) ) ).
thf(zf_stmt_1,negated_conjecture,
~ ! [X4: $i] :
( ( in @ X4 @ nat )
=> ! [X6: $i] :
( ( in @ X6 @ nat )
=> ( ( X4 != X6 )
=> ( ( ordsucc @ X4 )
!= ( ordsucc @ X6 ) ) ) ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl185,plain,
( ( ordsucc @ sk__44 )
= ( ordsucc @ sk__45 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(ordsucc_inj,axiom,
! [X0: $i,X1: $i] :
( ( ( ordsucc @ X0 )
= ( ordsucc @ X1 ) )
=> ( X0 = X1 ) ) ).
thf(zip_derived_cl48,plain,
! [X0: $i,X1: $i] :
( ( X1 = X0 )
| ( ( ordsucc @ X1 )
!= ( ordsucc @ X0 ) ) ),
inference(cnf,[status(esa)],[ordsucc_inj]) ).
thf(zip_derived_cl184,plain,
sk__44 != sk__45,
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl345,plain,
! [X0: $i] :
( ( sk__44 != X0 )
| ( ( ordsucc @ sk__45 )
!= ( ordsucc @ X0 ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl48,zip_derived_cl184]) ).
thf(zip_derived_cl389,plain,
( ( ordsucc @ sk__45 )
!= ( ordsucc @ sk__44 ) ),
inference(simplify,[status(thm)],[zip_derived_cl345]) ).
thf(zip_derived_cl464,plain,
$false,
inference('simplify_reflect-',[status(thm)],[zip_derived_cl185,zip_derived_cl389]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM635^4 : TPTP v8.1.2. Released v7.1.0.
% 0.00/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.fLiN3QGMeG true
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri Aug 25 13:44:54 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % Running portfolio for 300 s
% 0.14/0.36 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.36 % Number of cores: 8
% 0.14/0.36 % Python version: Python 3.6.8
% 0.14/0.37 % Running in HO mode
% 0.22/0.63 % Total configuration time : 828
% 0.22/0.63 % Estimated wc time : 1656
% 0.22/0.63 % Estimated cpu time (8 cpus) : 207.0
% 0.22/0.71 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.22/0.72 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.22/0.73 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.22/0.75 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.22/0.76 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.22/0.76 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.55/0.81 % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.55/0.83 % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 0.57/0.95 % Solved by lams/40_noforms.sh.
% 0.57/0.95 % done 55 iterations in 0.138s
% 0.57/0.95 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.57/0.95 % SZS output start Refutation
% See solution above
% 0.57/0.95
% 0.57/0.95
% 0.57/0.95 % Terminating...
% 1.64/1.06 % Runner terminated.
% 1.64/1.07 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------