TSTP Solution File: SEV386^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV386^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n026.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:53 EDT 2024
% Result : Theorem 21.19s 4.90s
% Output : Refutation 21.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 49
% Number of leaves : 1
% Syntax : Number of formulae : 109 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 436 ( 230 equ; 39 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 578 ( 137 ~; 165 |; 11 &; 254 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 8 con; 0-2 aty)
% Number of variables : 56 ( 2 ^ 44 !; 10 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(p_type,type,
p: a > $o ).
thf(sk2_type,type,
sk2: a ).
thf(sk3_type,type,
sk3: a > a ).
thf(sk4_type,type,
sk4: a ).
thf(sk5_type,type,
sk5: a ).
thf(sk21_type,type,
sk21: a ).
thf(sk33_type,type,
sk33: a ).
thf(1,conjecture,
( ( ? [A: a] :
( p
= ( (=) @ a @ A ) ) )
= ( ? [A: a] :
( ( p @ A )
& ! [B: a] :
( ( p @ B )
=> ( A = B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTTTP5306A_pme) ).
thf(2,negated_conjecture,
( ( ? [A: a] :
( p
= ( (=) @ a @ A ) ) )
!= ( ? [A: a] :
( ( p @ A )
& ! [B: a] :
( ( p @ B )
=> ( A = B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [A: a] :
( p
= ( (=) @ a @ A ) ) )
!= ( ? [A: a] :
( ( p @ A )
& ! [B: a] :
( ( p @ B )
=> ( A = B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ? [A: a] :
( ( p @ A )
& ! [B: a] :
( ( p @ B )
=> ( A = B ) ) ) )
!= ( ? [A: a] :
( p
= ( (=) @ a @ A ) ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( ^ [A: a] :
( ( p @ A )
& ! [B: a] :
( ( p @ B )
=> ( A = B ) ) ) )
!= ( ^ [A: a] :
( p
= ( (=) @ a @ A ) ) ) ),
inference(simp,[status(thm)],[4]) ).
thf(16,plain,
( ( ( p @ sk4 )
& ! [A: a] :
( ( p @ A )
=> ( sk4 = A ) ) )
!= ( p
= ( (=) @ a @ sk4 ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(18,plain,
( ( ( p @ sk4 )
& ! [A: a] :
( ( p @ A )
=> ( sk4 = A ) ) )
| ( p
= ( (=) @ a @ sk4 ) ) ),
inference(bool_ext,[status(thm)],[16]) ).
thf(20,plain,
( ( p
= ( (=) @ a @ sk4 ) )
| ( ( p @ sk4 )
& ! [A: a] :
( ( p @ A )
=> ( sk4 = A ) ) ) ),
inference(lifteq,[status(thm)],[18]) ).
thf(25,plain,
( ( p @ sk4 )
| ( p
= ( (=) @ a @ sk4 ) ) ),
inference(cnf,[status(esa)],[20]) ).
thf(7,plain,
( ? [A: a] :
( ( p @ A )
& ! [B: a] :
( ( p @ B )
=> ( A = B ) ) )
| ? [A: a] :
( p
= ( (=) @ a @ A ) ) ),
inference(bool_ext,[status(thm)],[4]) ).
thf(13,plain,
! [A: a] :
( ( p
= ( (=) @ a @ ( sk3 @ A ) ) )
| ( p @ sk2 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(15,plain,
! [A: a] :
( ( p
= ( (=) @ a @ ( sk3 @ A ) ) )
| ( p @ sk2 ) ),
inference(lifteq,[status(thm)],[13]) ).
thf(39,plain,
! [B: a,A: a] :
( ( ( p @ B )
= ( ( sk3 @ A )
= B ) )
| ( p @ sk2 ) ),
inference(func_ext,[status(esa)],[15]) ).
thf(208,plain,
! [B: a,A: a] :
( ( p
= ( (=) @ a @ sk4 ) )
| ( ( sk3 @ A )
= B )
| ( p @ sk2 )
| ( ( p @ sk4 )
!= ( p @ B ) ) ),
inference(paramod_ordered,[status(thm)],[25,39]) ).
thf(209,plain,
! [A: a] :
( ( p
= ( (=) @ a @ sk4 ) )
| ( ( sk3 @ A )
= sk4 )
| ( p @ sk2 ) ),
inference(pattern_uni,[status(thm)],[208:[bind(A,$thf( A )),bind(B,$thf( sk4 ))]]) ).
thf(244,plain,
! [A: a] :
( ( ( sk3 @ A )
= sk4 )
| ( p
= ( (=) @ a @ sk4 ) )
| ( p @ sk2 ) ),
inference(lifteq,[status(thm)],[209]) ).
thf(353,plain,
! [B: a,A: a] :
( ( p
= ( (=) @ a @ sk4 ) )
| ( p @ sk2 )
| ( ( sk3 @ A )
!= ( sk3 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[244,15]) ).
thf(354,plain,
( ( p
= ( (=) @ a @ sk4 ) )
| ( p @ sk2 ) ),
inference(pattern_uni,[status(thm)],[353:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(378,plain,
! [A: a] :
( ( ( p @ A )
= ( sk4 = A ) )
| ( p @ sk2 ) ),
inference(func_ext,[status(esa)],[354]) ).
thf(17,plain,
( ~ ( ( p @ sk4 )
& ! [A: a] :
( ( p @ A )
=> ( sk4 = A ) ) )
| ( p
!= ( (=) @ a @ sk4 ) ) ),
inference(bool_ext,[status(thm)],[16]) ).
thf(19,plain,
( ( p
!= ( (=) @ a @ sk4 ) )
| ~ ( ( p @ sk4 )
& ! [A: a] :
( ( p @ A )
=> ( sk4 = A ) ) ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(21,plain,
( ~ ( p @ sk4 )
| ( p @ sk5 )
| ( p
!= ( (=) @ a @ sk4 ) ) ),
inference(cnf,[status(esa)],[19]) ).
thf(401,plain,
( ( p @ sk2 )
| ~ ( p @ sk4 )
| ( p @ sk5 )
| ( p != p ) ),
inference(paramod_ordered,[status(thm)],[354,21]) ).
thf(402,plain,
( ( p @ sk2 )
| ~ ( p @ sk4 )
| ( p @ sk5 ) ),
inference(pattern_uni,[status(thm)],[401:[]]) ).
thf(1085,plain,
! [A: a] :
( ( p @ sk2 )
| ( sk4 != A )
| ( p @ sk5 )
| ( ( p @ A )
!= ( p @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[378,402]) ).
thf(1086,plain,
( ( p @ sk2 )
| ( sk4 != sk4 )
| ( p @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1085:[bind(A,$thf( sk4 ))]]) ).
thf(1138,plain,
( ( sk4 != sk4 )
| ( p @ sk2 )
| ( p @ sk5 ) ),
inference(lifteq,[status(thm)],[1086]) ).
thf(1178,plain,
( ( p @ sk2 )
| ( p @ sk5 ) ),
inference(simp,[status(thm)],[1138]) ).
thf(1250,plain,
! [A: a] :
( ( p @ sk2 )
| ( sk4 = A )
| ( ( p @ A )
!= ( p @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[378,1178]) ).
thf(1251,plain,
( ( p @ sk2 )
| ( sk4 = sk5 ) ),
inference(pattern_uni,[status(thm)],[1250:[bind(A,$thf( sk5 ))]]) ).
thf(1268,plain,
( ( sk5 = sk4 )
| ( p @ sk2 ) ),
inference(lifteq,[status(thm)],[1251]) ).
thf(22,plain,
( ~ ( p @ sk4 )
| ( sk4 != sk5 )
| ( p
!= ( (=) @ a @ sk4 ) ) ),
inference(cnf,[status(esa)],[19]) ).
thf(23,plain,
( ( sk5 != sk4 )
| ~ ( p @ sk4 )
| ( p
!= ( (=) @ a @ sk4 ) ) ),
inference(lifteq,[status(thm)],[22]) ).
thf(415,plain,
( ( p @ sk2 )
| ( sk5 != sk4 )
| ~ ( p @ sk4 )
| ( p != p ) ),
inference(paramod_ordered,[status(thm)],[354,23]) ).
thf(416,plain,
( ( p @ sk2 )
| ( sk5 != sk4 )
| ~ ( p @ sk4 ) ),
inference(pattern_uni,[status(thm)],[415:[]]) ).
thf(1039,plain,
! [A: a] :
( ( p @ sk2 )
| ( sk5 != sk4 )
| ( sk4 != A )
| ( ( p @ A )
!= ( p @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[378,416]) ).
thf(1040,plain,
( ( p @ sk2 )
| ( sk5 != sk4 )
| ( sk4 != sk4 ) ),
inference(pattern_uni,[status(thm)],[1039:[bind(A,$thf( sk4 ))]]) ).
thf(1126,plain,
( ( sk4 != sk4 )
| ( p @ sk2 )
| ( sk5 != sk4 ) ),
inference(lifteq,[status(thm)],[1040]) ).
thf(1171,plain,
( ( p @ sk2 )
| ( sk5 != sk4 ) ),
inference(simp,[status(thm)],[1126]) ).
thf(1441,plain,
( ( p @ sk2 )
| ( sk5 != sk5 ) ),
inference(paramod_ordered,[status(thm)],[1268,1171]) ).
thf(1442,plain,
p @ sk2,
inference(pattern_uni,[status(thm)],[1441:[]]) ).
thf(1483,plain,
( ( p @ sk5 )
| ( p
!= ( (=) @ a @ sk4 ) )
| ( ( p @ sk4 )
!= ( p @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[1442,21]) ).
thf(1500,plain,
( ( p @ sk5 )
| ( p
!= ( (=) @ a @ sk4 ) )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[1483]) ).
thf(24,plain,
! [A: a] :
( ~ ( p @ A )
| ( sk4 = A )
| ( p
= ( (=) @ a @ sk4 ) ) ),
inference(cnf,[status(esa)],[20]) ).
thf(26,plain,
! [A: a] :
( ( sk4 = A )
| ~ ( p @ A )
| ( p
= ( (=) @ a @ sk4 ) ) ),
inference(lifteq,[status(thm)],[24]) ).
thf(410,plain,
! [A: a] :
( ( p
= ( (=) @ a @ sk4 ) )
| ( sk4 = A )
| ( ( p @ sk2 )
!= ( p @ A ) ) ),
inference(paramod_ordered,[status(thm)],[354,26]) ).
thf(411,plain,
( ( p
= ( (=) @ a @ sk4 ) )
| ( sk4 = sk2 ) ),
inference(pattern_uni,[status(thm)],[410:[bind(A,$thf( sk2 ))]]) ).
thf(424,plain,
! [A: a] :
( ( ( p @ A )
= ( sk4 = A ) )
| ( sk4 = sk2 ) ),
inference(func_ext,[status(esa)],[411]) ).
thf(2253,plain,
! [A: a] :
( ( sk4 = sk2 )
| ( sk4 = A )
| ( ( p @ A )
!= ( p @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[424,1442]) ).
thf(2254,plain,
( ( sk4 = sk2 )
| ( sk4 = sk2 ) ),
inference(pattern_uni,[status(thm)],[2253:[bind(A,$thf( sk2 ))]]) ).
thf(2364,plain,
( ( sk4 = sk2 )
| ( sk4 = sk2 ) ),
inference(lifteq,[status(thm)],[2254]) ).
thf(2397,plain,
sk4 = sk2,
inference(simp,[status(thm)],[2364]) ).
thf(4247,plain,
( ( p @ sk5 )
| ( p
!= ( (=) @ a @ sk2 ) )
| ( sk2 != sk2 ) ),
inference(rewrite,[status(thm)],[1500,2397]) ).
thf(4248,plain,
( ( p @ sk5 )
| ( p
!= ( (=) @ a @ sk2 ) ) ),
inference(simp,[status(thm)],[4247]) ).
thf(4249,plain,
( ( ( p @ sk33 )
!= ( sk2 = sk33 ) )
| ( p @ sk5 ) ),
inference(func_ext,[status(esa)],[4248]) ).
thf(4311,plain,
( ( p @ sk5 )
| ( p @ sk33 )
| ( sk2 = sk33 ) ),
inference(bool_ext,[status(thm)],[4249]) ).
thf(4338,plain,
( ( sk33 = sk2 )
| ( p @ sk5 )
| ( p @ sk33 ) ),
inference(lifteq,[status(thm)],[4311]) ).
thf(92,plain,
! [A: a] :
( ( sk4 = A )
| ~ ( p @ A )
| ~ ( p @ sk4 )
| ( p @ sk5 )
| ( p != p ) ),
inference(paramod_ordered,[status(thm)],[26,21]) ).
thf(93,plain,
! [A: a] :
( ( sk4 = A )
| ~ ( p @ A )
| ~ ( p @ sk4 )
| ( p @ sk5 ) ),
inference(pattern_uni,[status(thm)],[92:[]]) ).
thf(3499,plain,
! [A: a] :
( ( sk2 = A )
| ~ ( p @ A )
| ~ ( p @ sk2 )
| ( p @ sk5 ) ),
inference(rewrite,[status(thm)],[93,2397]) ).
thf(4352,plain,
! [A: a] :
( ( sk33 = sk2 )
| ( p @ sk5 )
| ( sk2 = A )
| ~ ( p @ sk2 )
| ( ( p @ sk33 )
!= ( p @ A ) ) ),
inference(paramod_ordered,[status(thm)],[4338,3499]) ).
thf(4353,plain,
( ( sk33 = sk2 )
| ( p @ sk5 )
| ( sk33 = sk2 )
| ~ ( p @ sk2 ) ),
inference(pattern_uni,[status(thm)],[4352:[bind(A,$thf( sk33 ))]]) ).
thf(4412,plain,
( ( sk33 = sk2 )
| ( p @ sk5 )
| ~ ( p @ sk2 ) ),
inference(simp,[status(thm)],[4353]) ).
thf(5498,plain,
( ( sk33 = sk2 )
| ( p @ sk5 )
| ~ $true ),
inference(rewrite,[status(thm)],[4412,1442]) ).
thf(5499,plain,
( ( sk33 = sk2 )
| ( p @ sk5 ) ),
inference(simp,[status(thm)],[5498]) ).
thf(4310,plain,
( ( p @ sk5 )
| ~ ( p @ sk33 )
| ( sk2 != sk33 ) ),
inference(bool_ext,[status(thm)],[4249]) ).
thf(4344,plain,
( ( sk33 != sk2 )
| ( p @ sk5 )
| ~ ( p @ sk33 ) ),
inference(lifteq,[status(thm)],[4310]) ).
thf(4567,plain,
( ( sk33 != sk2 )
| ( p @ sk5 )
| ( ( p @ sk33 )
!= ( p @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[1442,4344]) ).
thf(4594,plain,
( ( p @ sk5 )
| ( sk33 != sk2 )
| ( sk33 != sk2 ) ),
inference(simp,[status(thm)],[4567]) ).
thf(4601,plain,
( ( p @ sk5 )
| ( sk33 != sk2 ) ),
inference(simp,[status(thm)],[4594]) ).
thf(5544,plain,
( ( p @ sk5 )
| ( sk33 != sk33 ) ),
inference(paramod_ordered,[status(thm)],[5499,4601]) ).
thf(5545,plain,
p @ sk5,
inference(pattern_uni,[status(thm)],[5544:[]]) ).
thf(12,plain,
! [A: a] :
( ( p
= ( (=) @ a @ ( sk3 @ A ) ) )
| ~ ( p @ A )
| ( sk2 = A ) ),
inference(cnf,[status(esa)],[7]) ).
thf(14,plain,
! [A: a] :
( ( p
= ( (=) @ a @ ( sk3 @ A ) ) )
| ( sk2 = A )
| ~ ( p @ A ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(5597,plain,
! [A: a] :
( ( p
= ( (=) @ a @ ( sk3 @ A ) ) )
| ( sk2 = A )
| ( ( p @ sk5 )
!= ( p @ A ) ) ),
inference(paramod_ordered,[status(thm)],[5545,14]) ).
thf(5598,plain,
( ( p
= ( (=) @ a @ ( sk3 @ sk5 ) ) )
| ( sk5 = sk2 ) ),
inference(pattern_uni,[status(thm)],[5597:[bind(A,$thf( sk5 ))]]) ).
thf(1222,plain,
( ( sk5 != sk4 )
| ( p
!= ( (=) @ a @ sk4 ) )
| ( ( p @ sk4 )
!= ( p @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[1171,23]) ).
thf(1229,plain,
( ( sk5 != sk4 )
| ( p
!= ( (=) @ a @ sk4 ) )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[1222]) ).
thf(2441,plain,
( ( sk5 != sk2 )
| ( p
!= ( (=) @ a @ sk2 ) )
| ( sk2 != sk2 ) ),
inference(rewrite,[status(thm)],[1229,2397]) ).
thf(2442,plain,
( ( sk5 != sk2 )
| ( p
!= ( (=) @ a @ sk2 ) ) ),
inference(simp,[status(thm)],[2441]) ).
thf(2497,plain,
( ( ( p @ sk21 )
!= ( sk2 = sk21 ) )
| ( sk5 != sk2 ) ),
inference(func_ext,[status(esa)],[2442]) ).
thf(2555,plain,
( ( sk5 != sk2 )
| ( p @ sk21 )
| ( sk2 = sk21 ) ),
inference(bool_ext,[status(thm)],[2497]) ).
thf(2565,plain,
( ( sk21 = sk2 )
| ( sk5 != sk2 )
| ( p @ sk21 ) ),
inference(lifteq,[status(thm)],[2555]) ).
thf(2554,plain,
( ( sk5 != sk2 )
| ~ ( p @ sk21 )
| ( sk2 != sk21 ) ),
inference(bool_ext,[status(thm)],[2497]) ).
thf(2568,plain,
( ( sk21 != sk2 )
| ( sk5 != sk2 )
| ~ ( p @ sk21 ) ),
inference(lifteq,[status(thm)],[2554]) ).
thf(2639,plain,
( ( sk21 != sk2 )
| ( sk5 != sk2 )
| ( ( p @ sk21 )
!= ( p @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[1442,2568]) ).
thf(2641,plain,
( ( sk21 != sk2 )
| ( sk5 != sk2 )
| ( sk21 != sk2 ) ),
inference(simp,[status(thm)],[2639]) ).
thf(2645,plain,
( ( sk21 != sk2 )
| ( sk5 != sk2 ) ),
inference(simp,[status(thm)],[2641]) ).
thf(2883,plain,
( ( sk5 != sk2 )
| ( p @ sk21 )
| ( sk21 != sk21 ) ),
inference(paramod_ordered,[status(thm)],[2565,2645]) ).
thf(2884,plain,
( ( sk5 != sk2 )
| ( p @ sk21 ) ),
inference(pattern_uni,[status(thm)],[2883:[]]) ).
thf(123,plain,
! [A: a] :
( ( sk4 = A )
| ~ ( p @ A )
| ( sk5 != sk4 )
| ~ ( p @ sk4 )
| ( p != p ) ),
inference(paramod_ordered,[status(thm)],[26,23]) ).
thf(124,plain,
! [A: a] :
( ( sk4 = A )
| ~ ( p @ A )
| ( sk5 != sk4 )
| ~ ( p @ sk4 ) ),
inference(pattern_uni,[status(thm)],[123:[]]) ).
thf(6487,plain,
! [A: a] :
( ( sk2 = A )
| ~ ( p @ A )
| ( sk5 != sk2 )
| ~ ( p @ sk2 ) ),
inference(rewrite,[status(thm)],[124,2397]) ).
thf(6712,plain,
! [A: a] :
( ~ ( p @ A )
| ( sk5 != sk2 )
| ~ ( p @ sk2 )
| ( A != sk21 ) ),
inference(paramod_ordered,[status(thm)],[6487,2645]) ).
thf(6713,plain,
( ~ ( p @ sk21 )
| ( sk5 != sk2 )
| ~ ( p @ sk2 ) ),
inference(pattern_uni,[status(thm)],[6712:[bind(A,$thf( sk21 ))]]) ).
thf(7171,plain,
( ~ ( p @ sk21 )
| ( sk5 != sk2 )
| ~ $true ),
inference(rewrite,[status(thm)],[6713,1442]) ).
thf(7172,plain,
( ~ ( p @ sk21 )
| ( sk5 != sk2 ) ),
inference(simp,[status(thm)],[7171]) ).
thf(7193,plain,
( ( sk5 != sk2 )
| ( ( p @ sk21 )
!= ( p @ sk21 ) ) ),
inference(paramod_ordered,[status(thm)],[2884,7172]) ).
thf(7194,plain,
sk5 != sk2,
inference(pattern_uni,[status(thm)],[7193:[]]) ).
thf(7234,plain,
( p
= ( (=) @ a @ ( sk3 @ sk5 ) ) ),
inference(simplifyReflect,[status(thm)],[5598,7194]) ).
thf(7433,plain,
! [A: a] :
( ( p @ A )
= ( ( sk3 @ sk5 )
= A ) ),
inference(func_ext,[status(esa)],[7234]) ).
thf(7532,plain,
! [A: a] :
( ( ( sk3 @ sk5 )
= A )
| ( ( p @ sk2 )
!= ( p @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1442,7433]) ).
thf(7533,plain,
( ( sk3 @ sk5 )
= sk2 ),
inference(pattern_uni,[status(thm)],[7532:[bind(A,$thf( sk2 ))]]) ).
thf(7618,plain,
( ( sk3 @ sk5 )
= sk2 ),
inference(lifteq,[status(thm)],[7533]) ).
thf(7578,plain,
! [A: a] :
( ( ( sk3 @ sk5 )
= A )
| ( ( p @ sk5 )
!= ( p @ A ) ) ),
inference(paramod_ordered,[status(thm)],[5545,7433]) ).
thf(7579,plain,
( ( sk3 @ sk5 )
= sk5 ),
inference(pattern_uni,[status(thm)],[7578:[bind(A,$thf( sk5 ))]]) ).
thf(7613,plain,
( ( sk3 @ sk5 )
= sk5 ),
inference(lifteq,[status(thm)],[7579]) ).
thf(7686,plain,
sk5 = sk2,
inference(rewrite,[status(thm)],[7618,7613]) ).
thf(7687,plain,
$false,
inference(simplifyReflect,[status(thm)],[7686,7194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV386^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 18:20:40 EDT 2024
% 0.13/0.34 % CPUTime :
% 1.00/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.14/0.97 % [INFO] Parsing done (97ms).
% 1.14/0.98 % [INFO] Running in sequential loop mode.
% 1.67/1.18 % [INFO] eprover registered as external prover.
% 1.67/1.18 % [INFO] Scanning for conjecture ...
% 1.80/1.23 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.80/1.25 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.80/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.80/1.26 % [INFO] Type checking passed.
% 1.80/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 ...
% 21.19/4.90 % [INFO] Killing All external provers ...
% 21.19/4.90 % Time passed: 4363ms (effective reasoning time: 3917ms)
% 21.19/4.90 % 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)>
% 21.19/4.90 % Axioms used in derivation (0):
% 21.19/4.90 % No. of inferences in proof: 109
% 21.19/4.90 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4363 ms resp. 3917 ms w/o parsing
% 21.19/4.94 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 21.19/4.94 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------