TSTP Solution File: SEV167^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV167^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n021.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 : Mon Jun 24 15:58:24 EDT 2024
% Result : Theorem 7.75s 2.55s
% Output : Refutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 28 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 123 ( 18 ~; 9 |; 3 &; 84 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 58 ( 58 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 5 con; 0-4 aty)
% Number of variables : 80 ( 50 ^ 30 !; 0 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > a > a > a > $o ).
thf(sk2_type,type,
sk2: a ).
thf(sk3_type,type,
sk3: a ).
thf(sk4_type,type,
sk4: a ).
thf(sk5_type,type,
sk5: a ).
thf(1,conjecture,
! [A: a > a > a > a > $o] :
( ! [B: ( a > a > a ) > a,C: ( a > a > a ) > a] :
( ( A
@ ( B
@ ^ [D: a,E: a] : D )
@ ( B
@ ^ [D: a,E: a] : E )
@ ( C
@ ^ [D: a,E: a] : D )
@ ( C
@ ^ [D: a,E: a] : E ) )
=> ( B = C ) )
=> ! [B: a,C: a,D: a,E: a] :
( ( A @ B @ C @ D @ E )
=> ( ( B = D )
& ( C = E ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM189_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a > a > a > $o] :
( ! [B: ( a > a > a ) > a,C: ( a > a > a ) > a] :
( ( A
@ ( B
@ ^ [D: a,E: a] : D )
@ ( B
@ ^ [D: a,E: a] : E )
@ ( C
@ ^ [D: a,E: a] : D )
@ ( C
@ ^ [D: a,E: a] : E ) )
=> ( B = C ) )
=> ! [B: a,C: a,D: a,E: a] :
( ( A @ B @ C @ D @ E )
=> ( ( B = D )
& ( C = E ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a > a > a > $o] :
( ! [B: ( a > a > a ) > a,C: ( a > a > a ) > a] :
( ( A
@ ( B
@ ^ [D: a,E: a] : D )
@ ( B
@ ^ [D: a,E: a] : E )
@ ( C
@ ^ [D: a,E: a] : D )
@ ( C
@ ^ [D: a,E: a] : E ) )
=> ( B = C ) )
=> ! [B: a,C: a,D: a,E: a] :
( ( A @ B @ C @ D @ E )
=> ( ( B = D )
& ( C = E ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
sk1 @ sk2 @ sk3 @ sk4 @ sk5,
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
! [B: ( a > a > a ) > a,A: ( a > a > a ) > a] :
( ~ ( sk1
@ ( A
@ ^ [C: a,D: a] : C )
@ ( A
@ ^ [C: a,D: a] : D )
@ ( B
@ ^ [C: a,D: a] : C )
@ ( B
@ ^ [C: a,D: a] : D ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [B: ( a > a > a ) > a,A: ( a > a > a ) > a] :
( ( A = B )
| ~ ( sk1
@ ( A
@ ^ [C: a,D: a] : C )
@ ( A
@ ^ [C: a,D: a] : D )
@ ( B
@ ^ [C: a,D: a] : C )
@ ( B
@ ^ [C: a,D: a] : D ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(10,plain,
! [B: ( a > a > a ) > a,A: ( a > a > a ) > a] :
( ( A = B )
| ( ( sk1 @ sk2 @ sk3 @ sk4 @ sk5 )
!= ( sk1
@ ( A
@ ^ [C: a,D: a] : C )
@ ( A
@ ^ [C: a,D: a] : D )
@ ( B
@ ^ [C: a,D: a] : C )
@ ( B
@ ^ [C: a,D: a] : D ) ) ) ),
inference(paramod_ordered,[status(thm)],[5,8]) ).
thf(11,plain,
( ( ^ [A: a > a > a] : ( A @ sk4 @ sk5 ) )
= ( ^ [A: a > a > a] : ( A @ sk2 @ sk3 ) ) ),
inference(pre_uni,[status(thm)],[10:[bind(A,$thf( ^ [C: a > a > a] : ( C @ sk2 @ sk3 ) )),bind(B,$thf( ^ [C: a > a > a] : ( C @ sk4 @ sk5 ) ))]]) ).
thf(18,plain,
! [A: a > a > a] :
( ( A @ sk4 @ sk5 )
= ( A @ sk2 @ sk3 ) ),
inference(func_ext,[status(esa)],[11]) ).
thf(4,plain,
( ( sk2 != sk4 )
| ( sk3 != sk5 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
( ( sk4 != sk2 )
| ( sk5 != sk3 ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(664,plain,
! [A: a > a > a] :
( ( sk4 != sk2 )
| ( ( A @ sk2 @ sk3 )
!= sk3 )
| ( ( A @ sk4 @ sk5 )
!= sk5 ) ),
inference(paramod_ordered,[status(thm)],[18,7]) ).
thf(710,plain,
( ( sk4 != sk2 )
| ( sk3 != sk3 ) ),
inference(pre_uni,[status(thm)],[664:[bind(A,$thf( ^ [B: a] : ^ [C: a] : C ))]]) ).
thf(792,plain,
sk4 != sk2,
inference(simp,[status(thm)],[710]) ).
thf(882,plain,
! [A: a > a > a] :
( ( ( A @ sk2 @ sk3 )
!= sk2 )
| ( ( A @ sk4 @ sk5 )
!= sk4 ) ),
inference(paramod_ordered,[status(thm)],[18,792]) ).
thf(918,plain,
sk2 != sk2,
inference(pre_uni,[status(thm)],[882:[bind(A,$thf( ^ [B: a] : ^ [C: a] : B ))]]) ).
thf(919,plain,
$false,
inference(pattern_uni,[status(thm)],[918:[]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV167^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 19:26:40 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.86/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.95 % [INFO] Parsing done (97ms).
% 1.19/0.96 % [INFO] Running in sequential loop mode.
% 1.47/1.15 % [INFO] eprover registered as external prover.
% 1.47/1.16 % [INFO] Scanning for conjecture ...
% 1.70/1.21 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.81/1.23 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.81/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.84/1.24 % [INFO] Type checking passed.
% 1.84/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 ...
% 7.75/2.54 % [INFO] Killing All external provers ...
% 7.75/2.55 % Time passed: 2018ms (effective reasoning time: 1578ms)
% 7.75/2.55 % 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)>
% 7.75/2.55 % Axioms used in derivation (0):
% 7.75/2.55 % No. of inferences in proof: 17
% 7.75/2.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2018 ms resp. 1578 ms w/o parsing
% 7.75/2.57 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.75/2.57 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------