TSTP Solution File: REL029+4 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : REL029+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n018.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:48:34 EDT 2023
% Result : Theorem 56.08s 10.16s
% Output : Refutation 56.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 25
% Syntax : Number of formulae : 44 ( 33 unt; 8 typ; 0 def)
% Number of atoms : 45 ( 44 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 445 ( 2 ~; 0 |; 6 &; 434 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 77 ( 0 ^; 77 !; 0 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(join_type,type,
join: $i > $i > $i ).
thf(one_type,type,
one: $i ).
thf(meet_type,type,
meet: $i > $i > $i ).
thf(composition_type,type,
composition: $i > $i > $i ).
thf(converse_type,type,
converse: $i > $i ).
thf(complement_type,type,
complement: $i > $i ).
thf(zero_type,type,
zero: $i ).
thf(top_type,type,
top: $i ).
thf(17,axiom,
! [A: $i,B: $i] :
( ( join @ ( composition @ ( converse @ A ) @ ( complement @ ( composition @ A @ B ) ) ) @ ( complement @ B ) )
= ( complement @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_cancellativity) ).
thf(69,plain,
! [A: $i,B: $i] :
( ( join @ ( composition @ ( converse @ A ) @ ( complement @ ( composition @ A @ B ) ) ) @ ( complement @ B ) )
= ( complement @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(8,axiom,
! [A: $i,B: $i] :
( A
= ( join @ ( complement @ ( join @ ( complement @ A ) @ ( complement @ B ) ) ) @ ( complement @ ( join @ ( complement @ A ) @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux3_a_kind_of_de_Morgan) ).
thf(42,plain,
! [A: $i,B: $i] :
( A
= ( join @ ( complement @ ( join @ ( complement @ A ) @ ( complement @ B ) ) ) @ ( complement @ ( join @ ( complement @ A ) @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(13,axiom,
! [A: $i,B: $i] :
( ( converse @ ( join @ A @ B ) )
= ( join @ ( converse @ A ) @ ( converse @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_additivity) ).
thf(57,plain,
! [A: $i,B: $i] :
( ( converse @ ( join @ A @ B ) )
= ( join @ ( converse @ A ) @ ( converse @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(14,axiom,
! [A: $i,B: $i] :
( ( converse @ ( composition @ A @ B ) )
= ( composition @ ( converse @ B ) @ ( converse @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_multiplicativity) ).
thf(60,plain,
! [A: $i,B: $i] :
( ( converse @ ( composition @ A @ B ) )
= ( composition @ ( converse @ B ) @ ( converse @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] :
( ( composition @ A @ ( composition @ B @ C ) )
= ( composition @ ( composition @ A @ B ) @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_associativity) ).
thf(33,plain,
! [A: $i,B: $i,C: $i] :
( ( composition @ A @ ( composition @ B @ C ) )
= ( composition @ ( composition @ A @ B ) @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(9,axiom,
! [A: $i,B: $i] :
( ( meet @ A @ B )
= ( complement @ ( join @ ( complement @ A ) @ ( complement @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux4_definiton_of_meet) ).
thf(45,plain,
! [A: $i,B: $i] :
( ( meet @ A @ B )
= ( complement @ ( join @ ( complement @ A ) @ ( complement @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(3,axiom,
! [A: $i] :
( ( converse @ ( converse @ A ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_idempotence) ).
thf(27,plain,
! [A: $i] :
( ( converse @ ( converse @ A ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(12,axiom,
! [A: $i,B: $i,C: $i] :
( ( join @ ( meet @ ( composition @ A @ B ) @ C ) @ ( meet @ ( composition @ A @ ( meet @ B @ ( composition @ ( converse @ A ) @ C ) ) ) @ C ) )
= ( meet @ ( composition @ A @ ( meet @ B @ ( composition @ ( converse @ A ) @ C ) ) ) @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modular_law_1) ).
thf(54,plain,
! [A: $i,B: $i,C: $i] :
( ( join @ ( meet @ ( composition @ A @ B ) @ C ) @ ( meet @ ( composition @ A @ ( meet @ B @ ( composition @ ( converse @ A ) @ C ) ) ) @ C ) )
= ( meet @ ( composition @ A @ ( meet @ B @ ( composition @ ( converse @ A ) @ C ) ) ) @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(7,axiom,
! [A: $i,B: $i,C: $i] :
( ( composition @ ( join @ A @ B ) @ C )
= ( join @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_distributivity) ).
thf(39,plain,
! [A: $i,B: $i,C: $i] :
( ( composition @ ( join @ A @ B ) @ C )
= ( join @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(16,axiom,
! [A: $i,B: $i] :
( ( join @ A @ B )
= ( join @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux1_join_commutativity) ).
thf(66,plain,
! [A: $i,B: $i] :
( ( join @ A @ B )
= ( join @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(18,axiom,
! [A: $i] :
( ( composition @ A @ one )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_identity) ).
thf(72,plain,
! [A: $i] :
( ( composition @ A @ one )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(10,axiom,
! [A: $i,B: $i,C: $i] :
( ( join @ ( meet @ ( composition @ A @ B ) @ C ) @ ( meet @ ( composition @ ( meet @ A @ ( composition @ C @ ( converse @ B ) ) ) @ B ) @ C ) )
= ( meet @ ( composition @ ( meet @ A @ ( composition @ C @ ( converse @ B ) ) ) @ B ) @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modular_law_2) ).
thf(48,plain,
! [A: $i,B: $i,C: $i] :
( ( join @ ( meet @ ( composition @ A @ B ) @ C ) @ ( meet @ ( composition @ ( meet @ A @ ( composition @ C @ ( converse @ B ) ) ) @ B ) @ C ) )
= ( meet @ ( composition @ ( meet @ A @ ( composition @ C @ ( converse @ B ) ) ) @ B ) @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(15,axiom,
! [A: $i] :
( top
= ( join @ A @ ( complement @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_top) ).
thf(63,plain,
! [A: $i] :
( top
= ( join @ A @ ( complement @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(6,axiom,
! [A: $i,B: $i,C: $i] :
( ( join @ A @ ( join @ B @ C ) )
= ( join @ ( join @ A @ B ) @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux2_join_associativity) ).
thf(36,plain,
! [A: $i,B: $i,C: $i] :
( ( join @ A @ ( join @ B @ C ) )
= ( join @ ( join @ A @ B ) @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ( join @ ( meet @ ( composition @ A @ B ) @ C ) @ ( composition @ ( meet @ A @ ( composition @ C @ ( converse @ B ) ) ) @ ( meet @ B @ ( composition @ ( converse @ A ) @ C ) ) ) )
= ( composition @ ( meet @ A @ ( composition @ C @ ( converse @ B ) ) ) @ ( meet @ B @ ( composition @ ( converse @ A ) @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dedekind_law) ).
thf(30,plain,
! [A: $i,B: $i,C: $i] :
( ( join @ ( meet @ ( composition @ A @ B ) @ C ) @ ( composition @ ( meet @ A @ ( composition @ C @ ( converse @ B ) ) ) @ ( meet @ B @ ( composition @ ( converse @ A ) @ C ) ) ) )
= ( composition @ ( meet @ A @ ( composition @ C @ ( converse @ B ) ) ) @ ( meet @ B @ ( composition @ ( converse @ A ) @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(11,axiom,
! [A: $i] :
( zero
= ( meet @ A @ ( complement @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_zero) ).
thf(51,plain,
! [A: $i] :
( zero
= ( meet @ A @ ( complement @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( ( join @ A @ one )
= one )
& ( ( join @ B @ one )
= one ) )
=> ( ( ( join @ ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) @ ( composition @ ( meet @ A @ B ) @ C ) )
= ( composition @ ( meet @ A @ B ) @ C ) )
& ( ( join @ ( composition @ ( meet @ A @ B ) @ C ) @ ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) )
= ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ( ( join @ A @ one )
= one )
& ( ( join @ B @ one )
= one ) )
=> ( ( ( join @ ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) @ ( composition @ ( meet @ A @ B ) @ C ) )
= ( composition @ ( meet @ A @ B ) @ C ) )
& ( ( join @ ( composition @ ( meet @ A @ B ) @ C ) @ ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) )
= ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(19,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ( ( join @ A @ one )
= one )
& ( ( join @ B @ one )
= one ) )
=> ( ( ( join @ ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) @ ( composition @ ( meet @ A @ B ) @ C ) )
= ( composition @ ( meet @ A @ B ) @ C ) )
& ( ( join @ ( composition @ ( meet @ A @ B ) @ C ) @ ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) )
= ( meet @ ( composition @ A @ C ) @ ( composition @ B @ C ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(23031,plain,
$false,
inference(e,[status(thm)],[69,42,57,60,33,45,27,54,39,66,72,48,63,36,30,51,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL029+4 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.15 % Command : run_Leo-III %s %d
% 0.16/0.35 % Computer : n018.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu May 18 18:14:29 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.98/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.26/1.01 % [INFO] Parsing done (136ms).
% 1.26/1.01 % [INFO] Running in sequential loop mode.
% 1.72/1.22 % [INFO] eprover registered as external prover.
% 1.72/1.22 % [INFO] cvc4 registered as external prover.
% 1.72/1.22 % [INFO] Scanning for conjecture ...
% 1.97/1.28 % [INFO] Found a conjecture and 16 axioms. Running axiom selection ...
% 1.97/1.33 % [INFO] Axiom selection finished. Selected 16 axioms (removed 0 axioms).
% 2.20/1.35 % [INFO] Problem is first-order (TPTP FOF).
% 2.20/1.36 % [INFO] Type checking passed.
% 2.20/1.36 % [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 ...
% 56.08/10.16 % External prover 'e' found a proof!
% 56.08/10.16 % [INFO] Killing All external provers ...
% 56.08/10.16 % Time passed: 9651ms (effective reasoning time: 9144ms)
% 56.08/10.16 % 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)>
% 56.08/10.16 % Axioms used in derivation (16): modular_law_1, converse_cancellativity, dedekind_law, composition_identity, converse_idempotence, composition_associativity, maddux3_a_kind_of_de_Morgan, maddux2_join_associativity, maddux1_join_commutativity, modular_law_2, converse_multiplicativity, converse_additivity, def_top, def_zero, composition_distributivity, maddux4_definiton_of_meet
% 56.08/10.16 % No. of inferences in proof: 36
% 56.08/10.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 9651 ms resp. 9144 ms w/o parsing
% 56.08/10.19 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 56.08/10.19 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------