TSTP Solution File: KLE148+1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : KLE148+1 : TPTP v8.1.2. Released v4.0.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.Pl5D0VlwWF true
% Computer : n019.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 05:38:49 EDT 2023
% Result : Theorem 0.21s 0.80s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 33 ( 24 unt; 7 typ; 0 def)
% Number of atoms : 28 ( 27 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 129 ( 2 ~; 0 |; 0 &; 125 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 0 ^; 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(multiplication_type,type,
multiplication: $i > $i > $i ).
thf(sk__type,type,
sk_: $i ).
thf(one_type,type,
one: $i ).
thf(addition_type,type,
addition: $i > $i > $i ).
thf(strong_iteration_type,type,
strong_iteration: $i > $i ).
thf(sk__1_type,type,
sk__1: $i ).
thf(zero_type,type,
zero: $i ).
thf(infty_unfold1,axiom,
! [A: $i] :
( ( strong_iteration @ A )
= ( addition @ ( multiplication @ A @ ( strong_iteration @ A ) ) @ one ) ) ).
thf(zip_derived_cl14,plain,
! [X0: $i] :
( ( strong_iteration @ X0 )
= ( addition @ ( multiplication @ X0 @ ( strong_iteration @ X0 ) ) @ one ) ),
inference(cnf,[status(esa)],[infty_unfold1]) ).
thf(additive_commutativity,axiom,
! [A: $i,B: $i] :
( ( addition @ A @ B )
= ( addition @ B @ A ) ) ).
thf(zip_derived_cl0,plain,
! [X0: $i,X1: $i] :
( ( addition @ X1 @ X0 )
= ( addition @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[additive_commutativity]) ).
thf(zip_derived_cl221,plain,
! [X0: $i] :
( ( addition @ one @ ( multiplication @ X0 @ ( strong_iteration @ X0 ) ) )
= ( strong_iteration @ X0 ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl14,zip_derived_cl0]) ).
thf(goals,conjecture,
! [X0: $i,X1: $i] :
( ( ( multiplication @ X0 @ X1 )
= zero )
=> ( ( multiplication @ X0 @ ( strong_iteration @ X1 ) )
= X0 ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [X0: $i,X1: $i] :
( ( ( multiplication @ X0 @ X1 )
= zero )
=> ( ( multiplication @ X0 @ ( strong_iteration @ X1 ) )
= X0 ) ),
inference('cnf.neg',[status(esa)],[goals]) ).
thf(zip_derived_cl19,plain,
( ( multiplication @ sk_ @ sk__1 )
= zero ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(multiplicative_associativity,axiom,
! [A: $i,B: $i,C: $i] :
( ( multiplication @ A @ ( multiplication @ B @ C ) )
= ( multiplication @ ( multiplication @ A @ B ) @ C ) ) ).
thf(zip_derived_cl4,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( multiplication @ X0 @ ( multiplication @ X1 @ X2 ) )
= ( multiplication @ ( multiplication @ X0 @ X1 ) @ X2 ) ),
inference(cnf,[status(esa)],[multiplicative_associativity]) ).
thf(zip_derived_cl64,plain,
! [X0: $i] :
( ( multiplication @ sk_ @ ( multiplication @ sk__1 @ X0 ) )
= ( multiplication @ zero @ X0 ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl19,zip_derived_cl4]) ).
thf(left_annihilation,axiom,
! [A: $i] :
( ( multiplication @ zero @ A )
= zero ) ).
thf(zip_derived_cl9,plain,
! [X0: $i] :
( ( multiplication @ zero @ X0 )
= zero ),
inference(cnf,[status(esa)],[left_annihilation]) ).
thf(zip_derived_cl69,plain,
! [X0: $i] :
( ( multiplication @ sk_ @ ( multiplication @ sk__1 @ X0 ) )
= zero ),
inference(demod,[status(thm)],[zip_derived_cl64,zip_derived_cl9]) ).
thf(distributivity1,axiom,
! [A: $i,B: $i,C: $i] :
( ( multiplication @ A @ ( addition @ B @ C ) )
= ( addition @ ( multiplication @ A @ B ) @ ( multiplication @ A @ C ) ) ) ).
thf(zip_derived_cl7,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( multiplication @ X0 @ ( addition @ X1 @ X2 ) )
= ( addition @ ( multiplication @ X0 @ X1 ) @ ( multiplication @ X0 @ X2 ) ) ),
inference(cnf,[status(esa)],[distributivity1]) ).
thf(zip_derived_cl82,plain,
! [X0: $i,X1: $i] :
( ( multiplication @ sk_ @ ( addition @ X1 @ ( multiplication @ sk__1 @ X0 ) ) )
= ( addition @ ( multiplication @ sk_ @ X1 ) @ zero ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl69,zip_derived_cl7]) ).
thf(additive_identity,axiom,
! [A: $i] :
( ( addition @ A @ zero )
= A ) ).
thf(zip_derived_cl2,plain,
! [X0: $i] :
( ( addition @ X0 @ zero )
= X0 ),
inference(cnf,[status(esa)],[additive_identity]) ).
thf(zip_derived_cl93,plain,
! [X0: $i,X1: $i] :
( ( multiplication @ sk_ @ ( addition @ X1 @ ( multiplication @ sk__1 @ X0 ) ) )
= ( multiplication @ sk_ @ X1 ) ),
inference(demod,[status(thm)],[zip_derived_cl82,zip_derived_cl2]) ).
thf(zip_derived_cl317,plain,
( ( multiplication @ sk_ @ ( strong_iteration @ sk__1 ) )
= ( multiplication @ sk_ @ one ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl221,zip_derived_cl93]) ).
thf(multiplicative_right_identity,axiom,
! [A: $i] :
( ( multiplication @ A @ one )
= A ) ).
thf(zip_derived_cl5,plain,
! [X0: $i] :
( ( multiplication @ X0 @ one )
= X0 ),
inference(cnf,[status(esa)],[multiplicative_right_identity]) ).
thf(zip_derived_cl323,plain,
( ( multiplication @ sk_ @ ( strong_iteration @ sk__1 ) )
= sk_ ),
inference(demod,[status(thm)],[zip_derived_cl317,zip_derived_cl5]) ).
thf(zip_derived_cl20,plain,
( ( multiplication @ sk_ @ ( strong_iteration @ sk__1 ) )
!= sk_ ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl324,plain,
$false,
inference('simplify_reflect-',[status(thm)],[zip_derived_cl323,zip_derived_cl20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE148+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.Pl5D0VlwWF true
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 12:36:57 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.36 % Running in FO mode
% 0.21/0.65 % Total configuration time : 435
% 0.21/0.65 % Estimated wc time : 1092
% 0.21/0.65 % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.73 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.74 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.21/0.76 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.21/0.77 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.21/0.77 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.21/0.78 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.21/0.78 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.21/0.80 % Solved by fo/fo6_bce.sh.
% 0.21/0.80 % BCE start: 21
% 0.21/0.80 % BCE eliminated: 0
% 0.21/0.80 % PE start: 21
% 0.21/0.80 logic: eq
% 0.21/0.80 % PE eliminated: 0
% 0.21/0.80 % done 44 iterations in 0.040s
% 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.80
% 0.21/0.80
% 0.21/0.80 % Terminating...
% 1.07/0.89 % Runner terminated.
% 1.67/0.91 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------