TSTP Solution File: SEV478^1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV478^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n019.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 16:00:21 EDT 2024
% Result : Theorem 28.94s 5.50s
% Output : Refutation 29.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 139 ( 35 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 645 ( 28 ~; 13 |; 2 &; 593 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 6 con; 0-5 aty)
% Number of variables : 74 ( 18 ^ 56 !; 0 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf('\'type/nums/num\'_type',type,
'\'type/nums/num\'': $tType ).
thf('\'const/sets/ITSET\'_type',type,
'\'const/sets/ITSET\'':
!>[TA: $tType,TB: $tType] : ( ( TB > TA > TA ) > ( TB > $o ) > TA > TA ) ).
thf('\'const/sets/INSERT\'_type',type,
'\'const/sets/INSERT\'':
!>[TA: $tType] : ( TA > ( TA > $o ) > TA > $o ) ).
thf('\'const/sets/IN\'_type',type,
'\'const/sets/IN\'':
!>[TA: $tType] : ( TA > ( TA > $o ) > $o ) ).
thf('\'const/sets/FINITE\'_type',type,
'\'const/sets/FINITE\'':
!>[TA: $tType] : ( ( TA > $o ) > $o ) ).
thf('\'const/sets/EMPTY\'_type',type,
'\'const/sets/EMPTY\'':
!>[TA: $tType] : ( TA > $o ) ).
thf('\'const/sets/CARD\'_type',type,
'\'const/sets/CARD\'':
!>[TA: $tType] : ( ( TA > $o ) > '\'type/nums/num\'' ) ).
thf('\'const/nums/SUC\'_type',type,
'\'const/nums/SUC\'': '\'type/nums/num\'' > '\'type/nums/num\'' ).
thf('\'const/nums/NUMERAL\'_type',type,
'\'const/nums/NUMERAL\'': '\'type/nums/num\'' > '\'type/nums/num\'' ).
thf('\'const/nums/_0\'_type',type,
'\'const/nums/_0\'': '\'type/nums/num\'' ).
thf('\'const/class/COND\'_type',type,
'\'const/class/COND\'':
!>[TA: $tType] : ( $o > TA > TA > TA ) ).
thf(skt1_type,type,
skt1: $tType ).
thf(sk1_type,type,
sk1: skt1 ).
thf(sk2_type,type,
sk2: skt1 > $o ).
thf(sk5_type,type,
sk5:
!>[TA: $tType,TB: $tType] : ( TB > ( TA > TB > TB ) > TB ) ).
thf(4,axiom,
! [TA: $tType,TB: $tType,A: TB > TA > TA,B: TA] :
( ! [C: TB,D: TB,E: TA] :
( ( C != D )
=> ( ( A @ C @ ( A @ D @ E ) )
= ( A @ D @ ( A @ C @ E ) ) ) )
=> ( ( ( '\'const/sets/ITSET\'' @ TB @ TA @ A @ ( '\'const/sets/EMPTY\'' @ TB ) @ B )
= B )
& ! [C: TB,D: TB > $o] :
( ( '\'const/sets/FINITE\'' @ TB @ D )
=> ( ( '\'const/sets/ITSET\'' @ TB @ TA @ A @ ( '\'const/sets/INSERT\'' @ TB @ C @ D ) @ B )
= ( '\'const/class/COND\'' @ TA @ ( '\'const/sets/IN\'' @ TB @ C @ D ) @ ( '\'const/sets/ITSET\'' @ TB @ TA @ A @ D @ B ) @ ( A @ C @ ( '\'const/sets/ITSET\'' @ TB @ TA @ A @ D @ B ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/FINITE_RECURSION_') ).
thf(12,plain,
! [TA: $tType,TB: $tType,A: TB > TA > TA,B: TA] :
( ! [C: TB,D: TB,E: TA] :
( ( C != D )
=> ( ( A @ C @ ( A @ D @ E ) )
= ( A @ D @ ( A @ C @ E ) ) ) )
=> ( ( ( '\'const/sets/ITSET\'' @ TB @ TA @ A @ ( '\'const/sets/EMPTY\'' @ TB ) @ B )
= B )
& ! [C: TB,D: TB > $o] :
( ( '\'const/sets/FINITE\'' @ TB @ D )
=> ( ( '\'const/sets/ITSET\'' @ TB @ TA @ A @ ( '\'const/sets/INSERT\'' @ TB @ C @ D ) @ B )
= ( '\'const/class/COND\'' @ TA @ ( '\'const/sets/IN\'' @ TB @ C @ D ) @ ( '\'const/sets/ITSET\'' @ TB @ TA @ A @ D @ B ) @ ( A @ C @ ( '\'const/sets/ITSET\'' @ TB @ TA @ A @ D @ B ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(16,plain,
! [TA: $tType,TB: $tType,D: TA > $o,C: TA,B: TB,A: TA > TB > TB] :
( ( ( A @ ( sk3 @ TB @ TA @ B @ A ) @ ( A @ ( sk4 @ TB @ TA @ B @ A ) @ ( sk5 @ TB @ TA @ B @ A ) ) )
!= ( A @ ( sk4 @ TB @ TA @ B @ A ) @ ( A @ ( sk3 @ TB @ TA @ B @ A ) @ ( sk5 @ TB @ TA @ B @ A ) ) ) )
| ~ ( '\'const/sets/FINITE\'' @ TA @ D )
| ( ( '\'const/sets/ITSET\'' @ TA @ TB @ A @ ( '\'const/sets/INSERT\'' @ TA @ C @ D ) @ B )
= ( '\'const/class/COND\'' @ TB @ ( '\'const/sets/IN\'' @ TA @ C @ D ) @ ( '\'const/sets/ITSET\'' @ TA @ TB @ A @ D @ B ) @ ( A @ C @ ( '\'const/sets/ITSET\'' @ TA @ TB @ A @ D @ B ) ) ) ) ),
inference(cnf,[status(esa)],[12]) ).
thf(20,plain,
! [TA: $tType,TB: $tType,D: TA > $o,C: TA,B: TB,A: TA > TB > TB] :
( ( ( A @ ( sk4 @ TB @ TA @ B @ A ) @ ( A @ ( sk3 @ TB @ TA @ B @ A ) @ ( sk5 @ TB @ TA @ B @ A ) ) )
!= ( A @ ( sk3 @ TB @ TA @ B @ A ) @ ( A @ ( sk4 @ TB @ TA @ B @ A ) @ ( sk5 @ TB @ TA @ B @ A ) ) ) )
| ( ( '\'const/sets/ITSET\'' @ TA @ TB @ A @ ( '\'const/sets/INSERT\'' @ TA @ C @ D ) @ B )
= ( '\'const/class/COND\'' @ TB @ ( '\'const/sets/IN\'' @ TA @ C @ D ) @ ( '\'const/sets/ITSET\'' @ TA @ TB @ A @ D @ B ) @ ( A @ C @ ( '\'const/sets/ITSET\'' @ TA @ TB @ A @ D @ B ) ) ) )
| ~ ( '\'const/sets/FINITE\'' @ TA @ D ) ),
inference(lifteq,[status(thm)],[16]) ).
thf(3,axiom,
! [TA: $tType,A: TA > $o] :
( ( '\'const/sets/CARD\'' @ TA @ A )
= ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\''
@ ^ [B: TA] : '\'const/nums/SUC\''
@ A
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/CARD_') ).
thf(9,plain,
! [TA: $tType,A: TA > $o] :
( ( '\'const/sets/CARD\'' @ TA @ A )
= ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\''
@ ^ [B: TA] : '\'const/nums/SUC\''
@ A
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(10,plain,
! [TA: $tType,A: TA > $o] :
( ( '\'const/sets/CARD\'' @ TA @ A )
= ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\''
@ ^ [B: TA] : '\'const/nums/SUC\''
@ A
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) ) ),
inference(cnf,[status(esa)],[9]) ).
thf(11,plain,
! [TA: $tType,A: TA > $o] :
( ( '\'const/sets/CARD\'' @ TA @ A )
= ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\''
@ ^ [B: TA] : '\'const/nums/SUC\''
@ A
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) ) ),
inference(lifteq,[status(thm)],[10]) ).
thf(1,conjecture,
! [TA: $tType,A: TA,B: TA > $o] :
( ( '\'const/sets/FINITE\'' @ TA @ B )
=> ( ( '\'const/sets/CARD\'' @ TA @ ( '\'const/sets/INSERT\'' @ TA @ A @ B ) )
= ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ TA @ A @ B ) @ ( '\'const/sets/CARD\'' @ TA @ B ) @ ( '\'const/nums/SUC\'' @ ( '\'const/sets/CARD\'' @ TA @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/CARD_CLAUSES_1') ).
thf(2,negated_conjecture,
~ ! [TA: $tType,A: TA,B: TA > $o] :
( ( '\'const/sets/FINITE\'' @ TA @ B )
=> ( ( '\'const/sets/CARD\'' @ TA @ ( '\'const/sets/INSERT\'' @ TA @ A @ B ) )
= ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ TA @ A @ B ) @ ( '\'const/sets/CARD\'' @ TA @ B ) @ ( '\'const/nums/SUC\'' @ ( '\'const/sets/CARD\'' @ TA @ B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ! [TA: $tType,A: TA,B: TA > $o] :
( ( '\'const/sets/FINITE\'' @ TA @ B )
=> ( ( '\'const/sets/CARD\'' @ TA @ ( '\'const/sets/INSERT\'' @ TA @ A @ B ) )
= ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ TA @ A @ B ) @ ( '\'const/sets/CARD\'' @ TA @ B ) @ ( '\'const/nums/SUC\'' @ ( '\'const/sets/CARD\'' @ TA @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) )
!= ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ skt1 @ sk1 @ sk2 ) @ ( '\'const/sets/CARD\'' @ skt1 @ sk2 ) @ ( '\'const/nums/SUC\'' @ ( '\'const/sets/CARD\'' @ skt1 @ sk2 ) ) ) ),
inference(cnf,[status(esa)],[5]) ).
thf(8,plain,
( ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ skt1 @ sk1 @ sk2 ) @ ( '\'const/sets/CARD\'' @ skt1 @ sk2 ) @ ( '\'const/nums/SUC\'' @ ( '\'const/sets/CARD\'' @ skt1 @ sk2 ) ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(21,plain,
! [TA: $tType,A: TA > $o] :
( ( ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\''
@ ^ [B: TA] : '\'const/nums/SUC\''
@ A
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
@ ( '\'const/nums/SUC\'' @ ( '\'const/sets/CARD\'' @ skt1 @ sk2 ) ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) )
| ( ( '\'const/sets/CARD\'' @ TA @ A )
!= ( '\'const/sets/CARD\'' @ skt1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[11,8]) ).
thf(22,plain,
( ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [A: skt1] : '\'const/nums/SUC\''
@ sk2
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
@ ( '\'const/nums/SUC\'' @ ( '\'const/sets/CARD\'' @ skt1 @ sk2 ) ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) ),
inference(pattern_uni,[status(thm)],[21:[bind(A,$thf( sk2 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(25,plain,
! [TA: $tType,A: TA > $o] :
( ( ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [B: skt1] : '\'const/nums/SUC\''
@ sk2
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
@ ( '\'const/nums/SUC\''
@ ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\''
@ ^ [B: TA] : '\'const/nums/SUC\''
@ A
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) ) ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) )
| ( ( '\'const/sets/CARD\'' @ TA @ A )
!= ( '\'const/sets/CARD\'' @ skt1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[11,22]) ).
thf(26,plain,
( ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [A: skt1] : '\'const/nums/SUC\''
@ sk2
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
@ ( '\'const/nums/SUC\''
@ ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [A: skt1] : '\'const/nums/SUC\''
@ sk2
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) ) ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) ),
inference(pattern_uni,[status(thm)],[25:[bind(A,$thf( sk2 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(488,plain,
! [TA: $tType,D: TA > $o,C: TA,B: '\'type/nums/num\'',A: TA > '\'type/nums/num\'' > '\'type/nums/num\''] :
( ( ( A @ ( sk4 @ '\'type/nums/num\'' @ TA @ B @ A ) @ ( A @ ( sk3 @ '\'type/nums/num\'' @ TA @ B @ A ) @ ( sk5 @ '\'type/nums/num\'' @ TA @ B @ A ) ) )
!= ( A @ ( sk3 @ '\'type/nums/num\'' @ TA @ B @ A ) @ ( A @ ( sk4 @ '\'type/nums/num\'' @ TA @ B @ A ) @ ( sk5 @ '\'type/nums/num\'' @ TA @ B @ A ) ) ) )
| ~ ( '\'const/sets/FINITE\'' @ TA @ D )
| ( ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\'' @ A @ ( '\'const/sets/INSERT\'' @ TA @ C @ D ) @ B )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) )
| ( ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ TA @ C @ D ) @ ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\'' @ A @ D @ B ) @ ( A @ C @ ( '\'const/sets/ITSET\'' @ TA @ '\'type/nums/num\'' @ A @ D @ B ) ) )
!= ( '\'const/class/COND\'' @ '\'type/nums/num\'' @ ( '\'const/sets/IN\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [E: skt1] : '\'const/nums/SUC\''
@ sk2
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
@ ( '\'const/nums/SUC\''
@ ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [E: skt1] : '\'const/nums/SUC\''
@ sk2
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[20,26]) ).
thf(573,plain,
( ( ( '\'const/nums/SUC\''
@ ( '\'const/nums/SUC\''
@ ( sk5 @ '\'type/nums/num\'' @ skt1 @ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' )
@ ^ [A: skt1] : '\'const/nums/SUC\'' ) ) )
!= ( '\'const/nums/SUC\''
@ ( '\'const/nums/SUC\''
@ ( sk5 @ '\'type/nums/num\'' @ skt1 @ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' )
@ ^ [A: skt1] : '\'const/nums/SUC\'' ) ) ) )
| ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk2 )
| ( ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [A: skt1] : '\'const/nums/SUC\''
@ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) ) ),
inference(pre_uni,[status(thm)],[488:[bind(A,$thf( ^ [E: skt1] : '\'const/nums/SUC\'' )),bind(B,$thf( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' )),bind(C,$thf( sk1 )),bind(D,$thf( sk2 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(613,plain,
( ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk2 )
| ( ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [A: skt1] : '\'const/nums/SUC\''
@ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) ) ),
inference(simp,[status(thm)],[573]) ).
thf(7,plain,
'\'const/sets/FINITE\'' @ skt1 @ sk2,
inference(cnf,[status(esa)],[5]) ).
thf(643,plain,
( ~ $true
| ( ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [A: skt1] : '\'const/nums/SUC\''
@ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) ) ),
inference(rewrite,[status(thm)],[613,7]) ).
thf(644,plain,
( ( '\'const/sets/ITSET\'' @ skt1 @ '\'type/nums/num\''
@ ^ [A: skt1] : '\'const/nums/SUC\''
@ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 )
@ ( '\'const/nums/NUMERAL\'' @ '\'const/nums/_0\'' ) )
!= ( '\'const/sets/CARD\'' @ skt1 @ ( '\'const/sets/INSERT\'' @ skt1 @ sk1 @ sk2 ) ) ),
inference(simp,[status(thm)],[643]) ).
thf(645,plain,
$false,
inference(simplifyReflect,[status(thm)],[644,11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV478^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d SAT
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jun 21 19:33:25 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.99/0.91 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.24/1.05 % [INFO] Parsing done (130ms).
% 1.24/1.05 % [INFO] Running in sequential loop mode.
% 1.75/1.26 % [INFO] nitpick registered as external prover.
% 1.75/1.26 % [INFO] Scanning for conjecture ...
% 1.75/1.32 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.00/1.35 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.00/1.36 % [INFO] Problem is higher-order (TPTP THF).
% 2.00/1.37 % [INFO] Type checking passed.
% 2.00/1.37 % [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.94/5.49 % [INFO] Killing All external provers ...
% 28.94/5.50 % Time passed: 4971ms (effective reasoning time: 4437ms)
% 28.94/5.50 % 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.94/5.50 % Axioms used in derivation (2): thm/sets/FINITE_RECURSION_, thm/sets/CARD_
% 28.94/5.50 % No. of inferences in proof: 24
% 28.94/5.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4971 ms resp. 4437 ms w/o parsing
% 29.06/5.60 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 29.06/5.60 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------