%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET707+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:30:46 AM UTC 2026
% Result : Theorem 87.81s 18.78s
% Output : Refutation 87.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 55
% Number of leaves : 10
% Syntax : Number of formulae : 137 ( 28 unt; 0 typ; 5 def)
% Number of atoms : 438 ( 200 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 1357 ( 142 ~; 167 |; 28 &; 987 @)
% ( 4 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 244 ( 2 ^; 237 !; 0 ?; 244 :)
% ( 0 !>; 0 ?*; 0 @-; 5 @+)
% Comments :
%------------------------------------------------------------------------------
thf(equal_set_decl,type,
equal_set: $i > $i > $o ).
thf(unordered_pair_decl,type,
unordered_pair: $i > $i > $i ).
thf(singleton_decl,type,
singleton: $i > $i ).
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(member_decl,type,
member: $i > $i > $o ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk3_decl,type,
sk3: $i ).
thf(sk4_decl,type,
sk4: $i ).
thf(sk5_decl,type,
sk5: $i > $i > $i ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ! [B: $i,C: $i,D: $i] :
( ( D @ ( C @ unordered_pair ) @ ( C @ singleton @ unordered_pair ) @ ( B @ ( A @ unordered_pair ) @ ( A @ singleton @ unordered_pair ) @ equal_set ) )
=> ( ( B = D )
& ( A = C ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ! [B: $i,C: $i] :
( ( C @ ( B @ unordered_pair ) @ ( B @ singleton @ unordered_pair ) @ ( A @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ) )
=> ( ( A = C )
& ( sk1 = B ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: $i] :
~ ! [B: $i] :
( ( B @ ( A @ unordered_pair ) @ ( A @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ) )
=> ( ( sk2 = B )
& ( sk1 = A ) ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( @+[A: $i] :
~ ( ( A @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ) )
=> ( ( sk2 = A )
& ( sk1 = sk3 ) ) ) ) ) ).
thf(sk5_def,definition,
( sk5
= ( ^ [A: $i,B: $i] :
@+[C: $i] :
~ ( ( B @ ( C @ member ) )
=> ( A @ ( C @ member ) ) ) ) ) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ unordered_pair ) @ ( C @ singleton @ unordered_pair ) @ ( B @ ( A @ unordered_pair ) @ ( A @ singleton @ unordered_pair ) @ equal_set ) )
=> ( ( B = D )
& ( A = C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI50) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ unordered_pair ) @ ( C @ singleton @ unordered_pair ) @ ( B @ ( A @ unordered_pair ) @ ( A @ singleton @ unordered_pair ) @ equal_set ) )
=> ( ( B = D )
& ( A = C ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(14,plain,
~ ! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ unordered_pair ) @ ( C @ singleton @ unordered_pair ) @ ( B @ ( A @ unordered_pair ) @ ( A @ singleton @ unordered_pair ) @ equal_set ) )
=> ( ( B = D )
& ( A = C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(15,plain,
( ( ( sk2 != sk4 )
| ( sk1 != sk3 ) )
& ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ) ) ),
inference(cnf,[status(esa)],[14]) ).
thf(16,plain,
sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ),
inference(cnfConj,[status(thm)],[15]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ equal_set ) )
<=> ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
thf(27,plain,
! [A: $i,B: $i] :
( ( ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) )
=> ( B @ ( A @ equal_set ) ) )
& ( ( B @ ( A @ equal_set ) )
=> ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(28,plain,
( ! [A: $i,B: $i] :
( ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) )
=> ( B @ ( A @ equal_set ) ) )
& ! [A: $i,B: $i] :
( ( B @ ( A @ equal_set ) )
=> ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) ) ) ),
inference(miniscope,[status(thm)],[27]) ).
thf(29,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equal_set ) )
| ~ ( C @ ( D @ subset ) )
| ~ ( D @ ( C @ subset ) ) )
& ( ( A @ ( B @ subset ) )
| ~ ( B @ ( A @ equal_set ) ) )
& ( ( B @ ( A @ subset ) )
| ~ ( B @ ( A @ equal_set ) ) ) ),
inference(cnf,[status(esa)],[28]) ).
thf(30,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ subset ) )
| ~ ( B @ ( A @ equal_set ) ) ),
inference(cnfConj,[status(thm)],[29]) ).
thf(388,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ) )
!= ( B @ ( A @ equal_set ) ) )
| ( B @ ( A @ subset ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[16,30]) ).
thf(389,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ) )
!= ( B @ ( A @ equal_set ) ) )
| ( B @ ( A @ subset ) ) ),
inference(simp,[status(thm)],[388]) ).
thf(390,plain,
sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ subset ),
inference(pattern_uni,[status(thm)],[389:[bind(A,$thf( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) )),bind(B,$thf( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) ))]]) ).
thf(11,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ member ) )
<=> ( ( A = C )
| ( A = B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair) ).
thf(73,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ( A = C )
| ( A = B ) )
=> ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
& ( ( C @ ( B @ unordered_pair ) @ ( A @ member ) )
=> ( ( A = C )
| ( A = B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(74,plain,
( ! [A: $i,B: $i,C: $i] :
( ( ( A = C )
| ( A = B ) )
=> ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
& ! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ member ) )
=> ( ( A = C )
| ( A = B ) ) ) ),
inference(miniscope,[status(thm)],[73]) ).
thf(75,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( F @ ( E @ unordered_pair ) @ ( D @ member ) )
| ( D != F ) )
& ( ( F @ ( E @ unordered_pair ) @ ( D @ member ) )
| ( D != E ) )
& ( ( A = C )
| ( A = B )
| ~ ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) ) ),
inference(cnf,[status(esa)],[74]) ).
thf(78,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ member ) )
| ( A != C ) ),
inference(cnfConj,[status(thm)],[75]) ).
thf(82,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ member ) )
| ( A != C ) ),
inference(lifteq,[status(thm)],[78]) ).
thf(83,plain,
! [B: $i,A: $i] : ( B @ ( A @ unordered_pair ) @ ( B @ member ) ),
inference(simp,[status(thm)],[82]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ subset ) )
<=> ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
thf(19,plain,
! [A: $i,B: $i] :
( ( ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) )
=> ( B @ ( A @ subset ) ) )
& ( ( B @ ( A @ subset ) )
=> ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(20,plain,
( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) )
=> ( B @ ( A @ subset ) ) )
& ! [A: $i,B: $i] :
( ( B @ ( A @ subset ) )
=> ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) ) ),
inference(miniscope,[status(thm)],[19]) ).
thf(21,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ subset ) )
| ~ ( E @ ( D @ ( E @ sk5 ) @ member ) ) )
& ( ( E @ ( D @ subset ) )
| ( D @ ( D @ ( E @ sk5 ) @ member ) ) )
& ( ( B @ ( C @ member ) )
| ~ ( A @ ( C @ member ) )
| ~ ( B @ ( A @ subset ) ) ) ),
inference(cnf,[status(esa)],[20]) ).
thf(22,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ ( C @ member ) )
| ~ ( A @ ( C @ member ) )
| ~ ( B @ ( A @ subset ) ) ),
inference(cnfConj,[status(thm)],[21]) ).
thf(123,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ unordered_pair ) @ ( B @ member ) )
!= ( C @ ( E @ member ) ) )
| ( D @ ( E @ member ) )
| ~ $true
| ~ ( D @ ( C @ subset ) ) ),
inference(paramod_ordered,[status(thm)],[83,22]) ).
thf(124,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ unordered_pair ) @ ( B @ member ) )
!= ( C @ ( E @ member ) ) )
| ( D @ ( E @ member ) )
| ~ ( D @ ( C @ subset ) ) ),
inference(simp,[status(thm)],[123]) ).
thf(125,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ member ) )
| ~ ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) ),
inference(pattern_uni,[status(thm)],[124:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( G @ ( F @ unordered_pair ) )),bind(D,$thf( D )),bind(E,$thf( G ))]]) ).
thf(130,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ member ) )
| ~ ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) ),
inference(simp,[status(thm)],[125]) ).
thf(19874,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ subset ) )
!= ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) )
| ( A @ ( C @ member ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[390,130]) ).
thf(19875,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ subset ) )
!= ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) )
| ( A @ ( C @ member ) ) ),
inference(simp,[status(thm)],[19874]) ).
thf(19876,plain,
sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ member ),
inference(pattern_uni,[status(thm)],[19875:[bind(A,$thf( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) )),bind(B,$thf( sk1 @ singleton )),bind(C,$thf( sk2 @ ( sk1 @ unordered_pair ) ))]]) ).
thf(31,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ subset ) )
| ~ ( B @ ( A @ equal_set ) ) ),
inference(cnfConj,[status(thm)],[29]) ).
thf(473,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ) )
!= ( B @ ( A @ equal_set ) ) )
| ( A @ ( B @ subset ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[16,31]) ).
thf(474,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ equal_set ) )
!= ( B @ ( A @ equal_set ) ) )
| ( A @ ( B @ subset ) ) ),
inference(simp,[status(thm)],[473]) ).
thf(475,plain,
sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ subset ),
inference(pattern_uni,[status(thm)],[474:[bind(A,$thf( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) )),bind(B,$thf( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) ))]]) ).
thf(77,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ member ) )
| ( A != B ) ),
inference(cnfConj,[status(thm)],[75]) ).
thf(80,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ member ) )
| ( A != B ) ),
inference(lifteq,[status(thm)],[77]) ).
thf(81,plain,
! [B: $i,A: $i] : ( B @ ( A @ unordered_pair ) @ ( A @ member ) ),
inference(simp,[status(thm)],[80]) ).
thf(117,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ unordered_pair ) @ ( A @ member ) )
!= ( C @ ( E @ member ) ) )
| ( D @ ( E @ member ) )
| ~ $true
| ~ ( D @ ( C @ subset ) ) ),
inference(paramod_ordered,[status(thm)],[81,22]) ).
thf(118,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ unordered_pair ) @ ( A @ member ) )
!= ( C @ ( E @ member ) ) )
| ( D @ ( E @ member ) )
| ~ ( D @ ( C @ subset ) ) ),
inference(simp,[status(thm)],[117]) ).
thf(119,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ member ) )
| ~ ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) ),
inference(pattern_uni,[status(thm)],[118:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( G @ ( F @ unordered_pair ) )),bind(D,$thf( D )),bind(E,$thf( F ))]]) ).
thf(128,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ member ) )
| ~ ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) ),
inference(simp,[status(thm)],[119]) ).
thf(18042,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ subset ) )
!= ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) )
| ( A @ ( B @ member ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[475,128]) ).
thf(18043,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ subset ) )
!= ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) )
| ( A @ ( B @ member ) ) ),
inference(simp,[status(thm)],[18042]) ).
thf(18044,plain,
sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk3 @ singleton @ member ),
inference(pattern_uni,[status(thm)],[18043:[bind(A,$thf( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) )),bind(B,$thf( sk3 @ singleton )),bind(C,$thf( sk4 @ ( sk3 @ unordered_pair ) ))]]) ).
thf(76,plain,
! [C: $i,B: $i,A: $i] :
( ( A = C )
| ( A = B )
| ~ ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) ),
inference(cnfConj,[status(thm)],[75]) ).
thf(79,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( C @ ( B @ unordered_pair ) @ ( A @ member ) )
| ( A = C )
| ( A = B ) ),
inference(lifteq,[status(thm)],[76]) ).
thf(20825,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk3 @ singleton @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ~ $true
| ( A = C )
| ( A = B ) ),
inference(paramod_ordered,[status(thm)],[18044,79]) ).
thf(20826,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk3 @ singleton @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ( A = C )
| ( A = B ) ),
inference(simp,[status(thm)],[20825]) ).
thf(20827,plain,
( ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk3 @ singleton ) )
| ( ( sk3 @ singleton )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[20826:[bind(A,$thf( sk3 @ singleton )),bind(B,$thf( sk1 @ singleton )),bind(C,$thf( sk2 @ ( sk1 @ unordered_pair ) ))]]) ).
thf(23321,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) )
!= ( B @ ( A @ unordered_pair ) ) )
| ( sk3 @ singleton @ ( A @ member ) )
| ( ( sk3 @ singleton )
= ( sk1 @ singleton ) ) ),
inference(paramod_ordered,[status(thm)],[20827,81]) ).
thf(23322,plain,
( ( sk3 @ singleton @ ( sk1 @ member ) )
| ( ( sk3 @ singleton )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[23321:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(10,axiom,
! [A: $i,B: $i] :
( ( B @ singleton @ ( A @ member ) )
<=> ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
thf(65,plain,
! [A: $i,B: $i] :
( ( ( A = B )
=> ( B @ singleton @ ( A @ member ) ) )
& ( ( B @ singleton @ ( A @ member ) )
=> ( A = B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(66,plain,
( ! [A: $i,B: $i] :
( ( A = B )
=> ( B @ singleton @ ( A @ member ) ) )
& ! [A: $i,B: $i] :
( ( B @ singleton @ ( A @ member ) )
=> ( A = B ) ) ),
inference(miniscope,[status(thm)],[65]) ).
thf(67,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ singleton @ ( C @ member ) )
| ( C != D ) )
& ( ( A = B )
| ~ ( B @ singleton @ ( A @ member ) ) ) ),
inference(cnf,[status(esa)],[66]) ).
thf(68,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( B @ singleton @ ( A @ member ) ) ),
inference(cnfConj,[status(thm)],[67]) ).
thf(70,plain,
! [B: $i,A: $i] :
( ~ ( B @ singleton @ ( A @ member ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[68]) ).
thf(24423,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ singleton @ ( sk1 @ member ) )
!= ( B @ singleton @ ( A @ member ) ) )
| ~ $true
| ( A = B )
| ( ( sk3 @ singleton )
= ( sk1 @ singleton ) ) ),
inference(paramod_ordered,[status(thm)],[23322,70]) ).
thf(24424,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ singleton @ ( sk1 @ member ) )
!= ( B @ singleton @ ( A @ member ) ) )
| ( A = B )
| ( ( sk3 @ singleton )
= ( sk1 @ singleton ) ) ),
inference(simp,[status(thm)],[24423]) ).
thf(24425,plain,
( ( sk3 = sk1 )
| ( ( sk3 @ singleton )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[24424:[bind(A,$thf( sk1 )),bind(B,$thf( sk3 ))]]) ).
thf(69,plain,
! [B: $i,A: $i] :
( ( B @ singleton @ ( A @ member ) )
| ( A != B ) ),
inference(cnfConj,[status(thm)],[67]) ).
thf(71,plain,
! [B: $i,A: $i] :
( ( B @ singleton @ ( A @ member ) )
| ( A != B ) ),
inference(lifteq,[status(thm)],[69]) ).
thf(72,plain,
! [A: $i] : ( A @ singleton @ ( A @ member ) ),
inference(simp,[status(thm)],[71]) ).
thf(24995,plain,
! [A: $i] :
( ( ( sk3 @ singleton )
!= ( A @ singleton ) )
| ( sk1 @ singleton @ ( A @ member ) )
| ( sk3 = sk1 ) ),
inference(paramod_ordered,[status(thm)],[24425,72]) ).
thf(24996,plain,
( ( sk1 @ singleton @ ( sk3 @ member ) )
| ( sk3 = sk1 ) ),
inference(pattern_uni,[status(thm)],[24995:[bind(A,$thf( sk3 ))]]) ).
thf(26260,plain,
! [B: $i,A: $i] :
( ( ( sk1 @ singleton @ ( sk3 @ member ) )
!= ( B @ singleton @ ( A @ member ) ) )
| ~ $true
| ( A = B )
| ( sk3 = sk1 ) ),
inference(paramod_ordered,[status(thm)],[24996,70]) ).
thf(26261,plain,
! [B: $i,A: $i] :
( ( ( sk1 @ singleton @ ( sk3 @ member ) )
!= ( B @ singleton @ ( A @ member ) ) )
| ( A = B )
| ( sk3 = sk1 ) ),
inference(simp,[status(thm)],[26260]) ).
thf(26262,plain,
( ( sk3 = sk1 )
| ( sk3 = sk1 ) ),
inference(pattern_uni,[status(thm)],[26261:[bind(A,$thf( sk3 )),bind(B,$thf( sk1 ))]]) ).
thf(26573,plain,
sk3 = sk1,
inference(simp,[status(thm)],[26262]) ).
thf(32224,plain,
sk4 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ member ),
inference(rewrite,[status(thm)],[19876,26573]) ).
thf(32399,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk4 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ~ $true
| ( A = C )
| ( A = B ) ),
inference(paramod_ordered,[status(thm)],[32224,79]) ).
thf(32400,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk4 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk2 @ ( sk1 @ unordered_pair ) @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ( A = C )
| ( A = B ) ),
inference(simp,[status(thm)],[32399]) ).
thf(32401,plain,
( ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk2 @ ( sk1 @ unordered_pair ) ) )
| ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[32400:[bind(A,$thf( sk2 @ ( sk1 @ unordered_pair ) )),bind(B,$thf( sk1 @ singleton )),bind(C,$thf( sk4 @ ( sk1 @ unordered_pair ) ))]]) ).
thf(19756,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ subset ) )
!= ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) )
| ( A @ ( C @ member ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[475,130]) ).
thf(19757,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk3 @ unordered_pair ) @ ( sk3 @ singleton @ unordered_pair ) @ subset ) )
!= ( A @ ( C @ ( B @ unordered_pair ) @ subset ) ) )
| ( A @ ( C @ member ) ) ),
inference(simp,[status(thm)],[19756]) ).
thf(19758,plain,
sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk3 @ unordered_pair ) @ member ),
inference(pattern_uni,[status(thm)],[19757:[bind(A,$thf( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) )),bind(B,$thf( sk3 @ singleton )),bind(C,$thf( sk4 @ ( sk3 @ unordered_pair ) ))]]) ).
thf(31500,plain,
sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk1 @ unordered_pair ) @ member ),
inference(rewrite,[status(thm)],[19758,26573]) ).
thf(31675,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk1 @ unordered_pair ) @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ~ $true
| ( A = C )
| ( A = B ) ),
inference(paramod_ordered,[status(thm)],[31500,79]) ).
thf(31676,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk1 @ singleton @ unordered_pair ) @ ( sk4 @ ( sk1 @ unordered_pair ) @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ( A = C )
| ( A = B ) ),
inference(simp,[status(thm)],[31675]) ).
thf(31677,plain,
( ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk2 @ ( sk1 @ unordered_pair ) ) )
| ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[31676:[bind(A,$thf( sk4 @ ( sk1 @ unordered_pair ) )),bind(B,$thf( sk1 @ singleton )),bind(C,$thf( sk2 @ ( sk1 @ unordered_pair ) ))]]) ).
thf(40345,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk1 @ unordered_pair ) )
!= ( B @ ( A @ unordered_pair ) ) )
| ( sk2 @ ( sk1 @ unordered_pair ) @ ( B @ member ) )
| ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(paramod_ordered,[status(thm)],[31677,83]) ).
thf(40346,plain,
( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk4 @ member ) )
| ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[40345:[bind(A,$thf( sk1 )),bind(B,$thf( sk4 ))]]) ).
thf(41738,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk4 @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ~ $true
| ( A = C )
| ( A = B )
| ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(paramod_ordered,[status(thm)],[40346,79]) ).
thf(41739,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) @ ( sk4 @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ( A = C )
| ( A = B )
| ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(simp,[status(thm)],[41738]) ).
thf(41740,plain,
( ( sk4 = sk2 )
| ( sk4 = sk1 )
| ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[41739:[bind(A,$thf( sk4 )),bind(B,$thf( sk1 )),bind(C,$thf( sk2 ))]]) ).
thf(17,plain,
( ( sk2 != sk4 )
| ( sk1 != sk3 ) ),
inference(cnfConj,[status(thm)],[15]) ).
thf(18,plain,
( ( sk4 != sk2 )
| ( sk3 != sk1 ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(4145,plain,
! [B: $i,A: $i] :
( ( A != sk3 )
| ( sk4 != sk2 )
| ( B != sk1 )
| ~ ( B @ singleton @ ( A @ member ) ) ),
inference(paramod_ordered,[status(thm)],[70,18]) ).
thf(4146,plain,
! [A: $i] :
( ( sk4 != sk2 )
| ( A != sk1 )
| ~ ( A @ singleton @ ( sk3 @ member ) ) ),
inference(pattern_uni,[status(thm)],[4145:[bind(A,$thf( sk3 ))]]) ).
thf(4599,plain,
( ( sk4 != sk2 )
| ~ ( sk1 @ singleton @ ( sk3 @ member ) ) ),
inference(simp,[status(thm)],[4146]) ).
thf(5699,plain,
! [A: $i] :
( ( ( A @ singleton @ ( A @ member ) )
!= ( sk1 @ singleton @ ( sk3 @ member ) ) )
| ( sk4 != sk2 )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[72,4599]) ).
thf(5700,plain,
! [A: $i] :
( ( ( A @ singleton @ ( A @ member ) )
!= ( sk1 @ singleton @ ( sk3 @ member ) ) )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[5699]) ).
thf(5713,plain,
! [A: $i] :
( ( ( A @ singleton )
!= ( sk1 @ singleton ) )
| ( A != sk3 )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[5700]) ).
thf(5735,plain,
( ( ( sk3 @ singleton )
!= ( sk1 @ singleton ) )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[5713]) ).
thf(26629,plain,
( ( ( sk1 @ singleton )
!= ( sk1 @ singleton ) )
| ( sk4 != sk2 ) ),
inference(rewrite,[status(thm)],[5735,26573]) ).
thf(26630,plain,
sk4 != sk2,
inference(simp,[status(thm)],[26629]) ).
thf(43124,plain,
( ( sk4 = sk1 )
| ( ( sk4 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(simplifyReflect,[status(thm)],[41740,26630]) ).
thf(43231,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk1 @ unordered_pair ) )
!= ( B @ ( A @ unordered_pair ) ) )
| ( sk1 @ singleton @ ( B @ member ) )
| ( sk4 = sk1 ) ),
inference(paramod_ordered,[status(thm)],[43124,83]) ).
thf(43232,plain,
( ( sk1 @ singleton @ ( sk4 @ member ) )
| ( sk4 = sk1 ) ),
inference(pattern_uni,[status(thm)],[43231:[bind(A,$thf( sk1 )),bind(B,$thf( sk4 ))]]) ).
thf(44438,plain,
! [B: $i,A: $i] :
( ( ( sk1 @ singleton @ ( sk4 @ member ) )
!= ( B @ singleton @ ( A @ member ) ) )
| ~ $true
| ( A = B )
| ( sk4 = sk1 ) ),
inference(paramod_ordered,[status(thm)],[43232,70]) ).
thf(44439,plain,
! [B: $i,A: $i] :
( ( ( sk1 @ singleton @ ( sk4 @ member ) )
!= ( B @ singleton @ ( A @ member ) ) )
| ( A = B )
| ( sk4 = sk1 ) ),
inference(simp,[status(thm)],[44438]) ).
thf(44440,plain,
( ( sk4 = sk1 )
| ( sk4 = sk1 ) ),
inference(pattern_uni,[status(thm)],[44439:[bind(A,$thf( sk4 )),bind(B,$thf( sk1 ))]]) ).
thf(44798,plain,
sk4 = sk1,
inference(simp,[status(thm)],[44440]) ).
thf(48385,plain,
( ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ ( sk1 @ unordered_pair ) ) )
| ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(rewrite,[status(thm)],[32401,44798]) ).
thf(48487,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) )
!= ( B @ ( A @ unordered_pair ) ) )
| ( sk1 @ ( sk1 @ unordered_pair ) @ ( B @ member ) )
| ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(paramod_ordered,[status(thm)],[48385,83]) ).
thf(48488,plain,
( ( sk1 @ ( sk1 @ unordered_pair ) @ ( sk2 @ member ) )
| ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[48487:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(49392,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk1 @ ( sk1 @ unordered_pair ) @ ( sk2 @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ~ $true
| ( A = C )
| ( A = B )
| ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(paramod_ordered,[status(thm)],[48488,79]) ).
thf(49393,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk1 @ ( sk1 @ unordered_pair ) @ ( sk2 @ member ) )
!= ( C @ ( B @ unordered_pair ) @ ( A @ member ) ) )
| ( A = C )
| ( A = B )
| ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(simp,[status(thm)],[49392]) ).
thf(49394,plain,
( ( sk2 = sk1 )
| ( sk2 = sk1 )
| ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(pattern_uni,[status(thm)],[49393:[bind(A,$thf( sk2 )),bind(B,$thf( sk1 )),bind(C,$thf( sk1 ))]]) ).
thf(49656,plain,
( ( sk2 = sk1 )
| ( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ) ),
inference(simp,[status(thm)],[49394]) ).
thf(24560,plain,
! [A: $i] :
( ( ( sk3 @ singleton )
!= ( A @ singleton ) )
| ( sk1 @ singleton @ ( A @ member ) )
| ( sk3 @ singleton @ ( sk1 @ member ) ) ),
inference(paramod_ordered,[status(thm)],[23322,72]) ).
thf(24561,plain,
( ( sk1 @ singleton @ ( sk3 @ member ) )
| ( sk3 @ singleton @ ( sk1 @ member ) ) ),
inference(pattern_uni,[status(thm)],[24560:[bind(A,$thf( sk3 ))]]) ).
thf(27649,plain,
( ( sk1 @ singleton @ ( sk1 @ member ) )
| ( sk1 @ singleton @ ( sk1 @ member ) ) ),
inference(rewrite,[status(thm)],[24561,26573]) ).
thf(27650,plain,
sk1 @ singleton @ ( sk1 @ member ),
inference(simp,[status(thm)],[27649]) ).
thf(4151,plain,
! [B: $i,A: $i] :
( ( B != sk4 )
| ( A != sk2 )
| ( sk3 != sk1 )
| ~ ( B @ singleton @ ( A @ member ) ) ),
inference(paramod_ordered,[status(thm)],[70,18]) ).
thf(4152,plain,
! [A: $i] :
( ( A != sk2 )
| ( sk3 != sk1 )
| ~ ( sk4 @ singleton @ ( A @ member ) ) ),
inference(pattern_uni,[status(thm)],[4151:[bind(A,$thf( A )),bind(B,$thf( sk4 ))]]) ).
thf(4602,plain,
( ( sk3 != sk1 )
| ~ ( sk4 @ singleton @ ( sk2 @ member ) ) ),
inference(simp,[status(thm)],[4152]) ).
thf(26647,plain,
( ( sk1 != sk1 )
| ~ ( sk4 @ singleton @ ( sk2 @ member ) ) ),
inference(rewrite,[status(thm)],[4602,26573]) ).
thf(26648,plain,
~ ( sk4 @ singleton @ ( sk2 @ member ) ),
inference(simp,[status(thm)],[26647]) ).
thf(27665,plain,
( ( ( sk4 @ singleton @ ( sk2 @ member ) )
!= ( sk1 @ singleton @ ( sk1 @ member ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[27650,26648]) ).
thf(27666,plain,
( ( sk4 @ singleton @ ( sk2 @ member ) )
!= ( sk1 @ singleton @ ( sk1 @ member ) ) ),
inference(simp,[status(thm)],[27665]) ).
thf(27853,plain,
( ( ( sk4 @ singleton )
!= ( sk1 @ singleton ) )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[27666]) ).
thf(44836,plain,
( ( ( sk1 @ singleton )
!= ( sk1 @ singleton ) )
| ( sk2 != sk1 ) ),
inference(rewrite,[status(thm)],[27853,44798]) ).
thf(44837,plain,
sk2 != sk1,
inference(simp,[status(thm)],[44836]) ).
thf(50069,plain,
( ( sk2 @ ( sk1 @ unordered_pair ) )
= ( sk1 @ singleton ) ),
inference(simplifyReflect,[status(thm)],[49656,44837]) ).
thf(50166,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ unordered_pair ) )
!= ( B @ ( A @ unordered_pair ) ) )
| ( sk1 @ singleton @ ( B @ member ) ) ),
inference(paramod_ordered,[status(thm)],[50069,83]) ).
thf(50167,plain,
sk1 @ singleton @ ( sk2 @ member ),
inference(pattern_uni,[status(thm)],[50166:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(44838,plain,
~ ( sk1 @ singleton @ ( sk2 @ member ) ),
inference(rewrite,[status(thm)],[26648,44798]) ).
thf(50249,plain,
$false,
inference(rewrite,[status(thm)],[50167,44838]) ).
thf(50250,plain,
$false,
inference(simp,[status(thm)],[50249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET707+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.41 % Computer : n001.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.42 % CPULimit : 300
% 0.14/0.42 % WCLimit : 300
% 0.14/0.42 % DateTime : Sat Sep 26 08:13:12 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.88/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.28/1.17 % [INFO] Parsing done (188ms).
% 1.28/1.19 % [INFO] Running in sequential loop mode.
% 1.91/1.57 % [INFO] eprover registered as external prover.
% 1.91/1.58 % [INFO] Scanning for conjecture ...
% 2.29/1.70 % [INFO] Found a conjecture (or negated_conjecture) and 11 axioms. Running axiom selection ...
% 2.29/1.74 % [INFO] Axiom selection finished. Selected 11 axioms (removed 0 axioms).
% 2.29/1.77 % [INFO] Problem is first-order (TPTP FOF).
% 2.29/1.77 % [INFO] Type checking passed.
% 2.29/1.78 % [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 ...
% 87.81/18.78 % [INFO] Killing All external provers ...
% 87.81/18.78 % Time passed: 18224ms (effective reasoning time: 17583ms)
% 87.81/18.78 % 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)>
% 87.81/18.78 % Axioms used in derivation (4): equal_set, unordered_pair, subset, singleton
% 87.81/18.78 % No. of inferences in proof: 132
% 87.81/18.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 18224 ms resp. 17583 ms w/o parsing
% 87.37/18.83 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 87.37/18.83 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------