TSTP Solution File: SEU950^5 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU950^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n002.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:40:31 EDT 2024
% Result : Theorem 18.04s 4.59s
% Output : Refutation 18.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 8
% Syntax : Number of formulae : 75 ( 25 unt; 6 typ; 0 def)
% Number of atoms : 245 ( 62 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 518 ( 72 ~; 36 |; 0 &; 404 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 78 ( 78 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 200 ( 103 ^ 91 !; 6 ?; 200 :)
% Comments :
%------------------------------------------------------------------------------
thf(h_type,type,
h: ( $i > $o ) > $i ).
thf(sk1_type,type,
sk1: ( $i > $i > $o ) > $i > $o ).
thf(sk2_type,type,
sk2: $i > $i > $o ).
thf(sk3_type,type,
sk3: $i > ( $i > $i > $o ) > $i ).
thf(sk4_type,type,
sk4: $i ).
thf(sk7_type,type,
sk7: $i ).
thf(1,conjecture,
( ! [A: $i > $o,B: $i > $o] :
( ( ( h @ A )
= ( h @ B ) )
=> ( A = B ) )
=> ? [A: $i > $i > $o] :
! [B: $i > $o] :
? [C: $i] :
( ( A @ C )
= B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM573_pme) ).
thf(2,negated_conjecture,
~ ( ! [A: $i > $o,B: $i > $o] :
( ( ( h @ A )
= ( h @ B ) )
=> ( A = B ) )
=> ? [A: $i > $i > $o] :
! [B: $i > $o] :
? [C: $i] :
( ( A @ C )
= B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i > $o,B: $i > $o] :
( ( ( h @ A )
= ( h @ B ) )
=> ( A = B ) )
=> ? [A: $i > $i > $o] :
! [B: $i > $o] :
? [C: $i] :
( ( A @ C )
= B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( h @ A )
!= ( h @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( h @ A )
!= ( h @ B ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(9,plain,
! [A: $i > $o] :
( ( sk2 @ ( h @ A ) )
= A ),
introduced(tautology,[new_symbols(inverse(h),[sk2])]) ).
thf(10,plain,
! [B: $i,A: $i > $o] :
( ( sk2 @ ( h @ A ) @ B )
= ( A @ B ) ),
inference(func_ext,[status(esa)],[9]) ).
thf(4,plain,
! [B: $i,A: $i > $i > $o] :
( ( A @ B )
!= ( sk1 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
! [B: $i,A: $i > $i > $o] :
( ( A @ B )
!= ( sk1 @ A ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
! [B: $i,A: $i > $i > $o] :
( ( A @ B )
!= ( sk1 @ A ) ),
inference(simp,[status(thm)],[6]) ).
thf(11,plain,
! [B: $i,A: $i > $i > $o] :
( ( sk1 @ A @ ( sk3 @ B @ A ) )
!= ( A @ B @ ( sk3 @ B @ A ) ) ),
inference(func_ext,[status(esa)],[7]) ).
thf(14,plain,
! [B: $i,A: $i > $i > $o] :
( ~ ( sk1 @ A @ ( sk3 @ B @ A ) )
| ~ ( A @ B @ ( sk3 @ B @ A ) ) ),
inference(bool_ext,[status(thm)],[11]) ).
thf(18,plain,
! [C: $i > $i > $i,B: $i > $i > $i,A: $i] :
( ~ ( sk1
@ ^ [D: $i,E: $i] : ( sk2 @ ( B @ D @ E ) @ ( C @ D @ E ) )
@ ( sk3 @ A
@ ^ [D: $i,E: $i] : ( sk2 @ ( B @ D @ E ) @ ( C @ D @ E ) ) ) )
| ~ ( sk2
@ ( B @ A
@ ( sk3 @ A
@ ^ [D: $i,E: $i] : ( sk2 @ ( B @ D @ E ) @ ( C @ D @ E ) ) ) )
@ ( C @ A
@ ( sk3 @ A
@ ^ [D: $i,E: $i] : ( sk2 @ ( B @ D @ E ) @ ( C @ D @ E ) ) ) ) ) ),
inference(prim_subst,[status(thm)],[14:[bind(A,$thf( ^ [E: $i] : ^ [F: $i] : ( sk2 @ ( C @ E @ F ) @ ( D @ E @ F ) ) ))]]) ).
thf(28,plain,
! [C: $i > $i > $i,B: $i > $i > $i,A: $i] :
( ~ ( sk1
@ ^ [D: $i,E: $i] : ( sk2 @ ( B @ D @ E ) @ ( C @ D @ E ) )
@ ( sk3 @ A
@ ^ [D: $i,E: $i] : ( sk2 @ ( B @ D @ E ) @ ( C @ D @ E ) ) ) )
| ~ ( sk2
@ ( B @ A
@ ( sk3 @ A
@ ^ [D: $i,E: $i] : ( sk2 @ ( B @ D @ E ) @ ( C @ D @ E ) ) ) )
@ ( C @ A
@ ( sk3 @ A
@ ^ [D: $i,E: $i] : ( sk2 @ ( B @ D @ E ) @ ( C @ D @ E ) ) ) ) ) ),
inference(simp,[status(thm)],[18]) ).
thf(15,plain,
! [B: $i,A: $i > $i > $o] :
( ( sk1 @ A @ ( sk3 @ B @ A ) )
| ( A @ B @ ( sk3 @ B @ A ) ) ),
inference(bool_ext,[status(thm)],[11]) ).
thf(50,plain,
! [A: $i] :
( ( sk1 @ sk2 @ ( sk3 @ A @ sk2 ) )
| ( sk2 @ A @ ( sk3 @ A @ sk2 ) ) ),
inference(prim_subst,[status(thm)],[15:[bind(A,$thf( sk2 ))]]) ).
thf(61,plain,
! [A: $i] :
( ( sk1 @ sk2 @ ( sk3 @ A @ sk2 ) )
| ( sk2 @ A @ ( sk3 @ A @ sk2 ) ) ),
inference(simp,[status(thm)],[50]) ).
thf(12,plain,
! [B: $i,A: $i > $o] :
( ~ ( sk2 @ ( h @ A ) @ B )
| ( A @ B ) ),
inference(bool_ext,[status(thm)],[10]) ).
thf(123,plain,
! [A: $i] :
( ~ ( sk2
@ ( h
@ ^ [B: $i] : $false )
@ A )
| $false ),
inference(prim_subst,[status(thm)],[12:[bind(A,$thf( ^ [C: $i] : $false ))]]) ).
thf(132,plain,
! [A: $i] :
~ ( sk2
@ ( h
@ ^ [B: $i] : $false )
@ A ),
inference(simp,[status(thm)],[123]) ).
thf(193,plain,
! [B: $i,A: $i] :
( ( sk1 @ sk2 @ ( sk3 @ A @ sk2 ) )
| ( ( sk2 @ A @ ( sk3 @ A @ sk2 ) )
!= ( sk2
@ ( h
@ ^ [C: $i] : $false )
@ B ) ) ),
inference(paramod_ordered,[status(thm)],[61,132]) ).
thf(194,plain,
( sk1 @ sk2
@ ( sk3
@ ( h
@ ^ [A: $i] : $false )
@ sk2 ) ),
inference(pattern_uni,[status(thm)],[193:[bind(A,$thf( h @ ^ [C: $i] : $false )),bind(B,$thf( sk3 @ ( h @ ^ [C: $i] : $false ) @ sk2 ))]]) ).
thf(13,plain,
! [B: $i,A: $i > $o] :
( ( sk2 @ ( h @ A ) @ B )
| ~ ( A @ B ) ),
inference(bool_ext,[status(thm)],[10]) ).
thf(236,plain,
! [B: $i,A: $i > $o] :
( ( sk2 @ ( h @ A ) @ B )
| ( ( sk1 @ sk2
@ ( sk3
@ ( h
@ ^ [C: $i] : $false )
@ sk2 ) )
!= ( A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[194,13]) ).
thf(257,plain,
( sk2 @ ( h @ ( sk1 @ sk2 ) )
@ ( sk3
@ ( h
@ ^ [A: $i] : $false )
@ sk2 ) ),
inference(pre_uni,[status(thm)],[236:[bind(A,$thf( sk1 @ sk2 )),bind(B,$thf( sk3 @ ( h @ ^ [C: $i] : $false ) @ sk2 ))]]) ).
thf(340,plain,
! [A: $i] :
( ( sk2 @ ( h @ ( sk1 @ sk2 ) )
@ ( sk3
@ ( h
@ ^ [B: $i] : $false )
@ sk2 ) )
!= ( sk2
@ ( h
@ ^ [B: $i] : $false )
@ A ) ),
inference(paramod_ordered,[status(thm)],[257,132]) ).
thf(341,plain,
! [A: $i] :
( ( ( h @ ( sk1 @ sk2 ) )
!= ( h
@ ^ [B: $i] : $false ) )
| ( ( sk3
@ ( h
@ ^ [B: $i] : $false )
@ sk2 )
!= A ) ),
inference(simp,[status(thm)],[340]) ).
thf(342,plain,
( ( h @ ( sk1 @ sk2 ) )
!= ( h
@ ^ [A: $i] : $false ) ),
inference(simp,[status(thm)],[341]) ).
thf(345,plain,
( ( sk1 @ sk2 )
!= ( ^ [A: $i] : $false ) ),
inference(simp,[status(thm)],[342]) ).
thf(351,plain,
sk1 @ sk2 @ sk4,
inference(func_ext,[status(esa)],[345]) ).
thf(360,plain,
! [B: $i,A: $i > $o] :
( ( sk2 @ ( h @ A ) @ B )
| ( ( sk1 @ sk2 @ sk4 )
!= ( A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[351,13]) ).
thf(366,plain,
sk2 @ ( h @ ( sk1 @ sk2 ) ) @ sk4,
inference(pre_uni,[status(thm)],[360:[bind(A,$thf( sk1 @ sk2 )),bind(B,$thf( sk4 ))]]) ).
thf(381,plain,
! [B: $i,A: $i > $o] :
( ( sk2 @ ( h @ A ) @ B )
| ( ( sk2 @ ( h @ ( sk1 @ sk2 ) ) @ sk4 )
!= ( A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[366,13]) ).
thf(391,plain,
( sk2
@ ( h
@ ^ [A: $i] : ( sk2 @ A @ sk4 ) )
@ ( h @ ( sk1 @ sk2 ) ) ),
inference(pre_uni,[status(thm)],[381:[bind(A,$thf( ^ [C: $i] : ( sk2 @ C @ sk4 ) )),bind(B,$thf( h @ ( sk1 @ sk2 ) ))]]) ).
thf(498,plain,
! [A: $i] :
( ( sk2
@ ( h
@ ^ [B: $i] : ( sk2 @ B @ sk4 ) )
@ ( h @ ( sk1 @ sk2 ) ) )
!= ( sk2
@ ( h
@ ^ [B: $i] : $false )
@ A ) ),
inference(paramod_ordered,[status(thm)],[391,132]) ).
thf(502,plain,
! [A: $i] :
( ( ( h
@ ^ [B: $i] : ( sk2 @ B @ sk4 ) )
!= ( h
@ ^ [B: $i] : $false ) )
| ( ( h @ ( sk1 @ sk2 ) )
!= A ) ),
inference(simp,[status(thm)],[498]) ).
thf(508,plain,
( ( h
@ ^ [A: $i] : ( sk2 @ A @ sk4 ) )
!= ( h
@ ^ [A: $i] : $false ) ),
inference(simp,[status(thm)],[502]) ).
thf(509,plain,
( ( ^ [A: $i] : ( sk2 @ A @ sk4 ) )
!= ( ^ [A: $i] : $false ) ),
inference(simp,[status(thm)],[508]) ).
thf(521,plain,
sk2 @ sk7 @ sk4,
inference(func_ext,[status(esa)],[509]) ).
thf(540,plain,
! [B: $i,A: $i > $o] :
( ( sk2 @ ( h @ A ) @ B )
| ( ( sk2 @ sk7 @ sk4 )
!= ( A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[521,13]) ).
thf(551,plain,
( sk2
@ ( h
@ ^ [A: $i] : ( sk2 @ A @ sk4 ) )
@ sk7 ),
inference(pre_uni,[status(thm)],[540:[bind(A,$thf( ^ [C: $i] : ( sk2 @ C @ sk4 ) )),bind(B,$thf( sk7 ))]]) ).
thf(100,plain,
! [D: $i,C: $i > $i > $o,B: $i > $o,A: $i > $o] :
( ( ( h @ A )
!= ( h @ B ) )
| ( B
!= ( C @ D ) )
| ( A
!= ( sk1 @ C ) ) ),
inference(paramod_ordered,[status(thm)],[8,7]) ).
thf(101,plain,
! [C: $i,B: $i > $i > $o,A: $i > $o] :
( ( ( h @ ( sk1 @ B ) )
!= ( h @ A ) )
| ( A
!= ( B @ C ) ) ),
inference(pattern_uni,[status(thm)],[100:[bind(A,$thf( sk1 @ C )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( D ))]]) ).
thf(109,plain,
! [B: $i,A: $i > $i > $o] :
( ( h @ ( sk1 @ A ) )
!= ( h @ ( A @ B ) ) ),
inference(simp,[status(thm)],[101]) ).
thf(22,plain,
! [A: $i] :
( ~ ( sk1
@ ^ [B: $i,C: $i] : $true
@ ( sk3 @ A
@ ^ [B: $i,C: $i] : $true ) )
| ~ $true ),
inference(prim_subst,[status(thm)],[14:[bind(A,$thf( ^ [C: $i] : ^ [D: $i] : $true ))]]) ).
thf(34,plain,
! [A: $i] :
~ ( sk1
@ ^ [B: $i,C: $i] : $true
@ ( sk3 @ A
@ ^ [B: $i,C: $i] : $true ) ),
inference(simp,[status(thm)],[22]) ).
thf(242,plain,
! [A: $i] :
( ( sk2
@ ( h
@ ^ [B: $i] : $true )
@ A )
| ~ $true ),
inference(prim_subst,[status(thm)],[13:[bind(A,$thf( ^ [C: $i] : $true ))]]) ).
thf(282,plain,
! [A: $i] :
( sk2
@ ( h
@ ^ [B: $i] : $true )
@ A ),
inference(simp,[status(thm)],[242]) ).
thf(361,plain,
! [A: $i] :
( ( sk1 @ sk2 @ sk4 )
!= ( sk1
@ ^ [B: $i,C: $i] : $true
@ ( sk3 @ A
@ ^ [B: $i,C: $i] : $true ) ) ),
inference(paramod_ordered,[status(thm)],[351,34]) ).
thf(364,plain,
! [A: $i] :
( ( sk2
!= ( ^ [B: $i,C: $i] : $true ) )
| ( ( sk3 @ A
@ ^ [B: $i,C: $i] : $true )
!= sk4 ) ),
inference(simp,[status(thm)],[361]) ).
thf(17,plain,
! [B: $i,A: $i > $i > $o] :
( ~ ( A @ B @ ( sk3 @ B @ A ) )
| ( ( sk1 @ A @ ( sk3 @ B @ A ) )
!= ( A @ B @ ( sk3 @ B @ A ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[14]) ).
thf(25,plain,
! [B: $i,A: $i > $i > $o] :
( ~ ( A @ B @ ( sk3 @ B @ A ) )
| ( ( sk1 @ A @ ( sk3 @ B @ A ) )
!= ( A @ B @ ( sk3 @ B @ A ) ) ) ),
inference(simp,[status(thm)],[17]) ).
thf(49,plain,
! [A: $i] :
( ( sk1
@ ^ [B: $i,C: $i] : $false
@ ( sk3 @ A
@ ^ [B: $i,C: $i] : $false ) )
| $false ),
inference(prim_subst,[status(thm)],[15:[bind(A,$thf( ^ [C: $i] : ^ [D: $i] : $false ))]]) ).
thf(60,plain,
! [A: $i] :
( sk1
@ ^ [B: $i,C: $i] : $false
@ ( sk3 @ A
@ ^ [B: $i,C: $i] : $false ) ),
inference(simp,[status(thm)],[49]) ).
thf(542,plain,
! [A: $i] :
( ( sk2
@ ( h
@ ^ [B: $i] : $false )
@ A )
!= ( sk2 @ sk7 @ sk4 ) ),
inference(paramod_ordered,[status(thm)],[521,132]) ).
thf(545,plain,
! [A: $i] :
( ( ( h
@ ^ [B: $i] : $false )
!= sk7 )
| ( A != sk4 ) ),
inference(simp,[status(thm)],[542]) ).
thf(558,plain,
( ( h
@ ^ [A: $i] : $false )
!= sk7 ),
inference(simp,[status(thm)],[545]) ).
thf(72,plain,
! [C: $i,B: $i > $i > $o,A: $i] :
( ~ ( sk1 @ B @ ( sk3 @ C @ B ) )
| ( ( sk1
@ ^ [D: $i,E: $i] : $false
@ ( sk3 @ A
@ ^ [D: $i,E: $i] : $false ) )
!= ( B @ C @ ( sk3 @ C @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[60,14]) ).
thf(76,plain,
! [A: $i] :
~ ( sk1
@ ^ [B: $i,C: $i] :
( sk1
@ ^ [D: $i,E: $i] : $false
@ B )
@ ( sk3
@ ( sk3 @ A
@ ^ [B: $i,C: $i] : $false )
@ ^ [B: $i,C: $i] :
( sk1
@ ^ [D: $i,E: $i] : $false
@ B ) ) ),
inference(pre_uni,[status(thm)],[72:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ^ [E: $i] : ( sk1 @ ^ [F: $i] : ^ [G: $i] : $false @ D ) )),bind(C,$thf( sk3 @ A @ ^ [D: $i] : ^ [E: $i] : $false ))]]) ).
thf(510,plain,
! [A: $i > $o] :
( ( ( h @ A )
!= ( h
@ ^ [B: $i] : $false ) )
| ( ( sk2 @ ( h @ A ) )
!= ( ^ [B: $i] : ( sk2 @ B @ sk4 ) ) ) ),
inference(paramod_ordered,[status(thm)],[9,508]) ).
thf(517,plain,
! [A: $i > $o] :
( ( A
!= ( ^ [B: $i] : $false ) )
| ( ( ^ [B: $i] : ( h @ A ) )
!= ( ^ [B: $i] : B ) )
| ( ( ^ [B: $i] : B )
!= ( ^ [B: $i] : sk4 ) ) ),
inference(simp,[status(thm)],[510]) ).
thf(520,plain,
( ( ( ^ [A: $i] :
( h
@ ^ [B: $i] : $false ) )
!= ( ^ [A: $i] : A ) )
| ( ( ^ [A: $i] : A )
!= ( ^ [A: $i] : sk4 ) ) ),
inference(simp,[status(thm)],[517]) ).
thf(552,plain,
sk2 @ ( h @ ( sk2 @ sk7 ) ) @ sk4,
inference(pre_uni,[status(thm)],[540:[bind(A,$thf( sk2 @ sk7 )),bind(B,$thf( sk4 ))]]) ).
thf(304,plain,
! [B: $i,A: $i] :
( ( sk2
@ ( h
@ ^ [C: $i] : $true )
@ A )
!= ( sk2
@ ( h
@ ^ [C: $i] : $false )
@ B ) ),
inference(paramod_ordered,[status(thm)],[282,132]) ).
thf(309,plain,
! [B: $i,A: $i] :
( ( ( h
@ ^ [C: $i] : $false )
!= ( h
@ ^ [C: $i] : $true ) )
| ( A != B ) ),
inference(simp,[status(thm)],[304]) ).
thf(314,plain,
( ( h
@ ^ [A: $i] : $false )
!= ( h
@ ^ [A: $i] : $true ) ),
inference(simp,[status(thm)],[309]) ).
thf(359,plain,
! [B: $i,A: $i > $i > $o] :
( ~ ( sk1 @ A @ ( sk3 @ B @ A ) )
| ( ( A @ B @ ( sk3 @ B @ A ) )
!= ( sk1 @ sk2 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[351,14]) ).
thf(369,plain,
~ ( sk1
@ ^ [A: $i,B: $i] : ( sk1 @ sk2 @ A )
@ ( sk3 @ sk4
@ ^ [A: $i,B: $i] : ( sk1 @ sk2 @ A ) ) ),
inference(pre_uni,[status(thm)],[359:[bind(A,$thf( ^ [C: $i] : ^ [D: $i] : ( sk1 @ sk2 @ C ) )),bind(B,$thf( sk4 ))]]) ).
thf(710,plain,
$false,
inference(e,[status(thm)],[10,14,28,551,9,109,13,34,282,351,8,364,25,257,61,132,60,366,508,558,391,12,76,7,509,520,345,552,521,3,342,194,11,314,15,369]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU950^5 : TPTP v8.2.0. Released v4.0.0.
% 0.16/0.16 % Command : run_Leo-III %s %d
% 0.17/0.37 % Computer : n002.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Sun May 19 18:05:09 EDT 2024
% 0.17/0.37 % CPUTime :
% 1.07/0.94 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.37/1.04 % [INFO] Parsing done (102ms).
% 1.37/1.05 % [INFO] Running in sequential loop mode.
% 1.75/1.27 % [INFO] eprover registered as external prover.
% 1.75/1.28 % [INFO] cvc4 registered as external prover.
% 1.75/1.28 % [INFO] Scanning for conjecture ...
% 1.96/1.33 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.96/1.35 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.96/1.36 % [INFO] Problem is higher-order (TPTP THF).
% 1.96/1.36 % [INFO] Type checking passed.
% 1.96/1.36 % [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 ...
% 18.04/4.59 % External prover 'e' found a proof!
% 18.04/4.59 % [INFO] Killing All external provers ...
% 18.04/4.59 % Time passed: 4025ms (effective reasoning time: 3536ms)
% 18.04/4.59 % 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)>
% 18.04/4.59 % Axioms used in derivation (0):
% 18.04/4.59 % No. of inferences in proof: 69
% 18.04/4.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4025 ms resp. 3536 ms w/o parsing
% 18.14/4.65 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 18.14/4.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------