TSTP Solution File: GRP703+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : GRP703+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n031.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 May 19 11:15:13 EDT 2023
% Result : Theorem 3.50s 1.92s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 22
% Syntax : Number of formulae : 38 ( 27 unt; 8 typ; 0 def)
% Number of atoms : 36 ( 35 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 232 ( 2 ~; 0 |; 6 &; 224 @)
% ( 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 : 10 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 0 ^; 54 !; 0 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(mult_type,type,
mult: $i > $i > $i ).
thf(op_e_type,type,
op_e: $i ).
thf(ld_type,type,
ld: $i > $i > $i ).
thf(rd_type,type,
rd: $i > $i > $i ).
thf(unit_type,type,
unit: $i ).
thf(op_c_type,type,
op_c: $i ).
thf(op_d_type,type,
op_d: $i ).
thf(op_f_type,type,
op_f: $i ).
thf(15,axiom,
! [A: $i,B: $i] :
( op_f
= ( mult @ B @ ( mult @ A @ ( ld @ ( mult @ B @ A ) @ op_c ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f13) ).
thf(56,plain,
! [A: $i,B: $i] :
( op_f
= ( mult @ B @ ( mult @ A @ ( ld @ ( mult @ B @ A ) @ op_c ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(9,axiom,
! [A: $i,B: $i,C: $i] :
( ( mult @ C @ ( mult @ B @ ( mult @ B @ A ) ) )
= ( mult @ ( mult @ ( mult @ C @ B ) @ B ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
thf(38,plain,
! [A: $i,B: $i,C: $i] :
( ( mult @ C @ ( mult @ B @ ( mult @ B @ A ) ) )
= ( mult @ ( mult @ ( mult @ C @ B ) @ B ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(14,axiom,
! [A: $i,B: $i] :
( op_e
= ( mult @ ( mult @ ( rd @ op_c @ ( mult @ B @ A ) ) @ A ) @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f12) ).
thf(53,plain,
! [A: $i,B: $i] :
( op_e
= ( mult @ ( mult @ ( rd @ op_c @ ( mult @ B @ A ) ) @ A ) @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(10,axiom,
! [A: $i,B: $i] :
( ( mult @ op_c @ ( mult @ B @ A ) )
= ( mult @ ( mult @ op_c @ B ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
thf(41,plain,
! [A: $i,B: $i] :
( ( mult @ op_c @ ( mult @ B @ A ) )
= ( mult @ ( mult @ op_c @ B ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(7,axiom,
! [A: $i] :
( ( mult @ A @ unit )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
thf(32,plain,
! [A: $i] :
( ( mult @ A @ unit )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(11,axiom,
! [A: $i,B: $i] :
( ( mult @ B @ ( mult @ A @ op_c ) )
= ( mult @ ( mult @ B @ A ) @ op_c ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
thf(44,plain,
! [A: $i,B: $i] :
( ( mult @ B @ ( mult @ A @ op_c ) )
= ( mult @ ( mult @ B @ A ) @ op_c ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(8,axiom,
! [A: $i] :
( ( mult @ unit @ A )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
thf(35,plain,
! [A: $i] :
( ( mult @ unit @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(12,axiom,
! [A: $i,B: $i] :
( ( mult @ B @ ( mult @ op_c @ A ) )
= ( mult @ ( mult @ B @ op_c ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
thf(47,plain,
! [A: $i,B: $i] :
( ( mult @ B @ ( mult @ op_c @ A ) )
= ( mult @ ( mult @ B @ op_c ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( mult @ B @ ( ld @ B @ A ) )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
thf(20,plain,
! [A: $i,B: $i] :
( ( mult @ B @ ( ld @ B @ A ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( rd @ ( mult @ B @ A ) @ A )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
thf(29,plain,
! [A: $i,B: $i] :
( ( rd @ ( mult @ B @ A ) @ A )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(13,axiom,
! [A: $i] :
( op_d
= ( ld @ A @ ( mult @ op_c @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).
thf(50,plain,
! [A: $i] :
( op_d
= ( ld @ A @ ( mult @ op_c @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ( ( mult @ op_e @ ( mult @ A @ B ) )
= ( mult @ ( mult @ op_e @ A ) @ B ) )
& ( ( mult @ A @ ( mult @ B @ op_e ) )
= ( mult @ ( mult @ A @ B ) @ op_e ) )
& ( ( mult @ A @ ( mult @ op_e @ B ) )
= ( mult @ ( mult @ A @ op_e ) @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( ( mult @ op_e @ ( mult @ A @ B ) )
= ( mult @ ( mult @ op_e @ A ) @ B ) )
& ( ( mult @ A @ ( mult @ B @ op_e ) )
= ( mult @ ( mult @ A @ B ) @ op_e ) )
& ( ( mult @ A @ ( mult @ op_e @ B ) )
= ( mult @ ( mult @ A @ op_e ) @ B ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(16,plain,
~ ! [A: $i,B: $i] :
( ( ( mult @ op_e @ ( mult @ A @ B ) )
= ( mult @ ( mult @ op_e @ A ) @ B ) )
& ( ( mult @ A @ ( mult @ B @ op_e ) )
= ( mult @ ( mult @ A @ B ) @ op_e ) )
& ( ( mult @ A @ ( mult @ op_e @ B ) )
= ( mult @ ( mult @ A @ op_e ) @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( mult @ ( rd @ B @ A ) @ A )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
thf(26,plain,
! [A: $i,B: $i] :
( ( mult @ ( rd @ B @ A ) @ A )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( ld @ B @ ( mult @ B @ A ) )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
thf(23,plain,
! [A: $i,B: $i] :
( ( ld @ B @ ( mult @ B @ A ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(63,plain,
$false,
inference(e,[status(thm)],[56,38,53,41,32,44,35,47,20,29,50,16,26,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP703+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n031.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 19 02:20:41 EDT 2023
% 0.16/0.37 % CPUTime :
% 1.02/0.92 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.27/1.06 % [INFO] Parsing done (136ms).
% 1.27/1.07 % [INFO] Running in sequential loop mode.
% 1.67/1.28 % [INFO] eprover registered as external prover.
% 1.67/1.28 % [INFO] cvc4 registered as external prover.
% 1.67/1.28 % [INFO] Scanning for conjecture ...
% 1.92/1.35 % [INFO] Found a conjecture and 13 axioms. Running axiom selection ...
% 1.92/1.38 % [INFO] Axiom selection finished. Selected 13 axioms (removed 0 axioms).
% 2.13/1.40 % [INFO] Problem is first-order (TPTP FOF).
% 2.13/1.40 % [INFO] Type checking passed.
% 2.13/1.40 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 3.50/1.92 % External prover 'e' found a proof!
% 3.50/1.92 % [INFO] Killing All external provers ...
% 3.50/1.92 % Time passed: 1384ms (effective reasoning time: 849ms)
% 3.50/1.92 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 3.50/1.92 % Axioms used in derivation (13): f08, f03, f07, f10, f06, f11, f05, f01, f12, f02, f13, f04, f09
% 3.50/1.92 % No. of inferences in proof: 30
% 3.50/1.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1384 ms resp. 849 ms w/o parsing
% 3.50/1.96 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.50/1.96 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------