TSTP Solution File: SEV046^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV046^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% 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 : Mon Jun 24 15:59:23 EDT 2024
% Result : Theorem 28.86s 5.96s
% Output : Refutation 29.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 1
% Syntax : Number of formulae : 84 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 261 ( 34 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 971 ( 111 ~; 115 |; 24 &; 679 @)
% ( 0 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 192 ( 0 ^ 192 !; 0 ?; 192 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(b_type,type,
b: $tType ).
thf(sk1_type,type,
sk1: a > a > $o ).
thf(sk2_type,type,
sk2: a > b > b > $o ).
thf(sk3_type,type,
sk3: $o ).
thf(sk4_type,type,
sk4: a > b ).
thf(sk5_type,type,
sk5: a > b ).
thf(sk6_type,type,
sk6: a ).
thf(sk7_type,type,
sk7: a ).
thf(sk8_type,type,
sk8: a > b ).
thf(sk9_type,type,
sk9: a > b ).
thf(sk10_type,type,
sk10: a > b ).
thf(sk11_type,type,
sk11: a ).
thf(sk12_type,type,
sk12: a ).
thf(1,conjecture,
! [A: a > a > $o,B: a > b > b > $o] :
( ( ! [C: a,D: a] :
( ( A @ C @ D )
=> ( A @ D @ C ) )
& ! [C: a,D: a,E: a] :
( ( ( A @ C @ D )
& ( A @ D @ E ) )
=> ( A @ C @ E ) )
& ! [C: a] :
( ( A @ C @ C )
=> ( ! [D: b,E: b] :
( ( B @ C @ D @ E )
=> ( B @ C @ E @ D ) )
& ! [D: b,E: b,F: b] :
( ( ( B @ C @ D @ E )
& ( B @ C @ E @ F ) )
=> ( B @ C @ D @ F ) ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
=> ( ( B @ C )
= ( B @ D ) ) ) )
=> ( ! [C: a > b,D: a > b] :
( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( D @ F ) ) )
=> ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( D @ E ) @ ( C @ F ) ) ) )
& ! [C: a > b,D: a > b,E: a > b] :
( ( ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( C @ F ) @ ( D @ G ) ) )
& ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( D @ F ) @ ( E @ G ) ) ) )
=> ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( C @ F ) @ ( E @ G ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM507_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a > $o,B: a > b > b > $o] :
( ( ! [C: a,D: a] :
( ( A @ C @ D )
=> ( A @ D @ C ) )
& ! [C: a,D: a,E: a] :
( ( ( A @ C @ D )
& ( A @ D @ E ) )
=> ( A @ C @ E ) )
& ! [C: a] :
( ( A @ C @ C )
=> ( ! [D: b,E: b] :
( ( B @ C @ D @ E )
=> ( B @ C @ E @ D ) )
& ! [D: b,E: b,F: b] :
( ( ( B @ C @ D @ E )
& ( B @ C @ E @ F ) )
=> ( B @ C @ D @ F ) ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
=> ( ( B @ C )
= ( B @ D ) ) ) )
=> ( ! [C: a > b,D: a > b] :
( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( D @ F ) ) )
=> ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( D @ E ) @ ( C @ F ) ) ) )
& ! [C: a > b,D: a > b,E: a > b] :
( ( ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( C @ F ) @ ( D @ G ) ) )
& ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( D @ F ) @ ( E @ G ) ) ) )
=> ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( C @ F ) @ ( E @ G ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a > $o,B: a > b > b > $o] :
( ( ! [C: a,D: a] :
( ( A @ C @ D )
=> ( A @ D @ C ) )
& ! [C: a,D: a,E: a] :
( ( ( A @ C @ D )
& ( A @ D @ E ) )
=> ( A @ C @ E ) )
& ! [C: a] :
( ( A @ C @ C )
=> ( ! [D: b,E: b] :
( ( B @ C @ D @ E )
=> ( B @ C @ E @ D ) )
& ! [D: b,E: b,F: b] :
( ( ( B @ C @ D @ E )
& ( B @ C @ E @ F ) )
=> ( B @ C @ D @ F ) ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
=> ( ( B @ C )
= ( B @ D ) ) ) )
=> ( ! [C: a > b,D: a > b] :
( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( D @ F ) ) )
=> ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( D @ E ) @ ( C @ F ) ) ) )
& ! [C: a > b,D: a > b,E: a > b] :
( ( ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( C @ F ) @ ( D @ G ) ) )
& ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( D @ F ) @ ( E @ G ) ) ) )
=> ! [F: a,G: a] :
( ( A @ F @ G )
=> ( B @ F @ ( C @ F ) @ ( E @ G ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,plain,
( sk3
| ( sk1 @ sk11 @ sk12 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
! [B: a,A: a] :
( sk3
| ~ ( sk1 @ A @ B )
| ( sk2 @ A @ ( sk8 @ A ) @ ( sk9 @ B ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(22,plain,
! [B: a,A: a] :
( sk3
| ~ ( sk1 @ A @ B )
| ( sk2 @ A @ ( sk8 @ A ) @ ( sk9 @ B ) ) ),
inference(simp,[status(thm)],[4]) ).
thf(842,plain,
! [B: a,A: a] :
( sk3
| ( sk2 @ A @ ( sk8 @ A ) @ ( sk9 @ B ) )
| ( ( sk1 @ sk11 @ sk12 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[9,22]) ).
thf(843,plain,
( sk3
| ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ ( sk9 @ sk12 ) ) ),
inference(pattern_uni,[status(thm)],[842:[bind(A,$thf( sk11 )),bind(B,$thf( sk12 ))]]) ).
thf(12,plain,
( ( sk1 @ sk6 @ sk7 )
| ~ sk3 ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk1 @ B @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(95,plain,
! [B: a,A: a] :
( ~ sk3
| ( sk1 @ B @ A )
| ( ( sk1 @ sk6 @ sk7 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[12,13]) ).
thf(96,plain,
( ~ sk3
| ( sk1 @ sk7 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[95:[bind(A,$thf( sk6 )),bind(B,$thf( sk7 ))]]) ).
thf(6,plain,
! [C: a,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ~ ( sk1 @ B @ C )
| ( sk1 @ A @ C ) ),
inference(cnf,[status(esa)],[3]) ).
thf(18,plain,
! [C: a,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ~ ( sk1 @ B @ C )
| ( sk1 @ A @ C ) ),
inference(simp,[status(thm)],[6]) ).
thf(327,plain,
! [C: a,B: a,A: a] :
( ~ sk3
| ~ ( sk1 @ A @ B )
| ( sk1 @ A @ C )
| ( ( sk1 @ sk7 @ sk6 )
!= ( sk1 @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[96,18]) ).
thf(328,plain,
! [A: a] :
( ~ sk3
| ~ ( sk1 @ A @ sk7 )
| ( sk1 @ A @ sk6 ) ),
inference(pattern_uni,[status(thm)],[327:[bind(A,$thf( A )),bind(B,$thf( sk7 )),bind(C,$thf( sk6 ))]]) ).
thf(1219,plain,
! [A: a] :
( ~ sk3
| ( sk1 @ A @ sk6 )
| ( ( sk1 @ sk6 @ sk7 )
!= ( sk1 @ A @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[12,328]) ).
thf(1220,plain,
( ~ sk3
| ( sk1 @ sk6 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[1219:[bind(A,$thf( sk6 ))]]) ).
thf(7,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk2 @ A @ ( sk4 @ A ) @ ( sk5 @ B ) )
| ~ sk3 ),
inference(cnf,[status(esa)],[3]) ).
thf(19,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk2 @ A @ ( sk4 @ A ) @ ( sk5 @ B ) )
| ~ sk3 ),
inference(simp,[status(thm)],[7]) ).
thf(639,plain,
! [B: a,A: a] :
( ~ sk3
| ( sk2 @ A @ ( sk4 @ A ) @ ( sk5 @ B ) )
| ( ( sk1 @ sk7 @ sk6 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[96,19]) ).
thf(640,plain,
( ~ sk3
| ( sk2 @ sk7 @ ( sk4 @ sk7 ) @ ( sk5 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[639:[bind(A,$thf( sk7 )),bind(B,$thf( sk6 ))]]) ).
thf(8,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( ( sk2 @ A )
= ( sk2 @ B ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(20,plain,
! [B: a,A: a] :
( ( ( sk2 @ A )
= ( sk2 @ B ) )
| ~ ( sk1 @ A @ B ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(21,plain,
! [B: a,A: a] :
( ( ( sk2 @ A )
= ( sk2 @ B ) )
| ~ ( sk1 @ A @ B ) ),
inference(simp,[status(thm)],[20]) ).
thf(132,plain,
! [B: a,A: a] :
( ~ sk3
| ( ( sk2 @ A )
= ( sk2 @ B ) )
| ( ( sk1 @ sk7 @ sk6 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[96,21]) ).
thf(133,plain,
( ~ sk3
| ( ( sk2 @ sk7 )
= ( sk2 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[132:[bind(A,$thf( sk7 )),bind(B,$thf( sk6 ))]]) ).
thf(172,plain,
! [B: b,A: b] :
( ( ( sk2 @ sk7 @ A @ B )
= ( sk2 @ sk6 @ A @ B ) )
| ~ sk3 ),
inference(func_ext,[status(esa)],[133]) ).
thf(704,plain,
! [B: b,A: b] :
( ~ sk3
| ( sk2 @ sk6 @ A @ B )
| ( ( sk2 @ sk7 @ ( sk4 @ sk7 ) @ ( sk5 @ sk6 ) )
!= ( sk2 @ sk7 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[640,172]) ).
thf(705,plain,
( ~ sk3
| ( sk2 @ sk6 @ ( sk4 @ sk7 ) @ ( sk5 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[704:[bind(A,$thf( sk4 @ sk7 )),bind(B,$thf( sk5 @ sk6 ))]]) ).
thf(10,plain,
! [C: b,B: b,A: a] :
( ~ ( sk1 @ A @ A )
| ~ ( sk2 @ A @ B @ C )
| ( sk2 @ A @ C @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(16,plain,
! [C: b,B: b,A: a] :
( ~ ( sk1 @ A @ A )
| ~ ( sk2 @ A @ B @ C )
| ( sk2 @ A @ C @ B ) ),
inference(simp,[status(thm)],[10]) ).
thf(5,plain,
( ~ ( sk2 @ sk6 @ ( sk5 @ sk6 ) @ ( sk4 @ sk7 ) )
| ~ sk3 ),
inference(cnf,[status(esa)],[3]) ).
thf(187,plain,
! [C: b,B: b,A: a] :
( ~ ( sk1 @ A @ A )
| ~ ( sk2 @ A @ B @ C )
| ~ sk3
| ( ( sk2 @ A @ C @ B )
!= ( sk2 @ sk6 @ ( sk5 @ sk6 ) @ ( sk4 @ sk7 ) ) ) ),
inference(paramod_ordered,[status(thm)],[16,5]) ).
thf(188,plain,
( ~ ( sk1 @ sk6 @ sk6 )
| ~ ( sk2 @ sk6 @ ( sk4 @ sk7 ) @ ( sk5 @ sk6 ) )
| ~ sk3 ),
inference(pattern_uni,[status(thm)],[187:[bind(A,$thf( sk6 )),bind(B,$thf( sk4 @ sk7 )),bind(C,$thf( sk5 @ sk6 ))]]) ).
thf(796,plain,
( ~ sk3
| ~ ( sk1 @ sk6 @ sk6 )
| ( ( sk2 @ sk6 @ ( sk4 @ sk7 ) @ ( sk5 @ sk6 ) )
!= ( sk2 @ sk6 @ ( sk4 @ sk7 ) @ ( sk5 @ sk6 ) ) ) ),
inference(paramod_ordered,[status(thm)],[705,188]) ).
thf(797,plain,
( ~ sk3
| ~ ( sk1 @ sk6 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[796:[]]) ).
thf(1226,plain,
( ~ sk3
| ( ( sk1 @ sk6 @ sk6 )
!= ( sk1 @ sk6 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[1220,797]) ).
thf(1227,plain,
~ sk3,
inference(pattern_uni,[status(thm)],[1226:[]]) ).
thf(1282,plain,
( $false
| ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ ( sk9 @ sk12 ) ) ),
inference(rewrite,[status(thm)],[843,1227]) ).
thf(1283,plain,
sk2 @ sk11 @ ( sk8 @ sk11 ) @ ( sk9 @ sk12 ),
inference(simp,[status(thm)],[1282]) ).
thf(15,plain,
! [D: b,C: b,B: b,A: a] :
( ~ ( sk1 @ A @ A )
| ~ ( sk2 @ A @ B @ C )
| ~ ( sk2 @ A @ C @ D )
| ( sk2 @ A @ B @ D ) ),
inference(cnf,[status(esa)],[3]) ).
thf(23,plain,
! [D: b,C: b,B: b,A: a] :
( ~ ( sk1 @ A @ A )
| ~ ( sk2 @ A @ B @ C )
| ~ ( sk2 @ A @ C @ D )
| ( sk2 @ A @ B @ D ) ),
inference(simp,[status(thm)],[15]) ).
thf(11,plain,
( sk3
| ~ ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ ( sk10 @ sk12 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(28,plain,
! [D: b,C: b,B: b,A: a] :
( ~ ( sk1 @ A @ A )
| ~ ( sk2 @ A @ B @ C )
| ~ ( sk2 @ A @ C @ D )
| sk3
| ( ( sk2 @ A @ B @ D )
!= ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ ( sk10 @ sk12 ) ) ) ),
inference(paramod_ordered,[status(thm)],[23,11]) ).
thf(29,plain,
! [A: b] :
( ~ ( sk1 @ sk11 @ sk11 )
| ~ ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ A )
| ~ ( sk2 @ sk11 @ A @ ( sk10 @ sk12 ) )
| sk3 ),
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( sk11 )),bind(B,$thf( sk8 @ sk11 )),bind(C,$thf( C )),bind(D,$thf( sk10 @ sk12 ))]]) ).
thf(43,plain,
! [A: b] :
( ~ ( sk1 @ sk11 @ sk11 )
| ~ ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ A )
| ~ ( sk2 @ sk11 @ A @ ( sk10 @ sk12 ) )
| sk3 ),
inference(simp,[status(thm)],[29]) ).
thf(1585,plain,
! [A: b] :
( ~ ( sk1 @ sk11 @ sk11 )
| ~ ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ A )
| ~ ( sk2 @ sk11 @ A @ ( sk10 @ sk12 ) )
| $false ),
inference(rewrite,[status(thm)],[43,1227]) ).
thf(1586,plain,
! [A: b] :
( ~ ( sk1 @ sk11 @ sk11 )
| ~ ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ A )
| ~ ( sk2 @ sk11 @ A @ ( sk10 @ sk12 ) ) ),
inference(simp,[status(thm)],[1585]) ).
thf(1589,plain,
! [A: b] :
( ~ ( sk1 @ sk11 @ sk11 )
| ~ ( sk2 @ sk11 @ A @ ( sk10 @ sk12 ) )
| ( ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ ( sk9 @ sk12 ) )
!= ( sk2 @ sk11 @ ( sk8 @ sk11 ) @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1283,1586]) ).
thf(1590,plain,
( ~ ( sk1 @ sk11 @ sk11 )
| ~ ( sk2 @ sk11 @ ( sk9 @ sk12 ) @ ( sk10 @ sk12 ) ) ),
inference(pattern_uni,[status(thm)],[1589:[bind(A,$thf( sk9 @ sk12 ))]]) ).
thf(88,plain,
! [B: a,A: a] :
( sk3
| ( sk1 @ B @ A )
| ( ( sk1 @ sk11 @ sk12 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[9,13]) ).
thf(89,plain,
( sk3
| ( sk1 @ sk12 @ sk11 ) ),
inference(pattern_uni,[status(thm)],[88:[bind(A,$thf( sk11 )),bind(B,$thf( sk12 ))]]) ).
thf(1274,plain,
( $false
| ( sk1 @ sk12 @ sk11 ) ),
inference(rewrite,[status(thm)],[89,1227]) ).
thf(1275,plain,
sk1 @ sk12 @ sk11,
inference(simp,[status(thm)],[1274]) ).
thf(1264,plain,
( $false
| ( sk1 @ sk11 @ sk12 ) ),
inference(rewrite,[status(thm)],[9,1227]) ).
thf(1265,plain,
sk1 @ sk11 @ sk12,
inference(simp,[status(thm)],[1264]) ).
thf(1296,plain,
! [C: a,B: a,A: a] :
( ~ ( sk1 @ B @ C )
| ( sk1 @ A @ C )
| ( ( sk1 @ sk11 @ sk12 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[1265,18]) ).
thf(1297,plain,
! [A: a] :
( ~ ( sk1 @ sk12 @ A )
| ( sk1 @ sk11 @ A ) ),
inference(pattern_uni,[status(thm)],[1296:[bind(A,$thf( sk11 )),bind(B,$thf( sk12 ))]]) ).
thf(1312,plain,
! [A: a] :
( ~ ( sk1 @ sk12 @ A )
| ( sk1 @ sk11 @ A ) ),
inference(simp,[status(thm)],[1297]) ).
thf(2256,plain,
! [A: a] :
( ( sk1 @ sk11 @ A )
| ( ( sk1 @ sk12 @ sk11 )
!= ( sk1 @ sk12 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1275,1312]) ).
thf(2257,plain,
sk1 @ sk11 @ sk11,
inference(pattern_uni,[status(thm)],[2256:[bind(A,$thf( sk11 ))]]) ).
thf(2276,plain,
( ~ $true
| ~ ( sk2 @ sk11 @ ( sk9 @ sk12 ) @ ( sk10 @ sk12 ) ) ),
inference(rewrite,[status(thm)],[1590,2257]) ).
thf(2277,plain,
~ ( sk2 @ sk11 @ ( sk9 @ sk12 ) @ ( sk10 @ sk12 ) ),
inference(simp,[status(thm)],[2276]) ).
thf(1298,plain,
! [C: a,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk1 @ A @ C )
| ( ( sk1 @ sk11 @ sk12 )
!= ( sk1 @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[1265,18]) ).
thf(1299,plain,
! [A: a] :
( ~ ( sk1 @ A @ sk11 )
| ( sk1 @ A @ sk12 ) ),
inference(pattern_uni,[status(thm)],[1298:[bind(A,$thf( A )),bind(B,$thf( sk11 )),bind(C,$thf( sk12 ))]]) ).
thf(2149,plain,
! [A: a] :
( ( sk1 @ A @ sk12 )
| ( ( sk1 @ sk12 @ sk11 )
!= ( sk1 @ A @ sk11 ) ) ),
inference(paramod_ordered,[status(thm)],[1275,1299]) ).
thf(2150,plain,
sk1 @ sk12 @ sk12,
inference(pattern_uni,[status(thm)],[2149:[bind(A,$thf( sk12 ))]]) ).
thf(14,plain,
! [B: a,A: a] :
( sk3
| ~ ( sk1 @ A @ B )
| ( sk2 @ A @ ( sk9 @ A ) @ ( sk10 @ B ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(17,plain,
! [B: a,A: a] :
( sk3
| ~ ( sk1 @ A @ B )
| ( sk2 @ A @ ( sk9 @ A ) @ ( sk10 @ B ) ) ),
inference(simp,[status(thm)],[14]) ).
thf(92,plain,
! [D: a,C: a,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| sk3
| ( sk2 @ C @ ( sk9 @ C ) @ ( sk10 @ D ) )
| ( ( sk1 @ B @ A )
!= ( sk1 @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[13,17]) ).
thf(93,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| sk3
| ( sk2 @ B @ ( sk9 @ B ) @ ( sk10 @ A ) ) ),
inference(pattern_uni,[status(thm)],[92:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( B )),bind(D,$thf( A ))]]) ).
thf(3529,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| $false
| ( sk2 @ B @ ( sk9 @ B ) @ ( sk10 @ A ) ) ),
inference(rewrite,[status(thm)],[93,1227]) ).
thf(3530,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk2 @ B @ ( sk9 @ B ) @ ( sk10 @ A ) ) ),
inference(simp,[status(thm)],[3529]) ).
thf(3558,plain,
! [B: a,A: a] :
( ( sk2 @ B @ ( sk9 @ B ) @ ( sk10 @ A ) )
| ( ( sk1 @ sk12 @ sk12 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[2150,3530]) ).
thf(3559,plain,
sk2 @ sk12 @ ( sk9 @ sk12 ) @ ( sk10 @ sk12 ),
inference(pattern_uni,[status(thm)],[3558:[bind(A,$thf( sk12 )),bind(B,$thf( sk12 ))]]) ).
thf(128,plain,
! [B: a,A: a] :
( sk3
| ( ( sk2 @ A )
= ( sk2 @ B ) )
| ( ( sk1 @ sk12 @ sk11 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[89,21]) ).
thf(129,plain,
( sk3
| ( ( sk2 @ sk12 )
= ( sk2 @ sk11 ) ) ),
inference(pattern_uni,[status(thm)],[128:[bind(A,$thf( sk12 )),bind(B,$thf( sk11 ))]]) ).
thf(160,plain,
! [B: b,A: b] :
( ( ( sk2 @ sk12 @ A @ B )
= ( sk2 @ sk11 @ A @ B ) )
| sk3 ),
inference(func_ext,[status(esa)],[129]) ).
thf(1276,plain,
! [B: b,A: b] :
( ( ( sk2 @ sk12 @ A @ B )
= ( sk2 @ sk11 @ A @ B ) )
| $false ),
inference(rewrite,[status(thm)],[160,1227]) ).
thf(1277,plain,
! [B: b,A: b] :
( ( sk2 @ sk12 @ A @ B )
= ( sk2 @ sk11 @ A @ B ) ),
inference(simp,[status(thm)],[1276]) ).
thf(3621,plain,
sk2 @ sk11 @ ( sk9 @ sk12 ) @ ( sk10 @ sk12 ),
inference(rewrite,[status(thm)],[3559,1277]) ).
thf(3622,plain,
~ $true,
inference(rewrite,[status(thm)],[2277,3621]) ).
thf(3623,plain,
$false,
inference(simp,[status(thm)],[3622]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SEV046^5 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.12 % Command : run_Leo-III %s %d SAT
% 0.10/0.32 % Computer : n024.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri Jun 21 19:24:55 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.85/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/1.02 % [INFO] Parsing done (172ms).
% 1.19/1.03 % [INFO] Running in sequential loop mode.
% 1.73/1.36 % [INFO] nitpick registered as external prover.
% 1.79/1.37 % [INFO] Scanning for conjecture ...
% 2.05/1.49 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.16/1.53 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.16/1.54 % [INFO] Problem is higher-order (TPTP THF).
% 2.16/1.54 % [INFO] Type checking passed.
% 2.16/1.55 % [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 ...
% 28.32/5.93 % [INFO] Killing All external provers ...
% 28.86/5.94 % Time passed: 5466ms (effective reasoning time: 4900ms)
% 28.86/5.94 % 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)>
% 28.86/5.94 % Axioms used in derivation (0):
% 28.86/5.96 % No. of inferences in proof: 84
% 28.86/5.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 5466 ms resp. 4900 ms w/o parsing
% 29.11/6.10 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 29.11/6.10 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------