TSTP Solution File: GRP148-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n002.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:19 EDT 2023
% Result : Unsatisfiable 2.77s 1.58s
% Output : Refutation 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 26
% Syntax : Number of formulae : 45 ( 37 unt; 8 typ; 0 def)
% Number of atoms : 37 ( 36 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 200 ( 2 ~; 0 |; 0 &; 198 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 66 ( 0 ^; 66 !; 0 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
thf(greatest_lower_bound_type,type,
greatest_lower_bound: $i > $i > $i ).
thf(least_upper_bound_type,type,
least_upper_bound: $i > $i > $i ).
thf(a_type,type,
a: $i ).
thf(b_type,type,
b: $i ).
thf(c_type,type,
c: $i ).
thf(multiply_type,type,
multiply: $i > $i > $i ).
thf(inverse_type,type,
inverse: $i > $i ).
thf(identity_type,type,
identity: $i ).
thf(17,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/sandbox2/benchmark/theBenchmark.p',monotony_glb1) ).
thf(52,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)],[17]) ).
thf(14,axiom,
( ( least_upper_bound @ b @ c )
= c ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1c_2) ).
thf(46,plain,
( ( least_upper_bound @ b @ c )
= c ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(18,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/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).
thf(54,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)],[18]) ).
thf(15,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/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).
thf(48,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)],[15]) ).
thf(16,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/sandbox2/benchmark/theBenchmark.p',monotony_lub1) ).
thf(50,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)],[16]) ).
thf(12,axiom,
! [B: $i,A: $i] :
( ( greatest_lower_bound @ A @ ( least_upper_bound @ A @ B ) )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
thf(42,plain,
! [B: $i,A: $i] :
( ( greatest_lower_bound @ A @ ( least_upper_bound @ A @ B ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(3,axiom,
! [A: $i] :
( ( multiply @ identity @ A )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
thf(24,plain,
! [A: $i] :
( ( multiply @ identity @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(5,axiom,
! [B: $i,A: $i] :
( ( greatest_lower_bound @ A @ B )
= ( greatest_lower_bound @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
thf(28,plain,
! [B: $i,A: $i] :
( ( greatest_lower_bound @ A @ B )
= ( greatest_lower_bound @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(10,axiom,
! [A: $i] :
( ( least_upper_bound @ A @ A )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_of_lub) ).
thf(38,plain,
! [A: $i] :
( ( least_upper_bound @ A @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(7,axiom,
! [A: $i] :
( ( greatest_lower_bound @ A @ A )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_of_gld) ).
thf(32,plain,
! [A: $i] :
( ( greatest_lower_bound @ A @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(8,axiom,
! [B: $i,A: $i] :
( ( least_upper_bound @ A @ B )
= ( least_upper_bound @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
thf(34,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(2,axiom,
! [A: $i] :
( ( multiply @ ( inverse @ A ) @ A )
= identity ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
thf(22,plain,
! [A: $i] :
( ( multiply @ ( inverse @ A ) @ A )
= identity ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(13,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/sandbox2/benchmark/theBenchmark.p',associativity_of_glb) ).
thf(44,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)],[13]) ).
thf(11,axiom,
! [B: $i,A: $i] :
( ( least_upper_bound @ A @ ( greatest_lower_bound @ A @ B ) )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
thf(40,plain,
! [B: $i,A: $i] :
( ( least_upper_bound @ A @ ( greatest_lower_bound @ A @ B ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(4,axiom,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ B ) @ C )
= ( multiply @ A @ ( multiply @ B @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).
thf(26,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)],[4]) ).
thf(9,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/sandbox2/benchmark/theBenchmark.p',monotony_glb2) ).
thf(36,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)],[9]) ).
thf(6,axiom,
( ( least_upper_bound @ a @ c )
= c ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1c_1) ).
thf(30,plain,
( ( least_upper_bound @ a @ c )
= c ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(1,negated_conjecture,
( ( greatest_lower_bound @ ( least_upper_bound @ a @ b ) @ c )
!= ( least_upper_bound @ a @ b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_lub1c) ).
thf(19,plain,
( ( greatest_lower_bound @ ( least_upper_bound @ a @ b ) @ c )
!= ( least_upper_bound @ a @ b ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(63,plain,
$false,
inference(cvc4,[status(thm)],[52,46,54,48,50,42,24,28,38,32,34,22,44,40,26,36,30,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 19 01:52:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.94/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.13/0.96 % [INFO] Parsing done (114ms).
% 1.13/0.97 % [INFO] Running in sequential loop mode.
% 1.63/1.16 % [INFO] eprover registered as external prover.
% 1.63/1.16 % [INFO] cvc4 registered as external prover.
% 1.63/1.16 % [INFO] Scanning for conjecture ...
% 1.63/1.21 % [INFO] Found a conjecture and 17 axioms. Running axiom selection ...
% 1.87/1.24 % [INFO] Axiom selection finished. Selected 17 axioms (removed 0 axioms).
% 1.87/1.26 % [INFO] Problem is propositional (TPTP CNF).
% 1.87/1.26 % [INFO] Type checking passed.
% 1.87/1.26 % [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.77/1.57 % External prover 'cvc4' found a proof!
% 2.77/1.57 % [INFO] Killing All external provers ...
% 2.77/1.57 % Time passed: 1049ms (effective reasoning time: 600ms)
% 2.77/1.57 % 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.77/1.58 % Axioms used in derivation (17): associativity, monotony_lub1, idempotence_of_lub, monotony_glb1, left_inverse, symmetry_of_glb, glb_absorbtion, idempotence_of_gld, associativity_of_glb, ax_lub1c_1, symmetry_of_lub, monotony_lub2, left_identity, ax_lub1c_2, monotony_glb2, associativity_of_lub, lub_absorbtion
% 2.77/1.58 % No. of inferences in proof: 37
% 2.77/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1049 ms resp. 600 ms w/o parsing
% 2.77/1.64 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.77/1.64 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------