TSTP Solution File: SEU998^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU998^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n010.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:44:24 EDT 2024
% Result : Theorem 228.98s 36.44s
% Output : Refutation 228.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 66 ( 42 unt; 8 typ; 0 def)
% Number of atoms : 223 ( 222 equ; 0 cnn)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 815 ( 62 ~; 13 |; 144 &; 588 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 5 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 169 ( 0 ^ 149 !; 20 ?; 169 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > a > a ).
thf(sk2_type,type,
sk2: a > a > a ).
thf(sk3_type,type,
sk3: a ).
thf(sk4_type,type,
sk4: a ).
thf(sk5_type,type,
sk5: a ).
thf(sk6_type,type,
sk6: a ).
thf(sk7_type,type,
sk7: a ).
thf(1,conjecture,
! [A: a > a > a,B: a > a > a] :
( ( ! [C: a] :
( ( A @ C @ C )
= C )
& ! [C: a] :
( ( B @ C @ C )
= C )
& ! [C: a,D: a,E: a] :
( ( A @ ( A @ C @ D ) @ E )
= ( A @ C @ ( A @ D @ E ) ) )
& ! [C: a,D: a,E: a] :
( ( B @ ( B @ C @ D ) @ E )
= ( B @ C @ ( B @ D @ E ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
= ( A @ D @ C ) )
& ! [C: a,D: a] :
( ( B @ C @ D )
= ( B @ D @ C ) )
& ! [C: a,D: a] :
( ( A @ ( B @ C @ D ) @ D )
= D )
& ! [C: a,D: a] :
( ( B @ ( A @ C @ D ) @ D )
= D ) )
=> ( ? [C: a,D: a,E: a,F: a,G: a] :
( ( E != F )
& ( E != G )
& ( E != C )
& ( E != D )
& ( F != G )
& ( F != C )
& ( F != D )
& ( G != C )
& ( G != D )
& ( C != D )
& ( ( B @ C @ D )
= D )
& ( ( A @ C @ D )
= C )
& ( ( B @ C @ E )
= E )
& ( ( A @ C @ E )
= C )
& ( ( B @ C @ F )
= F )
& ( ( A @ C @ F )
= C )
& ( ( B @ C @ G )
= G )
& ( ( A @ C @ G )
= C )
& ( ( B @ E @ F )
= D )
& ( ( A @ E @ F )
= C )
& ( ( B @ E @ G )
= D )
& ( ( A @ E @ G )
= C )
& ( ( B @ E @ D )
= D )
& ( ( A @ E @ D )
= E )
& ( ( B @ F @ G )
= D )
& ( ( A @ F @ G )
= C )
& ( ( B @ F @ D )
= D )
& ( ( A @ F @ D )
= F )
& ( ( B @ G @ D )
= D )
& ( ( A @ G @ D )
= G ) )
=> ~ ! [C: a,D: a,E: a] :
( ( B @ C @ ( A @ D @ E ) )
= ( A @ ( B @ C @ D ) @ ( B @ C @ E ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c3_DIAMOND_THM_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a > a,B: a > a > a] :
( ( ! [C: a] :
( ( A @ C @ C )
= C )
& ! [C: a] :
( ( B @ C @ C )
= C )
& ! [C: a,D: a,E: a] :
( ( A @ ( A @ C @ D ) @ E )
= ( A @ C @ ( A @ D @ E ) ) )
& ! [C: a,D: a,E: a] :
( ( B @ ( B @ C @ D ) @ E )
= ( B @ C @ ( B @ D @ E ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
= ( A @ D @ C ) )
& ! [C: a,D: a] :
( ( B @ C @ D )
= ( B @ D @ C ) )
& ! [C: a,D: a] :
( ( A @ ( B @ C @ D ) @ D )
= D )
& ! [C: a,D: a] :
( ( B @ ( A @ C @ D ) @ D )
= D ) )
=> ( ? [C: a,D: a,E: a,F: a,G: a] :
( ( E != F )
& ( E != G )
& ( E != C )
& ( E != D )
& ( F != G )
& ( F != C )
& ( F != D )
& ( G != C )
& ( G != D )
& ( C != D )
& ( ( B @ C @ D )
= D )
& ( ( A @ C @ D )
= C )
& ( ( B @ C @ E )
= E )
& ( ( A @ C @ E )
= C )
& ( ( B @ C @ F )
= F )
& ( ( A @ C @ F )
= C )
& ( ( B @ C @ G )
= G )
& ( ( A @ C @ G )
= C )
& ( ( B @ E @ F )
= D )
& ( ( A @ E @ F )
= C )
& ( ( B @ E @ G )
= D )
& ( ( A @ E @ G )
= C )
& ( ( B @ E @ D )
= D )
& ( ( A @ E @ D )
= E )
& ( ( B @ F @ G )
= D )
& ( ( A @ F @ G )
= C )
& ( ( B @ F @ D )
= D )
& ( ( A @ F @ D )
= F )
& ( ( B @ G @ D )
= D )
& ( ( A @ G @ D )
= G ) )
=> ~ ! [C: a,D: a,E: a] :
( ( B @ C @ ( A @ D @ E ) )
= ( A @ ( B @ C @ D ) @ ( B @ C @ E ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a > a,B: a > a > a] :
( ( ! [C: a] :
( ( A @ C @ C )
= C )
& ! [C: a] :
( ( B @ C @ C )
= C )
& ! [C: a,D: a,E: a] :
( ( A @ ( A @ C @ D ) @ E )
= ( A @ C @ ( A @ D @ E ) ) )
& ! [C: a,D: a,E: a] :
( ( B @ ( B @ C @ D ) @ E )
= ( B @ C @ ( B @ D @ E ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
= ( A @ D @ C ) )
& ! [C: a,D: a] :
( ( B @ C @ D )
= ( B @ D @ C ) )
& ! [C: a,D: a] :
( ( A @ ( B @ C @ D ) @ D )
= D )
& ! [C: a,D: a] :
( ( B @ ( A @ C @ D ) @ D )
= D ) )
=> ( ? [C: a,D: a,E: a,F: a,G: a] :
( ( E != F )
& ( E != G )
& ( E != C )
& ( E != D )
& ( F != G )
& ( F != C )
& ( F != D )
& ( G != C )
& ( G != D )
& ( C != D )
& ( ( B @ C @ D )
= D )
& ( ( A @ C @ D )
= C )
& ( ( B @ C @ E )
= E )
& ( ( A @ C @ E )
= C )
& ( ( B @ C @ F )
= F )
& ( ( A @ C @ F )
= C )
& ( ( B @ C @ G )
= G )
& ( ( A @ C @ G )
= C )
& ( ( B @ E @ F )
= D )
& ( ( A @ E @ F )
= C )
& ( ( B @ E @ G )
= D )
& ( ( A @ E @ G )
= C )
& ( ( B @ E @ D )
= D )
& ( ( A @ E @ D )
= E )
& ( ( B @ F @ G )
= D )
& ( ( A @ F @ G )
= C )
& ( ( B @ F @ D )
= D )
& ( ( A @ F @ D )
= F )
& ( ( B @ G @ D )
= D )
& ( ( A @ G @ D )
= G ) )
=> ~ ! [C: a,D: a,E: a] :
( ( B @ C @ ( A @ D @ E ) )
= ( A @ ( B @ C @ D ) @ ( B @ C @ E ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ! [A: a > a > a,B: a > a > a] :
( ( ! [C: a] :
( ( A @ C @ C )
= C )
& ! [C: a] :
( ( B @ C @ C )
= C )
& ! [C: a,D: a,E: a] :
( ( A @ ( A @ C @ D ) @ E )
= ( A @ C @ ( A @ D @ E ) ) )
& ! [C: a,D: a,E: a] :
( ( B @ ( B @ C @ D ) @ E )
= ( B @ C @ ( B @ D @ E ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
= ( A @ D @ C ) )
& ! [C: a,D: a] :
( ( B @ C @ D )
= ( B @ D @ C ) )
& ! [C: a,D: a] :
( ( A @ ( B @ C @ D ) @ D )
= D )
& ! [C: a,D: a] :
( ( B @ ( A @ C @ D ) @ D )
= D ) )
=> ( ? [C: a,D: a,E: a,F: a] :
( ( E != F )
& ? [G: a] :
( ( E != G )
& ( E != C )
& ( E != D )
& ( F != G )
& ( F != C )
& ( F != D )
& ( G != C )
& ( G != D )
& ( C != D )
& ( ( B @ C @ D )
= D )
& ( ( A @ C @ D )
= C )
& ( ( B @ C @ E )
= E )
& ( ( A @ C @ E )
= C )
& ( ( B @ C @ F )
= F )
& ( ( A @ C @ F )
= C )
& ( ( B @ C @ G )
= G )
& ( ( A @ C @ G )
= C )
& ( ( B @ E @ F )
= D )
& ( ( A @ E @ F )
= C )
& ( ( B @ E @ G )
= D )
& ( ( A @ E @ G )
= C )
& ( ( B @ E @ D )
= D )
& ( ( A @ E @ D )
= E )
& ( ( B @ F @ G )
= D )
& ( ( A @ F @ G )
= C )
& ( ( B @ F @ D )
= D )
& ( ( A @ F @ D )
= F )
& ( ( B @ G @ D )
= D )
& ( ( A @ G @ D )
= G ) ) )
=> ~ ! [C: a,D: a,E: a] :
( ( B @ C @ ( A @ D @ E ) )
= ( A @ ( B @ C @ D ) @ ( B @ C @ E ) ) ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(40,plain,
( ( sk2 @ sk6 @ sk4 )
= sk4 ),
inference(cnf,[status(esa)],[4]) ).
thf(84,plain,
( ( sk2 @ sk6 @ sk4 )
= sk4 ),
inference(lifteq,[status(thm)],[40]) ).
thf(8,plain,
! [B: a,A: a] :
( ( sk2 @ A @ B )
= ( sk2 @ B @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(53,plain,
! [B: a,A: a] :
( ( sk2 @ A @ B )
= ( sk2 @ B @ A ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(54,plain,
! [B: a,A: a] :
( ( sk2 @ A @ B )
= ( sk2 @ B @ A ) ),
inference(simp,[status(thm)],[53]) ).
thf(522,plain,
! [B: a,A: a] :
( ( ( sk2 @ B @ A )
= sk4 )
| ( ( sk2 @ sk6 @ sk4 )
!= ( sk2 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[84,54]) ).
thf(523,plain,
( ( sk2 @ sk4 @ sk6 )
= sk4 ),
inference(pattern_uni,[status(thm)],[522:[bind(A,$thf( sk6 )),bind(B,$thf( sk4 ))]]) ).
thf(29,plain,
! [B: a,A: a] :
( ( sk2 @ ( sk1 @ A @ B ) @ B )
= B ),
inference(cnf,[status(esa)],[4]) ).
thf(62,plain,
! [B: a,A: a] :
( ( sk2 @ ( sk1 @ A @ B ) @ B )
= B ),
inference(lifteq,[status(thm)],[29]) ).
thf(63,plain,
! [B: a,A: a] :
( ( sk2 @ ( sk1 @ A @ B ) @ B )
= B ),
inference(simp,[status(thm)],[62]) ).
thf(1023,plain,
! [D: a,C: a,B: a,A: a] :
( ( ( sk2 @ A @ B )
= D )
| ( ( sk2 @ B @ A )
!= ( sk2 @ ( sk1 @ C @ D ) @ D ) ) ),
inference(paramod_ordered,[status(thm)],[54,63]) ).
thf(1024,plain,
! [B: a,A: a] :
( ( sk2 @ A @ ( sk1 @ B @ A ) )
= A ),
inference(pattern_uni,[status(thm)],[1023:[bind(A,$thf( A )),bind(B,$thf( sk1 @ E @ A )),bind(C,$thf( E )),bind(D,$thf( A ))]]) ).
thf(1075,plain,
! [B: a,A: a] :
( ( sk2 @ A @ ( sk1 @ B @ A ) )
= A ),
inference(simp,[status(thm)],[1024]) ).
thf(43,plain,
! [C: a,B: a,A: a] :
( ( sk2 @ A @ ( sk1 @ B @ C ) )
= ( sk1 @ ( sk2 @ A @ B ) @ ( sk2 @ A @ C ) ) ),
inference(cnf,[status(esa)],[4]) ).
thf(82,plain,
! [C: a,B: a,A: a] :
( ( sk2 @ A @ ( sk1 @ B @ C ) )
= ( sk1 @ ( sk2 @ A @ B ) @ ( sk2 @ A @ C ) ) ),
inference(lifteq,[status(thm)],[43]) ).
thf(83,plain,
! [C: a,B: a,A: a] :
( ( sk2 @ A @ ( sk1 @ B @ C ) )
= ( sk1 @ ( sk2 @ A @ B ) @ ( sk2 @ A @ C ) ) ),
inference(simp,[status(thm)],[82]) ).
thf(24105,plain,
! [B: a,A: a] :
( ( sk1 @ ( sk2 @ A @ B ) @ ( sk2 @ A @ A ) )
= A ),
inference(rewrite,[status(thm)],[1075,83]) ).
thf(24129,plain,
! [B: a,A: a] :
( ( ( sk1 @ sk4 @ ( sk2 @ A @ A ) )
= A )
| ( ( sk2 @ sk4 @ sk6 )
!= ( sk2 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[523,24105]) ).
thf(24130,plain,
( ( sk1 @ sk4 @ ( sk2 @ sk4 @ sk4 ) )
= sk4 ),
inference(pattern_uni,[status(thm)],[24129:[bind(A,$thf( sk4 )),bind(B,$thf( sk6 ))]]) ).
thf(14,plain,
( ( sk2 @ sk5 @ sk4 )
= sk4 ),
inference(cnf,[status(esa)],[4]) ).
thf(46,plain,
( ( sk2 @ sk5 @ sk4 )
= sk4 ),
inference(lifteq,[status(thm)],[14]) ).
thf(299,plain,
! [B: a,A: a] :
( ( ( sk2 @ B @ A )
= sk4 )
| ( ( sk2 @ A @ B )
!= ( sk2 @ sk5 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[54,46]) ).
thf(300,plain,
( ( sk2 @ sk4 @ sk5 )
= sk4 ),
inference(pattern_uni,[status(thm)],[299:[bind(A,$thf( sk5 )),bind(B,$thf( sk4 ))]]) ).
thf(20,plain,
! [C: a,B: a,A: a] :
( ( sk2 @ ( sk2 @ A @ B ) @ C )
= ( sk2 @ A @ ( sk2 @ B @ C ) ) ),
inference(cnf,[status(esa)],[4]) ).
thf(60,plain,
! [C: a,B: a,A: a] :
( ( sk2 @ ( sk2 @ A @ B ) @ C )
= ( sk2 @ A @ ( sk2 @ B @ C ) ) ),
inference(lifteq,[status(thm)],[20]) ).
thf(61,plain,
! [C: a,B: a,A: a] :
( ( sk2 @ ( sk2 @ A @ B ) @ C )
= ( sk2 @ A @ ( sk2 @ B @ C ) ) ),
inference(simp,[status(thm)],[60]) ).
thf(822,plain,
! [C: a,B: a,A: a] :
( ( ( sk2 @ A @ ( sk2 @ B @ C ) )
= sk4 )
| ( ( sk2 @ ( sk2 @ A @ B ) @ C )
!= ( sk2 @ sk4 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[300,61]) ).
thf(834,plain,
! [C: a,B: a,A: a] :
( ( ( sk2 @ A @ ( sk2 @ B @ C ) )
= sk4 )
| ( ( sk2 @ A @ B )
!= sk4 )
| ( C != sk5 ) ),
inference(simp,[status(thm)],[822]) ).
thf(881,plain,
! [B: a,A: a] :
( ( ( sk2 @ A @ ( sk2 @ B @ sk5 ) )
= sk4 )
| ( ( sk2 @ A @ B )
!= sk4 ) ),
inference(simp,[status(thm)],[834]) ).
thf(11872,plain,
! [B: a,A: a] :
( ( ( sk2 @ A @ ( sk2 @ B @ sk5 ) )
= sk4 )
| ( ( sk2 @ sk4 @ sk6 )
!= ( sk2 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[523,881]) ).
thf(11873,plain,
( ( sk2 @ sk4 @ ( sk2 @ sk6 @ sk5 ) )
= sk4 ),
inference(pattern_uni,[status(thm)],[11872:[bind(A,$thf( sk4 )),bind(B,$thf( sk6 ))]]) ).
thf(22,plain,
( ( sk2 @ sk5 @ sk6 )
= sk4 ),
inference(cnf,[status(esa)],[4]) ).
thf(75,plain,
( ( sk2 @ sk5 @ sk6 )
= sk4 ),
inference(lifteq,[status(thm)],[22]) ).
thf(338,plain,
! [B: a,A: a] :
( ( ( sk2 @ B @ A )
= sk4 )
| ( ( sk2 @ sk5 @ sk6 )
!= ( sk2 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[75,54]) ).
thf(339,plain,
( ( sk2 @ sk6 @ sk5 )
= sk4 ),
inference(pattern_uni,[status(thm)],[338:[bind(A,$thf( sk5 )),bind(B,$thf( sk6 ))]]) ).
thf(14479,plain,
( ( sk2 @ sk4 @ sk4 )
= sk4 ),
inference(rewrite,[status(thm)],[11873,339]) ).
thf(24719,plain,
( ( sk1 @ sk4 @ sk4 )
= sk4 ),
inference(rewrite,[status(thm)],[24130,14479]) ).
thf(18,plain,
( ( sk1 @ sk5 @ sk7 )
= sk3 ),
inference(cnf,[status(esa)],[4]) ).
thf(52,plain,
( ( sk1 @ sk5 @ sk7 )
= sk3 ),
inference(lifteq,[status(thm)],[18]) ).
thf(1885,plain,
! [C: a,B: a,A: a] :
( ( ( sk2 @ A @ sk3 )
= ( sk1 @ ( sk2 @ A @ B ) @ ( sk2 @ A @ C ) ) )
| ( ( sk1 @ sk5 @ sk7 )
!= ( sk1 @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[52,83]) ).
thf(1886,plain,
! [A: a] :
( ( sk2 @ A @ sk3 )
= ( sk1 @ ( sk2 @ A @ sk5 ) @ ( sk2 @ A @ sk7 ) ) ),
inference(pattern_uni,[status(thm)],[1885:[bind(A,$thf( A )),bind(B,$thf( sk5 )),bind(C,$thf( sk7 ))]]) ).
thf(108903,plain,
! [A: a] :
( ( ( sk1 @ sk4 @ ( sk2 @ A @ sk7 ) )
= ( sk2 @ A @ sk3 ) )
| ( ( sk2 @ sk6 @ sk5 )
!= ( sk2 @ A @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[339,1886]) ).
thf(108904,plain,
( ( sk1 @ sk4 @ ( sk2 @ sk6 @ sk7 ) )
= ( sk2 @ sk6 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[108903:[bind(A,$thf( sk6 ))]]) ).
thf(27,plain,
( ( sk2 @ sk3 @ sk6 )
= sk6 ),
inference(cnf,[status(esa)],[4]) ).
thf(76,plain,
( ( sk2 @ sk3 @ sk6 )
= sk6 ),
inference(lifteq,[status(thm)],[27]) ).
thf(368,plain,
! [B: a,A: a] :
( ( ( sk2 @ B @ A )
= sk6 )
| ( ( sk2 @ sk3 @ sk6 )
!= ( sk2 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[76,54]) ).
thf(369,plain,
( ( sk2 @ sk6 @ sk3 )
= sk6 ),
inference(pattern_uni,[status(thm)],[368:[bind(A,$thf( sk3 )),bind(B,$thf( sk6 ))]]) ).
thf(5,plain,
( ( sk2 @ sk6 @ sk7 )
= sk4 ),
inference(cnf,[status(esa)],[4]) ).
thf(44,plain,
( ( sk2 @ sk6 @ sk7 )
= sk4 ),
inference(lifteq,[status(thm)],[5]) ).
thf(112115,plain,
( ( sk1 @ sk4 @ sk4 )
= sk6 ),
inference(rewrite,[status(thm)],[108904,369,44]) ).
thf(112116,plain,
sk6 = sk4,
inference(rewrite,[status(thm)],[24719,112115]) ).
thf(11,plain,
sk6 != sk4,
inference(cnf,[status(esa)],[4]) ).
thf(81,plain,
sk6 != sk4,
inference(lifteq,[status(thm)],[11]) ).
thf(112747,plain,
$false,
inference(simplifyReflect,[status(thm)],[112116,81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU998^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n010.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sun May 19 17:10:24 EDT 2024
% 0.16/0.37 % CPUTime :
% 1.00/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.15/0.98 % [INFO] Parsing done (115ms).
% 1.15/0.99 % [INFO] Running in sequential loop mode.
% 1.68/1.18 % [INFO] nitpick registered as external prover.
% 1.68/1.19 % [INFO] Scanning for conjecture ...
% 1.88/1.27 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.88/1.30 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.88/1.30 % [INFO] Problem is higher-order (TPTP THF).
% 1.88/1.30 % [INFO] Type checking passed.
% 1.88/1.31 % [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 ...
% 228.98/36.43 % [INFO] Killing All external provers ...
% 228.98/36.44 % Time passed: 35902ms (effective reasoning time: 35443ms)
% 228.98/36.44 % 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)>
% 228.98/36.44 % Axioms used in derivation (0):
% 228.98/36.44 % No. of inferences in proof: 58
% 228.98/36.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 35902 ms resp. 35443 ms w/o parsing
% 228.98/36.48 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 228.98/36.48 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------