TSTP Solution File: LCL658+1.001 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL658+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n012.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:31:01 EDT 2023
% Result : Theorem 24.14s 4.61s
% Output : Refutation 24.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 89 ( 20 unt; 14 typ; 0 def)
% Number of atoms : 517 ( 49 equ; 0 cnn)
% Maximal formula atoms : 62 ( 6 avg)
% Number of connectives : 1531 ( 398 ~; 383 |; 15 &; 735 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 212 ( 0 ^; 208 !; 4 ?; 212 :)
% Comments :
%------------------------------------------------------------------------------
thf(r1_type,type,
r1: $i > $i > $o ).
thf(p1_type,type,
p1: $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i > $o ).
thf(sk3_type,type,
sk3: $i > $i > $i ).
thf(sk5_type,type,
sk5: $i > $i ).
thf(sk6_type,type,
sk6: $i > $i ).
thf(sk8_type,type,
sk8: $i > $o ).
thf(sk10_type,type,
sk10: $i > $i ).
thf(sk14_type,type,
sk14: $i ).
thf(sk15_type,type,
sk15: $i ).
thf(sk16_type,type,
sk16: $i ).
thf(sk17_type,type,
sk17: $i > $i ).
thf(sk18_type,type,
sk18: $i > $i ).
thf(3,axiom,
! [A: $i] : ( r1 @ A @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
thf(55,plain,
! [A: $i] : ( r1 @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(56,plain,
! [A: $i] : ( r1 @ A @ A ),
inference(cnf,[status(esa)],[55]) ).
thf(1,conjecture,
~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ~ ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) )
| ~ ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) )
| ~ ( ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) )
& ( ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) ) )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ) )
| ~ ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
thf(2,negated_conjecture,
~ ~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ~ ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) )
| ~ ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) )
| ~ ( ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) )
& ( ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) ) )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ) )
| ~ ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ~ ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) )
| ~ ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) )
| ~ ( ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) )
& ( ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) ) )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ~ ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) )
| ~ ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) )
| ~ ( ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) )
& ( ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) ) )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(6,plain,
~ ! [A: $i] :
( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ~ ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) )
| ~ ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) )
| ~ ( ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) )
& ( ( p1 @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) ) )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p1 @ F ) )
| ~ ( p1 @ E ) ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p1 @ E ) )
| ~ ( p1 @ D ) ) ) ) ),
inference(miniscope,[status(thm)],[5]) ).
thf(29,plain,
~ ( p1 @ sk15 ),
inference(cnf,[status(esa)],[6]) ).
thf(7,plain,
r1 @ sk14 @ sk15,
inference(cnf,[status(esa)],[6]) ).
thf(35,plain,
! [A: $i] :
( ~ ( r1 @ sk14 @ A )
| ( p1 @ A )
| ( p1 @ ( sk17 @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(41,plain,
! [A: $i] :
( ~ ( r1 @ sk14 @ A )
| ( p1 @ A )
| ( p1 @ ( sk17 @ A ) ) ),
inference(simp,[status(thm)],[35]) ).
thf(169,plain,
! [A: $i] :
( ( p1 @ A )
| ( p1 @ ( sk17 @ A ) )
| ( ( r1 @ sk14 @ sk15 )
!= ( r1 @ sk14 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[7,41]) ).
thf(170,plain,
( ( p1 @ sk15 )
| ( p1 @ ( sk17 @ sk15 ) ) ),
inference(pattern_uni,[status(thm)],[169:[bind(A,$thf( sk15 ))]]) ).
thf(251,plain,
( $false
| ( p1 @ ( sk17 @ sk15 ) ) ),
inference(rewrite,[status(thm)],[170,29]) ).
thf(252,plain,
p1 @ ( sk17 @ sk15 ),
inference(simp,[status(thm)],[251]) ).
thf(21,plain,
! [A: $i] :
( ~ ( r1 @ sk14 @ A )
| ( p1 @ A )
| ~ ( p1 @ ( sk18 @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(47,plain,
! [A: $i] :
( ~ ( r1 @ sk14 @ A )
| ( p1 @ A )
| ~ ( p1 @ ( sk18 @ A ) ) ),
inference(simp,[status(thm)],[21]) ).
thf(282,plain,
! [B: $i,A: $i] :
( ( p1 @ B )
| ~ ( p1 @ ( sk18 @ B ) )
| ( ( r1 @ A @ A )
!= ( r1 @ sk14 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[56,47]) ).
thf(283,plain,
( ( p1 @ sk14 )
| ~ ( p1 @ ( sk18 @ sk14 ) ) ),
inference(pattern_uni,[status(thm)],[282:[bind(A,$thf( sk14 )),bind(B,$thf( sk14 ))]]) ).
thf(344,plain,
( ( p1 @ sk14 )
| ( ( p1 @ ( sk18 @ sk14 ) )
!= ( p1 @ ( sk17 @ sk15 ) ) ) ),
inference(paramod_ordered,[status(thm)],[252,283]) ).
thf(348,plain,
( ( p1 @ sk14 )
| ( ( sk18 @ sk14 )
!= ( sk17 @ sk15 ) ) ),
inference(simp,[status(thm)],[344]) ).
thf(34,plain,
r1 @ sk1 @ sk14,
inference(cnf,[status(esa)],[6]) ).
thf(19,plain,
! [A: $i] :
( ~ ( r1 @ sk16 @ A )
| ( p1 @ A ) ),
inference(cnf,[status(esa)],[6]) ).
thf(54,plain,
! [A: $i] :
( ~ ( r1 @ sk16 @ A )
| ( p1 @ A ) ),
inference(simp,[status(thm)],[19]) ).
thf(82,plain,
! [A: $i] :
( ( p1 @ A )
| ( ( r1 @ sk16 @ A )
!= ( r1 @ sk1 @ sk14 ) ) ),
inference(paramod_ordered,[status(thm)],[34,54]) ).
thf(85,plain,
! [A: $i] :
( ( p1 @ A )
| ( sk16 != sk1 )
| ( A != sk14 ) ),
inference(simp,[status(thm)],[82]) ).
thf(88,plain,
( ( p1 @ sk14 )
| ( sk16 != sk1 ) ),
inference(simp,[status(thm)],[85]) ).
thf(30,plain,
! [B: $i,A: $i] :
( ~ ( r1 @ sk1 @ A )
| ~ ( r1 @ A @ B )
| ( p1 @ B )
| ~ ( p1 @ A )
| ~ ( sk2 @ A )
| ~ ( p1 @ ( sk6 @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(126,plain,
! [B: $i,A: $i] :
( ( sk16 != sk1 )
| ~ ( r1 @ sk1 @ A )
| ~ ( r1 @ A @ B )
| ( p1 @ B )
| ~ ( p1 @ A )
| ~ ( sk2 @ A )
| ( ( p1 @ ( sk6 @ A ) )
!= ( p1 @ sk14 ) ) ),
inference(paramod_ordered,[status(thm)],[88,30]) ).
thf(130,plain,
! [B: $i,A: $i] :
( ( p1 @ B )
| ( sk16 != sk1 )
| ~ ( r1 @ sk1 @ A )
| ~ ( r1 @ A @ B )
| ~ ( p1 @ A )
| ~ ( sk2 @ A )
| ( ( sk6 @ A )
!= sk14 ) ),
inference(simp,[status(thm)],[126]) ).
thf(8,plain,
r1 @ sk14 @ sk16,
inference(cnf,[status(esa)],[6]) ).
thf(164,plain,
! [B: $i,A: $i] :
( ( p1 @ B )
| ( p1 @ ( sk17 @ B ) )
| ( ( r1 @ A @ A )
!= ( r1 @ sk14 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[56,41]) ).
thf(165,plain,
( ( p1 @ sk14 )
| ( p1 @ ( sk17 @ sk14 ) ) ),
inference(pattern_uni,[status(thm)],[164:[bind(A,$thf( sk14 )),bind(B,$thf( sk14 ))]]) ).
thf(343,plain,
( ( p1 @ sk14 )
| ( ( p1 @ ( sk18 @ sk14 ) )
!= ( p1 @ ( sk17 @ sk14 ) ) ) ),
inference(paramod_ordered,[status(thm)],[165,283]) ).
thf(347,plain,
( ( p1 @ sk14 )
| ( ( sk18 @ sk14 )
!= ( sk17 @ sk14 ) ) ),
inference(simp,[status(thm)],[343]) ).
thf(292,plain,
! [A: $i] :
( ( p1 @ A )
| ~ ( p1 @ ( sk18 @ A ) )
| ( ( r1 @ sk14 @ sk15 )
!= ( r1 @ sk14 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[7,47]) ).
thf(293,plain,
( ( p1 @ sk15 )
| ~ ( p1 @ ( sk18 @ sk15 ) ) ),
inference(pattern_uni,[status(thm)],[292:[bind(A,$thf( sk15 ))]]) ).
thf(351,plain,
( $false
| ~ ( p1 @ ( sk18 @ sk15 ) ) ),
inference(rewrite,[status(thm)],[293,29]) ).
thf(352,plain,
~ ( p1 @ ( sk18 @ sk15 ) ),
inference(simp,[status(thm)],[351]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ~ ( r1 @ sk1 @ A )
| ~ ( r1 @ A @ B )
| ( p1 @ B )
| ~ ( p1 @ A )
| ~ ( sk2 @ A )
| ( r1 @ A @ ( sk5 @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(181,plain,
( ( p1 @ sk14 )
| ( ( p1 @ ( sk17 @ sk14 ) )
!= ( p1 @ sk14 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[165]) ).
thf(184,plain,
( ( p1 @ sk14 )
| ( ( sk17 @ sk14 )
!= sk14 ) ),
inference(simp,[status(thm)],[181]) ).
thf(353,plain,
( ( p1 @ sk14 )
| ( ( p1 @ ( sk18 @ sk15 ) )
!= ( p1 @ ( sk17 @ sk14 ) ) ) ),
inference(paramod_ordered,[status(thm)],[165,352]) ).
thf(357,plain,
( ( p1 @ sk14 )
| ( ( sk18 @ sk15 )
!= ( sk17 @ sk14 ) ) ),
inference(simp,[status(thm)],[353]) ).
thf(16,plain,
! [A: $i] :
( ~ ( r1 @ sk1 @ A )
| ( p1 @ A )
| ~ ( sk8 @ A )
| ( r1 @ A @ ( sk10 @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(301,plain,
! [B: $i,A: $i] :
( ( p1 @ B )
| ~ ( sk8 @ B )
| ( r1 @ B @ ( sk10 @ B ) )
| ( ( r1 @ A @ A )
!= ( r1 @ sk1 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[56,16]) ).
thf(302,plain,
( ( p1 @ sk1 )
| ~ ( sk8 @ sk1 )
| ( r1 @ sk1 @ ( sk10 @ sk1 ) ) ),
inference(pattern_uni,[status(thm)],[301:[bind(A,$thf( sk1 )),bind(B,$thf( sk1 ))]]) ).
thf(80,plain,
! [B: $i,A: $i] :
( ( p1 @ B )
| ( ( r1 @ A @ A )
!= ( r1 @ sk16 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[56,54]) ).
thf(81,plain,
p1 @ sk16,
inference(pattern_uni,[status(thm)],[80:[bind(A,$thf( sk16 )),bind(B,$thf( sk16 ))]]) ).
thf(345,plain,
( ( p1 @ sk14 )
| ( ( p1 @ ( sk18 @ sk14 ) )
!= ( p1 @ sk16 ) ) ),
inference(paramod_ordered,[status(thm)],[81,283]) ).
thf(349,plain,
( ( p1 @ sk14 )
| ( ( sk18 @ sk14 )
!= sk16 ) ),
inference(simp,[status(thm)],[345]) ).
thf(123,plain,
( ( sk16 != sk1 )
| ( ( p1 @ sk15 )
!= ( p1 @ sk14 ) ) ),
inference(paramod_ordered,[status(thm)],[88,29]) ).
thf(129,plain,
( ( sk16 != sk1 )
| ( sk15 != sk14 ) ),
inference(simp,[status(thm)],[123]) ).
thf(83,plain,
! [A: $i] :
( ( p1 @ A )
| ( ( r1 @ sk16 @ A )
!= ( r1 @ sk14 @ sk15 ) ) ),
inference(paramod_ordered,[status(thm)],[7,54]) ).
thf(86,plain,
! [A: $i] :
( ( p1 @ A )
| ( sk16 != sk14 )
| ( A != sk15 ) ),
inference(simp,[status(thm)],[83]) ).
thf(89,plain,
( ( p1 @ sk15 )
| ( sk16 != sk14 ) ),
inference(simp,[status(thm)],[86]) ).
thf(133,plain,
( $false
| ( sk16 != sk14 ) ),
inference(rewrite,[status(thm)],[89,29]) ).
thf(134,plain,
sk16 != sk14,
inference(simp,[status(thm)],[133]) ).
thf(356,plain,
( ( p1 @ ( sk18 @ sk15 ) )
!= ( p1 @ sk16 ) ),
inference(paramod_ordered,[status(thm)],[81,352]) ).
thf(360,plain,
( ( sk18 @ sk15 )
!= sk16 ),
inference(simp,[status(thm)],[356]) ).
thf(255,plain,
( ( p1 @ ( sk17 @ sk15 ) )
!= ( p1 @ sk15 ) ),
inference(paramod_ordered,[status(thm)],[252,29]) ).
thf(264,plain,
( ( sk17 @ sk15 )
!= sk15 ),
inference(simp,[status(thm)],[255]) ).
thf(12,plain,
! [B: $i,A: $i] :
( ~ ( r1 @ sk1 @ A )
| ~ ( r1 @ A @ B )
| ( p1 @ B )
| ~ ( p1 @ A )
| ~ ( sk2 @ A )
| ( p1 @ ( sk5 @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(18,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( r1 @ sk1 @ A )
| ~ ( r1 @ A @ B )
| ( p1 @ B )
| ~ ( p1 @ A )
| ~ ( r1 @ A @ C )
| ( r1 @ C @ ( sk3 @ C @ A ) )
| ( sk2 @ A ) ),
inference(cnf,[status(esa)],[6]) ).
thf(91,plain,
( ( p1 @ sk16 )
!= ( p1 @ sk15 ) ),
inference(paramod_ordered,[status(thm)],[81,29]) ).
thf(95,plain,
sk16 != sk15,
inference(simp,[status(thm)],[91]) ).
thf(173,plain,
( ( p1 @ sk14 )
| ( ( p1 @ ( sk17 @ sk14 ) )
!= ( p1 @ sk15 ) ) ),
inference(paramod_ordered,[status(thm)],[165,29]) ).
thf(182,plain,
( ( p1 @ sk14 )
| ( ( sk17 @ sk14 )
!= sk15 ) ),
inference(simp,[status(thm)],[173]) ).
thf(355,plain,
( ( sk16 != sk1 )
| ( ( p1 @ ( sk18 @ sk15 ) )
!= ( p1 @ sk14 ) ) ),
inference(paramod_ordered,[status(thm)],[88,352]) ).
thf(359,plain,
( ( sk16 != sk1 )
| ( ( sk18 @ sk15 )
!= sk14 ) ),
inference(simp,[status(thm)],[355]) ).
thf(183,plain,
( ( p1 @ sk14 )
| ( ( p1 @ ( sk17 @ sk14 ) )
!= ( p1 @ sk14 ) ) ),
inference(simp,[status(thm)],[181]) ).
thf(354,plain,
( ( p1 @ ( sk18 @ sk15 ) )
!= ( p1 @ ( sk17 @ sk15 ) ) ),
inference(paramod_ordered,[status(thm)],[252,352]) ).
thf(358,plain,
( ( sk18 @ sk15 )
!= ( sk17 @ sk15 ) ),
inference(simp,[status(thm)],[354]) ).
thf(5151,plain,
$false,
inference(e,[status(thm)],[56,29,348,252,130,55,8,47,347,88,352,14,184,357,302,349,165,129,41,134,360,34,264,12,54,81,7,18,95,182,16,359,30,183,4,358,283]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL658+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 18 15:39:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.85/0.82 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.26/0.94 % [INFO] Parsing done (116ms).
% 1.26/0.94 % [INFO] Running in sequential loop mode.
% 1.56/1.14 % [INFO] eprover registered as external prover.
% 1.56/1.14 % [INFO] cvc4 registered as external prover.
% 1.56/1.15 % [INFO] Scanning for conjecture ...
% 1.78/1.22 % [INFO] Found a conjecture and 1 axioms. Running axiom selection ...
% 2.03/1.25 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 2.03/1.25 % [INFO] Problem is first-order (TPTP FOF).
% 2.03/1.26 % [INFO] Type checking passed.
% 2.03/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 ...
% 24.14/4.60 % External prover 'e' found a proof!
% 24.14/4.60 % [INFO] Killing All external provers ...
% 24.14/4.60 % Time passed: 4102ms (effective reasoning time: 3657ms)
% 24.14/4.60 % 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)>
% 24.14/4.61 % Axioms used in derivation (1): reflexivity
% 24.14/4.61 % No. of inferences in proof: 75
% 24.14/4.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4102 ms resp. 3657 ms w/o parsing
% 24.14/4.65 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 24.14/4.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------