TSTP Solution File: GRP665+1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : GRP665+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.68mAC6Ynfp true
% Computer : n006.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 01:52:49 EDT 2023
% Result : Theorem 0.55s 0.79s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 36 ( 25 unt; 6 typ; 0 def)
% Number of atoms : 40 ( 39 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 306 ( 12 ~; 6 |; 4 &; 284 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 0 ^; 43 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(rd_type,type,
rd: $i > $i > $i ).
thf(sk__1_type,type,
sk__1: $i ).
thf(ld_type,type,
ld: $i > $i > $i ).
thf(mult_type,type,
mult: $i > $i > $i ).
thf(op_c_type,type,
op_c: $i ).
thf(sk__type,type,
sk_: $i ).
thf(goals,conjecture,
! [X0: $i,X1: $i] :
( ( ( mult @ ( mult @ X0 @ X1 ) @ op_c )
= ( mult @ X0 @ ( mult @ X1 @ op_c ) ) )
& ( ( mult @ ( mult @ X0 @ op_c ) @ X1 )
= ( mult @ X0 @ ( mult @ op_c @ X1 ) ) )
& ( ( mult @ op_c @ ( mult @ X0 @ X1 ) )
= ( mult @ ( mult @ op_c @ X0 ) @ X1 ) ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [X0: $i,X1: $i] :
( ( ( mult @ ( mult @ X0 @ X1 ) @ op_c )
= ( mult @ X0 @ ( mult @ X1 @ op_c ) ) )
& ( ( mult @ ( mult @ X0 @ op_c ) @ X1 )
= ( mult @ X0 @ ( mult @ op_c @ X1 ) ) )
& ( ( mult @ op_c @ ( mult @ X0 @ X1 ) )
= ( mult @ ( mult @ op_c @ X0 ) @ X1 ) ) ),
inference('cnf.neg',[status(esa)],[goals]) ).
thf(zip_derived_cl9,plain,
( ( ( mult @ ( mult @ sk_ @ sk__1 ) @ op_c )
!= ( mult @ sk_ @ ( mult @ sk__1 @ op_c ) ) )
| ( ( mult @ ( mult @ sk_ @ op_c ) @ sk__1 )
!= ( mult @ sk_ @ ( mult @ op_c @ sk__1 ) ) )
| ( ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) )
!= ( mult @ ( mult @ op_c @ sk_ ) @ sk__1 ) ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(f09,axiom,
! [A: $i] :
( ( mult @ op_c @ A )
= ( mult @ A @ op_c ) ) ).
thf(zip_derived_cl8,plain,
! [X0: $i] :
( ( mult @ op_c @ X0 )
= ( mult @ X0 @ op_c ) ),
inference(cnf,[status(esa)],[f09]) ).
thf(zip_derived_cl8_001,plain,
! [X0: $i] :
( ( mult @ op_c @ X0 )
= ( mult @ X0 @ op_c ) ),
inference(cnf,[status(esa)],[f09]) ).
thf(zip_derived_cl8_002,plain,
! [X0: $i] :
( ( mult @ op_c @ X0 )
= ( mult @ X0 @ op_c ) ),
inference(cnf,[status(esa)],[f09]) ).
thf(zip_derived_cl11,plain,
( ( ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) )
!= ( mult @ sk_ @ ( mult @ op_c @ sk__1 ) ) )
| ( ( mult @ ( mult @ op_c @ sk_ ) @ sk__1 )
!= ( mult @ sk_ @ ( mult @ op_c @ sk__1 ) ) )
| ( ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) )
!= ( mult @ ( mult @ op_c @ sk_ ) @ sk__1 ) ) ),
inference(demod,[status(thm)],[zip_derived_cl9,zip_derived_cl8,zip_derived_cl8,zip_derived_cl8]) ).
thf(zip_derived_cl8_003,plain,
! [X0: $i] :
( ( mult @ op_c @ X0 )
= ( mult @ X0 @ op_c ) ),
inference(cnf,[status(esa)],[f09]) ).
thf(f07,axiom,
! [C: $i,B: $i,A: $i] :
( ( mult @ A @ ( mult @ B @ C ) )
= ( mult @ ( rd @ ( mult @ A @ B ) @ A ) @ ( mult @ A @ C ) ) ) ).
thf(zip_derived_cl6,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( mult @ X0 @ ( mult @ X1 @ X2 ) )
= ( mult @ ( rd @ ( mult @ X0 @ X1 ) @ X0 ) @ ( mult @ X0 @ X2 ) ) ),
inference(cnf,[status(esa)],[f07]) ).
thf(zip_derived_cl51,plain,
! [X0: $i,X1: $i] :
( ( mult @ X0 @ ( mult @ op_c @ X1 ) )
= ( mult @ ( rd @ ( mult @ op_c @ X0 ) @ X0 ) @ ( mult @ X0 @ X1 ) ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl8,zip_derived_cl6]) ).
thf(f04,axiom,
! [B: $i,A: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ) ).
thf(zip_derived_cl3,plain,
! [X0: $i,X1: $i] :
( ( rd @ ( mult @ X0 @ X1 ) @ X1 )
= X0 ),
inference(cnf,[status(esa)],[f04]) ).
thf(zip_derived_cl59,plain,
! [X0: $i,X1: $i] :
( ( mult @ X0 @ ( mult @ op_c @ X1 ) )
= ( mult @ op_c @ ( mult @ X0 @ X1 ) ) ),
inference(demod,[status(thm)],[zip_derived_cl51,zip_derived_cl3]) ).
thf(zip_derived_cl59_004,plain,
! [X0: $i,X1: $i] :
( ( mult @ X0 @ ( mult @ op_c @ X1 ) )
= ( mult @ op_c @ ( mult @ X0 @ X1 ) ) ),
inference(demod,[status(thm)],[zip_derived_cl51,zip_derived_cl3]) ).
thf(zip_derived_cl62,plain,
( ( ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) )
!= ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) ) )
| ( ( mult @ ( mult @ op_c @ sk_ ) @ sk__1 )
!= ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) ) )
| ( ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) )
!= ( mult @ ( mult @ op_c @ sk_ ) @ sk__1 ) ) ),
inference(demod,[status(thm)],[zip_derived_cl11,zip_derived_cl59,zip_derived_cl59]) ).
thf(zip_derived_cl63,plain,
( ( mult @ ( mult @ op_c @ sk_ ) @ sk__1 )
!= ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) ) ),
inference(simplify,[status(thm)],[zip_derived_cl62]) ).
thf(zip_derived_cl8_005,plain,
! [X0: $i] :
( ( mult @ op_c @ X0 )
= ( mult @ X0 @ op_c ) ),
inference(cnf,[status(esa)],[f09]) ).
thf(f08,axiom,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ B ) @ C )
= ( mult @ ( mult @ A @ C ) @ ( ld @ C @ ( mult @ B @ C ) ) ) ) ).
thf(zip_derived_cl7,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( mult @ ( mult @ X0 @ X2 ) @ X1 )
= ( mult @ ( mult @ X0 @ X1 ) @ ( ld @ X1 @ ( mult @ X2 @ X1 ) ) ) ),
inference(cnf,[status(esa)],[f08]) ).
thf(zip_derived_cl115,plain,
! [X0: $i,X1: $i] :
( ( mult @ ( mult @ X0 @ X1 ) @ op_c )
= ( mult @ ( mult @ op_c @ X0 ) @ ( ld @ op_c @ ( mult @ X1 @ op_c ) ) ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl8,zip_derived_cl7]) ).
thf(zip_derived_cl8_006,plain,
! [X0: $i] :
( ( mult @ op_c @ X0 )
= ( mult @ X0 @ op_c ) ),
inference(cnf,[status(esa)],[f09]) ).
thf(zip_derived_cl8_007,plain,
! [X0: $i] :
( ( mult @ op_c @ X0 )
= ( mult @ X0 @ op_c ) ),
inference(cnf,[status(esa)],[f09]) ).
thf(f02,axiom,
! [B: $i,A: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ) ).
thf(zip_derived_cl1,plain,
! [X0: $i,X1: $i] :
( ( ld @ X1 @ ( mult @ X1 @ X0 ) )
= X0 ),
inference(cnf,[status(esa)],[f02]) ).
thf(zip_derived_cl20,plain,
! [X0: $i] :
( ( ld @ op_c @ ( mult @ X0 @ op_c ) )
= X0 ),
inference('s_sup+',[status(thm)],[zip_derived_cl8,zip_derived_cl1]) ).
thf(zip_derived_cl131,plain,
! [X0: $i,X1: $i] :
( ( mult @ op_c @ ( mult @ X0 @ X1 ) )
= ( mult @ ( mult @ op_c @ X0 ) @ X1 ) ),
inference(demod,[status(thm)],[zip_derived_cl115,zip_derived_cl8,zip_derived_cl20]) ).
thf(zip_derived_cl265,plain,
( ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) )
!= ( mult @ op_c @ ( mult @ sk_ @ sk__1 ) ) ),
inference(demod,[status(thm)],[zip_derived_cl63,zip_derived_cl131]) ).
thf(zip_derived_cl266,plain,
$false,
inference(simplify,[status(thm)],[zip_derived_cl265]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP665+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.68mAC6Ynfp true
% 0.13/0.35 % Computer : n006.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 : Mon Aug 28 23:47:51 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in FO mode
% 0.53/0.64 % Total configuration time : 435
% 0.53/0.64 % Estimated wc time : 1092
% 0.53/0.64 % Estimated cpu time (7 cpus) : 156.0
% 0.53/0.70 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.55/0.73 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.55/0.73 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.55/0.74 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.55/0.75 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.55/0.75 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.55/0.75 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.55/0.79 % Solved by fo/fo6_bce.sh.
% 0.55/0.79 % BCE start: 10
% 0.55/0.79 % BCE eliminated: 0
% 0.55/0.79 % PE start: 10
% 0.55/0.79 logic: eq
% 0.55/0.79 % PE eliminated: 0
% 0.55/0.79 % done 46 iterations in 0.049s
% 0.55/0.79 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.55/0.79 % SZS output start Refutation
% See solution above
% 0.55/0.79
% 0.55/0.79
% 0.55/0.79 % Terminating...
% 1.44/0.86 % Runner terminated.
% 1.44/0.87 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------