TSTP Solution File: GRP167-2 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : GRP167-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n024.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:13:22 EDT 2023
% Result : Unsatisfiable 5.25s 2.14s
% Output : Refutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 31
% Syntax : Number of formulae : 55 ( 47 unt; 8 typ; 0 def)
% Number of atoms : 47 ( 46 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 260 ( 2 ~; 0 |; 0 &; 258 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 0 ^; 88 !; 0 ?; 88 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $i ).
thf(multiply_type,type,
multiply: $i > $i > $i ).
thf(positive_part_type,type,
positive_part: $i > $i ).
thf(negative_part_type,type,
negative_part: $i > $i ).
thf(least_upper_bound_type,type,
least_upper_bound: $i > $i > $i ).
thf(greatest_lower_bound_type,type,
greatest_lower_bound: $i > $i > $i ).
thf(inverse_type,type,
inverse: $i > $i ).
thf(identity_type,type,
identity: $i ).
thf(23,axiom,
! [C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( greatest_lower_bound @ B @ C ) )
= ( greatest_lower_bound @ ( multiply @ A @ B ) @ ( multiply @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
thf(69,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( greatest_lower_bound @ B @ C ) )
= ( greatest_lower_bound @ ( multiply @ A @ B ) @ ( multiply @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[23]) ).
thf(19,axiom,
! [B: $i,A: $i] :
( ( inverse @ ( multiply @ A @ B ) )
= ( multiply @ ( inverse @ B ) @ ( inverse @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_3) ).
thf(61,plain,
! [B: $i,A: $i] :
( ( inverse @ ( multiply @ A @ B ) )
= ( multiply @ ( inverse @ B ) @ ( inverse @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).
thf(5,axiom,
( ( inverse @ identity )
= identity ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_1) ).
thf(33,plain,
( ( inverse @ identity )
= identity ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(21,axiom,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ B ) @ C )
= ( multiply @ A @ ( multiply @ B @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
thf(65,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ B ) @ C )
= ( multiply @ A @ ( multiply @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).
thf(15,axiom,
! [A: $i] :
( ( positive_part @ A )
= ( least_upper_bound @ A @ identity ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_4) ).
thf(53,plain,
! [A: $i] :
( ( positive_part @ A )
= ( least_upper_bound @ A @ identity ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(9,axiom,
! [B: $i,A: $i] :
( ( least_upper_bound @ A @ ( greatest_lower_bound @ A @ B ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
thf(41,plain,
! [B: $i,A: $i] :
( ( least_upper_bound @ A @ ( greatest_lower_bound @ A @ B ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(11,axiom,
! [C: $i,B: $i,A: $i] :
( ( greatest_lower_bound @ A @ ( greatest_lower_bound @ B @ C ) )
= ( greatest_lower_bound @ ( greatest_lower_bound @ A @ B ) @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
thf(45,plain,
! [C: $i,B: $i,A: $i] :
( ( greatest_lower_bound @ A @ ( greatest_lower_bound @ B @ C ) )
= ( greatest_lower_bound @ ( greatest_lower_bound @ A @ B ) @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(13,axiom,
! [B: $i,A: $i] :
( ( greatest_lower_bound @ A @ B )
= ( greatest_lower_bound @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
thf(49,plain,
! [B: $i,A: $i] :
( ( greatest_lower_bound @ A @ B )
= ( greatest_lower_bound @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(8,axiom,
! [B: $i,A: $i] :
( ( least_upper_bound @ A @ B )
= ( least_upper_bound @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
thf(39,plain,
! [B: $i,A: $i] :
( ( least_upper_bound @ A @ B )
= ( least_upper_bound @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] :
( ( greatest_lower_bound @ A @ ( least_upper_bound @ B @ C ) )
= ( least_upper_bound @ ( greatest_lower_bound @ A @ B ) @ ( greatest_lower_bound @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_7) ).
thf(35,plain,
! [C: $i,B: $i,A: $i] :
( ( greatest_lower_bound @ A @ ( least_upper_bound @ B @ C ) )
= ( least_upper_bound @ ( greatest_lower_bound @ A @ B ) @ ( greatest_lower_bound @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(20,axiom,
! [A: $i] :
( ( multiply @ identity @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
thf(63,plain,
! [A: $i] :
( ( multiply @ identity @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).
thf(10,axiom,
! [B: $i,A: $i] :
( ( greatest_lower_bound @ A @ ( least_upper_bound @ A @ B ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
thf(43,plain,
! [B: $i,A: $i] :
( ( greatest_lower_bound @ A @ ( least_upper_bound @ A @ B ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(16,axiom,
! [A: $i] :
( ( multiply @ ( inverse @ A ) @ A )
= identity ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
thf(55,plain,
! [A: $i] :
( ( multiply @ ( inverse @ A ) @ A )
= identity ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(14,axiom,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( least_upper_bound @ A @ B ) @ C )
= ( least_upper_bound @ ( multiply @ A @ C ) @ ( multiply @ B @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
thf(51,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( least_upper_bound @ A @ B ) @ C )
= ( least_upper_bound @ ( multiply @ A @ C ) @ ( multiply @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(12,axiom,
! [C: $i,B: $i,A: $i] :
( ( least_upper_bound @ A @ ( least_upper_bound @ B @ C ) )
= ( least_upper_bound @ ( least_upper_bound @ A @ B ) @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
thf(47,plain,
! [C: $i,B: $i,A: $i] :
( ( least_upper_bound @ A @ ( least_upper_bound @ B @ C ) )
= ( least_upper_bound @ ( least_upper_bound @ A @ B ) @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(1,negated_conjecture,
( a
!= ( multiply @ ( positive_part @ a ) @ ( negative_part @ a ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lat4) ).
thf(24,plain,
( a
!= ( multiply @ ( positive_part @ a ) @ ( negative_part @ a ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(7,axiom,
! [A: $i] :
( ( greatest_lower_bound @ A @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
thf(37,plain,
! [A: $i] :
( ( greatest_lower_bound @ A @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(17,axiom,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( greatest_lower_bound @ A @ B ) @ C )
= ( greatest_lower_bound @ ( multiply @ A @ C ) @ ( multiply @ B @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
thf(57,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( greatest_lower_bound @ A @ B ) @ C )
= ( greatest_lower_bound @ ( multiply @ A @ C ) @ ( multiply @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(3,axiom,
! [C: $i,B: $i,A: $i] :
( ( least_upper_bound @ A @ ( greatest_lower_bound @ B @ C ) )
= ( greatest_lower_bound @ ( least_upper_bound @ A @ B ) @ ( least_upper_bound @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_6) ).
thf(29,plain,
! [C: $i,B: $i,A: $i] :
( ( least_upper_bound @ A @ ( greatest_lower_bound @ B @ C ) )
= ( greatest_lower_bound @ ( least_upper_bound @ A @ B ) @ ( least_upper_bound @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(18,axiom,
! [A: $i] :
( ( negative_part @ A )
= ( greatest_lower_bound @ A @ identity ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_5) ).
thf(59,plain,
! [A: $i] :
( ( negative_part @ A )
= ( greatest_lower_bound @ A @ identity ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(2,axiom,
! [A: $i] :
( ( least_upper_bound @ A @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_lub) ).
thf(27,plain,
! [A: $i] :
( ( least_upper_bound @ A @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(22,axiom,
! [C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( least_upper_bound @ B @ C ) )
= ( least_upper_bound @ ( multiply @ A @ B ) @ ( multiply @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
thf(67,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( least_upper_bound @ B @ C ) )
= ( least_upper_bound @ ( multiply @ A @ B ) @ ( multiply @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[22]) ).
thf(4,axiom,
! [A: $i] :
( ( inverse @ ( inverse @ A ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_2) ).
thf(31,plain,
! [A: $i] :
( ( inverse @ ( inverse @ A ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(234,plain,
$false,
inference(e,[status(thm)],[69,61,33,65,53,41,45,49,39,35,63,43,55,51,47,24,37,57,29,59,27,67,31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP167-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.14/0.36 % Computer : n024.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 May 19 01:35:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.89/0.83 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/0.96 % [INFO] Parsing done (126ms).
% 1.20/0.97 % [INFO] Running in sequential loop mode.
% 1.61/1.16 % [INFO] eprover registered as external prover.
% 1.61/1.16 % [INFO] cvc4 registered as external prover.
% 1.61/1.17 % [INFO] Scanning for conjecture ...
% 1.91/1.22 % [INFO] Found a conjecture and 22 axioms. Running axiom selection ...
% 1.93/1.25 % [INFO] Axiom selection finished. Selected 22 axioms (removed 0 axioms).
% 1.93/1.27 % [INFO] Problem is propositional (TPTP CNF).
% 1.93/1.28 % [INFO] Type checking passed.
% 1.93/1.28 % [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 ...
% 5.25/2.14 % External prover 'e' found a proof!
% 5.25/2.14 % [INFO] Killing All external provers ...
% 5.25/2.14 % Time passed: 1629ms (effective reasoning time: 1173ms)
% 5.25/2.14 % 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)>
% 5.25/2.14 % Axioms used in derivation (22): associativity, monotony_lub1, lat4_5, idempotence_of_lub, monotony_glb1, left_inverse, lat4_4, glb_absorbtion, lat4_1, idempotence_of_gld, associativity_of_glb, symmetry_of_lub, lat4_6, monotony_lub2, left_identity, lat4_3, symmetry_of_glb, lat4_2, lat4_7, monotony_glb2, associativity_of_lub, lub_absorbtion
% 5.25/2.14 % No. of inferences in proof: 47
% 5.25/2.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1629 ms resp. 1173 ms w/o parsing
% 5.25/2.17 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.25/2.17 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------