TSTP Solution File: GRP665-10 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : GRP665-10 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 May 19 11:15:03 EDT 2023
% Result : Unsatisfiable 2.57s 1.56s
% Output : Refutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 17
% Syntax : Number of formulae : 28 ( 21 unt; 7 typ; 0 def)
% Number of atoms : 21 ( 20 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 114 ( 2 ~; 0 |; 0 &; 112 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 34 ( 0 ^; 34 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(mult_type,type,
mult: $i > $i > $i ).
thf(op_c_type,type,
op_c: $i ).
thf(x0_type,type,
x0: $i ).
thf(x1_type,type,
x1: $i ).
thf(ld_type,type,
ld: $i > $i > $i ).
thf(rd_type,type,
rd: $i > $i > $i ).
thf(unit_type,type,
unit: $i ).
thf(7,axiom,
! [A: $i] :
( ( mult @ unit @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
thf(24,plain,
! [A: $i] :
( ( mult @ unit @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ( mult @ A @ ( ld @ A @ B ) )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( mult @ A @ ( ld @ A @ B ) )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,axiom,
! [B: $i,A: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(9,axiom,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ B ) @ C )
= ( mult @ ( mult @ A @ C ) @ ( ld @ C @ ( mult @ B @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
thf(28,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ B ) @ C )
= ( mult @ ( mult @ A @ C ) @ ( ld @ C @ ( mult @ B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(6,axiom,
! [A: $i] :
( ( mult @ A @ unit )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
thf(22,plain,
! [A: $i] :
( ( mult @ A @ unit )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [B: $i,A: $i] :
( ( mult @ ( rd @ A @ B ) @ B )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( mult @ ( rd @ A @ B ) @ B )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
thf(16,plain,
! [B: $i,A: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,negated_conjecture,
( ( mult @ op_c @ ( mult @ x0 @ x1 ) )
!= ( mult @ ( mult @ op_c @ x0 ) @ x1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
thf(11,plain,
( ( mult @ op_c @ ( mult @ x0 @ x1 ) )
!= ( mult @ ( mult @ op_c @ x0 ) @ x1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(8,axiom,
! [C: $i,B: $i,A: $i] :
( ( mult @ A @ ( mult @ B @ C ) )
= ( mult @ ( rd @ ( mult @ A @ B ) @ A ) @ ( mult @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
thf(26,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ A @ ( mult @ B @ C ) )
= ( mult @ ( rd @ ( mult @ A @ B ) @ A ) @ ( mult @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(10,axiom,
! [A: $i] :
( ( mult @ op_c @ A )
= ( mult @ A @ op_c ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
thf(30,plain,
! [A: $i] :
( ( mult @ op_c @ A )
= ( mult @ A @ op_c ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(36,plain,
$false,
inference(e,[status(thm)],[24,14,20,28,22,18,16,11,26,30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP665-10 : TPTP v8.1.2. Released v8.1.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 19 02:15:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.85/0.83 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/0.95 % [INFO] Parsing done (116ms).
% 1.19/0.96 % [INFO] Running in sequential loop mode.
% 1.48/1.15 % [INFO] eprover registered as external prover.
% 1.48/1.15 % [INFO] cvc4 registered as external prover.
% 1.48/1.15 % [INFO] Scanning for conjecture ...
% 1.76/1.20 % [INFO] Found a conjecture and 9 axioms. Running axiom selection ...
% 1.76/1.22 % [INFO] Axiom selection finished. Selected 9 axioms (removed 0 axioms).
% 1.86/1.23 % [INFO] Problem is propositional (TPTP CNF).
% 1.86/1.24 % [INFO] Type checking passed.
% 1.86/1.24 % [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 ...
% 2.57/1.56 % External prover 'e' found a proof!
% 2.57/1.56 % [INFO] Killing All external provers ...
% 2.57/1.56 % Time passed: 1050ms (effective reasoning time: 600ms)
% 2.57/1.56 % 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)>
% 2.57/1.56 % Axioms used in derivation (9): f08, f03, f02, f07, f06, f05, f01, f04, f09
% 2.57/1.56 % No. of inferences in proof: 21
% 2.57/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1050 ms resp. 600 ms w/o parsing
% 2.57/1.62 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.57/1.62 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------