TSTP Solution File: SET752^4 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SET752^4 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 : Tue May 21 03:06:54 EDT 2024
% Result : Theorem 13.16s 3.24s
% Output : Refutation 13.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 12
% Syntax : Number of formulae : 109 ( 13 unt; 9 typ; 2 def)
% Number of atoms : 363 ( 136 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 730 ( 142 ~; 201 |; 19 &; 368 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 74 ( 12 ^ 43 !; 19 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(union_type,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(union_def,definition,
( union
= ( ^ [A: $i > $o,B: $i > $o,C: $i] :
( ( A @ C )
| ( B @ C ) ) ) ) ).
thf(fun_image_type,type,
fun_image: ( $i > $i ) > ( $i > $o ) > $i > $o ).
thf(fun_image_def,definition,
( fun_image
= ( ^ [A: $i > $i,B: $i > $o,C: $i] :
? [D: $i] :
( ( B @ D )
& ( C
= ( A @ D ) ) ) ) ) ).
thf(sk1_type,type,
sk1: $i > $o ).
thf(sk2_type,type,
sk2: $i > $o ).
thf(sk3_type,type,
sk3: $i > $i ).
thf(sk4_type,type,
sk4: $i ).
thf(sk5_type,type,
sk5: $i ).
thf(sk6_type,type,
sk6: $i ).
thf(sk7_type,type,
sk7: $i ).
thf(1,conjecture,
! [A: $i > $o,B: $i > $o,C: $i > $i] :
( ( fun_image @ C @ ( union @ A @ B ) )
= ( union @ ( fun_image @ C @ A ) @ ( fun_image @ C @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
~ ! [A: $i > $o,B: $i > $o,C: $i > $i] :
( ( fun_image @ C @ ( union @ A @ B ) )
= ( union @ ( fun_image @ C @ A ) @ ( fun_image @ C @ B ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $o,B: $i > $o,C: $i > $i] :
( ( ^ [D: $i] :
? [E: $i] :
( ( ( A @ E )
| ( B @ E ) )
& ( D
= ( C @ E ) ) ) )
= ( ^ [D: $i] :
( ? [E: $i] :
( ( A @ E )
& ( D
= ( C @ E ) ) )
| ? [E: $i] :
( ( B @ E )
& ( D
= ( C @ E ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: $i] :
? [B: $i] :
( ( ( sk1 @ B )
| ( sk2 @ B ) )
& ( A
= ( sk3 @ B ) ) ) )
!= ( ^ [A: $i] :
( ? [B: $i] :
( ( sk1 @ B )
& ( A
= ( sk3 @ B ) ) )
| ? [B: $i] :
( ( sk2 @ B )
& ( A
= ( sk3 @ B ) ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: $i] :
? [B: $i] :
( ( ( sk1 @ B )
| ( sk2 @ B ) )
& ( A
= ( sk3 @ B ) ) ) )
!= ( ^ [A: $i] :
( ? [B: $i] :
( ( sk1 @ B )
& ( A
= ( sk3 @ B ) ) )
| ? [B: $i] :
( ( sk2 @ B )
& ( A
= ( sk3 @ B ) ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
( ( ? [A: $i] :
( ( ( sk1 @ A )
| ( sk2 @ A ) )
& ( sk4
= ( sk3 @ A ) ) ) )
!= ( ? [A: $i] :
( ( sk1 @ A )
& ( sk4
= ( sk3 @ A ) ) )
| ? [A: $i] :
( ( sk2 @ A )
& ( sk4
= ( sk3 @ A ) ) ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(8,plain,
( ? [A: $i] :
( ( ( sk1 @ A )
| ( sk2 @ A ) )
& ( sk4
= ( sk3 @ A ) ) )
| ? [A: $i] :
( ( sk1 @ A )
& ( sk4
= ( sk3 @ A ) ) )
| ? [A: $i] :
( ( sk2 @ A )
& ( sk4
= ( sk3 @ A ) ) ) ),
inference(bool_ext,[status(thm)],[6]) ).
thf(22,plain,
( ( sk4
= ( sk3 @ sk6 ) )
| ( sk4
= ( sk3 @ sk7 ) )
| ( sk4
= ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(29,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( ( sk3 @ sk7 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 ) ),
inference(lifteq,[status(thm)],[22]) ).
thf(25,plain,
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ( sk4
= ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(31,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 )
| ( sk2 @ sk7 ) ),
inference(lifteq,[status(thm)],[25]) ).
thf(7,plain,
( ~ ? [A: $i] :
( ( ( sk1 @ A )
| ( sk2 @ A ) )
& ( sk4
= ( sk3 @ A ) ) )
| ~ ( ? [A: $i] :
( ( sk1 @ A )
& ( sk4
= ( sk3 @ A ) ) )
| ? [A: $i] :
( ( sk2 @ A )
& ( sk4
= ( sk3 @ A ) ) ) ) ),
inference(bool_ext,[status(thm)],[6]) ).
thf(12,plain,
! [B: $i,A: $i] :
( ~ ( sk1 @ B )
| ( sk4
!= ( sk3 @ B ) )
| ~ ( sk1 @ A )
| ( sk4
!= ( sk3 @ A ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ( ( sk3 @ A )
!= sk4 )
| ~ ( sk1 @ B )
| ~ ( sk1 @ A ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(339,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ~ ( sk1 @ B )
| ~ ( sk1 @ A )
| ( ( sk3 @ A )
!= ( sk3 @ B ) )
| ( sk4 != sk4 ) ),
inference(eqfactor_ordered,[status(thm)],[18]) ).
thf(340,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ~ ( sk1 @ A )
| ~ ( sk1 @ A ) ),
inference(pattern_uni,[status(thm)],[339:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(346,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ~ ( sk1 @ A ) ),
inference(simp,[status(thm)],[340]) ).
thf(364,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ~ ( sk1 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[31,346]) ).
thf(365,plain,
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[364:[bind(A,$thf( sk5 ))]]) ).
thf(19,plain,
( ( sk1 @ sk6 )
| ( sk4
= ( sk3 @ sk7 ) )
| ( sk4
= ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(30,plain,
( ( ( sk3 @ sk7 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(9,plain,
! [B: $i,A: $i] :
( ~ ( sk2 @ B )
| ( sk4
!= ( sk3 @ B ) )
| ~ ( sk2 @ A )
| ( sk4
!= ( sk3 @ A ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(13,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ( ( sk3 @ A )
!= sk4 )
| ~ ( sk2 @ B )
| ~ ( sk2 @ A ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ( ( sk3 @ A )
!= sk4 )
| ~ ( sk2 @ B )
| ~ ( sk2 @ A ) ),
inference(simp,[status(thm)],[13]) ).
thf(47,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ~ ( sk2 @ B )
| ~ ( sk2 @ A )
| ( ( sk3 @ A )
!= ( sk3 @ B ) )
| ( sk4 != sk4 ) ),
inference(eqfactor_ordered,[status(thm)],[14]) ).
thf(48,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ~ ( sk2 @ A )
| ~ ( sk2 @ A ) ),
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(49,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ~ ( sk2 @ A ) ),
inference(simp,[status(thm)],[48]) ).
thf(185,plain,
! [A: $i] :
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk7 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[30,49]) ).
thf(186,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 ) ),
inference(pattern_uni,[status(thm)],[185:[bind(A,$thf( sk7 ))]]) ).
thf(354,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 )
| ~ ( sk1 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[186,346]) ).
thf(355,plain,
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[354:[bind(A,$thf( sk5 ))]]) ).
thf(531,plain,
( ( sk1 @ sk6 )
| ~ ( sk1 @ sk5 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[365,355]) ).
thf(532,plain,
( ( sk1 @ sk6 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[531:[]]) ).
thf(556,plain,
! [A: $i] :
( ~ ( sk1 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[532,346]) ).
thf(557,plain,
( ~ ( sk1 @ sk5 )
| ( ( sk3 @ sk6 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[556:[bind(A,$thf( sk6 ))]]) ).
thf(23,plain,
( ( sk4
= ( sk3 @ sk6 ) )
| ( sk4
= ( sk3 @ sk7 ) )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(33,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( ( sk3 @ sk7 )
= sk4 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(lifteq,[status(thm)],[23]) ).
thf(26,plain,
( ( sk4
= ( sk3 @ sk6 ) )
| ( sk2 @ sk7 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(32,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( sk2 @ sk7 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(lifteq,[status(thm)],[26]) ).
thf(24,plain,
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(20,plain,
( ( sk1 @ sk6 )
| ( sk4
= ( sk3 @ sk7 ) )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(27,plain,
( ( ( sk3 @ sk7 )
= sk4 )
| ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(lifteq,[status(thm)],[20]) ).
thf(261,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk7 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[27,49]) ).
thf(262,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ~ ( sk2 @ sk7 ) ),
inference(pattern_uni,[status(thm)],[261:[bind(A,$thf( sk7 ))]]) ).
thf(1236,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[24,262]) ).
thf(1237,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1236:[]]) ).
thf(54,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[31,49]) ).
thf(55,plain,
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[54:[bind(A,$thf( sk5 ))]]) ).
thf(207,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[186,49]) ).
thf(208,plain,
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[207:[bind(A,$thf( sk5 ))]]) ).
thf(241,plain,
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk5 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[55,208]) ).
thf(242,plain,
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[241:[]]) ).
thf(1256,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( ( sk2 @ sk5 )
!= ( sk2 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[1237,242]) ).
thf(1257,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1256:[]]) ).
thf(1265,plain,
! [A: $i] :
( ( sk1 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1257,346]) ).
thf(1266,plain,
( ( sk1 @ sk5 )
| ( ( sk3 @ sk6 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[1265:[bind(A,$thf( sk6 ))]]) ).
thf(1351,plain,
( ( sk2 @ sk7 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk3 @ sk6 )
!= ( sk3 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[32,1266]) ).
thf(1352,plain,
( ( sk2 @ sk7 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1351:[]]) ).
thf(1425,plain,
! [A: $i] :
( ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1352,49]) ).
thf(1426,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[1425:[bind(A,$thf( sk7 ))]]) ).
thf(1661,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk3 @ sk7 )
!= ( sk3 @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[33,1426]) ).
thf(1662,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1661:[]]) ).
thf(1685,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk3 @ sk6 )
!= ( sk3 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[1662,1266]) ).
thf(1686,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1685:[]]) ).
thf(21,plain,
( ( sk4
= ( sk3 @ sk6 ) )
| ( sk2 @ sk7 )
| ( sk4
= ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(28,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 )
| ( sk2 @ sk7 ) ),
inference(lifteq,[status(thm)],[21]) ).
thf(358,plain,
! [A: $i] :
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk2 @ sk7 )
| ~ ( sk1 @ A )
| ( ( sk3 @ sk6 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[28,346]) ).
thf(359,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk2 @ sk7 )
| ~ ( sk1 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[358:[bind(A,$thf( sk6 ))]]) ).
thf(761,plain,
! [A: $i] :
( ( sk2 @ sk7 )
| ~ ( sk1 @ sk6 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[359,49]) ).
thf(762,plain,
( ( sk2 @ sk7 )
| ~ ( sk1 @ sk6 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[761:[bind(A,$thf( sk5 ))]]) ).
thf(806,plain,
! [A: $i] :
( ~ ( sk1 @ sk6 )
| ~ ( sk2 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[762,49]) ).
thf(807,plain,
( ~ ( sk1 @ sk6 )
| ~ ( sk2 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[806:[bind(A,$thf( sk7 ))]]) ).
thf(1274,plain,
( ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[1257,807]) ).
thf(1275,plain,
( ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[1274:[]]) ).
thf(1720,plain,
( ( sk1 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 )
| ( ( sk2 @ sk5 )
!= ( sk2 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[1686,1275]) ).
thf(1721,plain,
( ( sk1 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[1720:[]]) ).
thf(1771,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk5 )
| ( ( sk3 @ sk7 )
!= ( sk3 @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[29,1721]) ).
thf(1772,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1771:[]]) ).
thf(1809,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk5 )
| ( ( sk3 @ sk6 )
!= ( sk3 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[1772,1266]) ).
thf(1810,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1809:[]]) ).
thf(1723,plain,
! [A: $i] :
( ( sk1 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk2 @ sk5 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1686,49]) ).
thf(1724,plain,
( ( sk1 @ sk5 )
| ( ( sk3 @ sk5 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[1723:[bind(A,$thf( sk5 ))]]) ).
thf(1863,plain,
( ( sk1 @ sk5 )
| ( ( sk3 @ sk5 )
!= ( sk3 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[1810,1724]) ).
thf(1864,plain,
sk1 @ sk5,
inference(pattern_uni,[status(thm)],[1863:[]]) ).
thf(1908,plain,
( ~ $true
| ( ( sk3 @ sk6 )
!= sk4 ) ),
inference(rewrite,[status(thm)],[557,1864]) ).
thf(1909,plain,
( ( sk3 @ sk6 )
!= sk4 ),
inference(simp,[status(thm)],[1908]) ).
thf(1940,plain,
( ( ( sk3 @ sk7 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 ) ),
inference(simplifyReflect,[status(thm)],[29,1909]) ).
thf(764,plain,
! [A: $i] :
( ( sk2 @ sk7 )
| ~ ( sk1 @ sk6 )
| ~ ( sk1 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[359,346]) ).
thf(765,plain,
( ( sk2 @ sk7 )
| ~ ( sk1 @ sk6 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[764:[bind(A,$thf( sk5 ))]]) ).
thf(869,plain,
( ~ ( sk1 @ sk5 )
| ( sk2 @ sk7 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[532,765]) ).
thf(870,plain,
( ~ ( sk1 @ sk5 )
| ( sk2 @ sk7 ) ),
inference(pattern_uni,[status(thm)],[869:[]]) ).
thf(886,plain,
! [A: $i] :
( ~ ( sk1 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[870,49]) ).
thf(887,plain,
( ~ ( sk1 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[886:[bind(A,$thf( sk7 ))]]) ).
thf(1910,plain,
( ~ $true
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(rewrite,[status(thm)],[887,1864]) ).
thf(1911,plain,
( ( sk3 @ sk7 )
!= sk4 ),
inference(simp,[status(thm)],[1910]) ).
thf(1917,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ( ( sk1 @ sk5 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1864,346]) ).
thf(1918,plain,
( ( sk3 @ sk5 )
!= sk4 ),
inference(pattern_uni,[status(thm)],[1917:[bind(A,$thf( sk5 ))]]) ).
thf(1948,plain,
$false,
inference(simplifyReflect,[status(thm)],[1940,1911,1918]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET752^4 : TPTP v8.2.0. Released v3.6.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.16/0.35 % Computer : n024.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.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 20 13:05:54 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.96/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.35/0.99 % [INFO] Parsing done (144ms).
% 1.35/1.00 % [INFO] Running in sequential loop mode.
% 1.67/1.21 % [INFO] nitpick registered as external prover.
% 1.67/1.21 % [INFO] Scanning for conjecture ...
% 1.98/1.29 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.98/1.31 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.98/1.31 % [INFO] Problem is higher-order (TPTP THF).
% 1.98/1.32 % [INFO] Type checking passed.
% 1.98/1.32 % [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 ...
% 13.16/3.24 % [INFO] Killing All external provers ...
% 13.16/3.24 % Time passed: 2724ms (effective reasoning time: 2234ms)
% 13.16/3.24 % 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)>
% 13.16/3.24 % Axioms used in derivation (0):
% 13.16/3.24 % No. of inferences in proof: 98
% 13.16/3.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2724 ms resp. 2234 ms w/o parsing
% 13.40/3.36 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 13.40/3.37 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------