TSTP Solution File: SEU895^5 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU895^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n023.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:23 EDT 2024
% Result : Theorem 8.10s 2.48s
% Output : Refutation 8.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 85 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 312 ( 126 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 646 ( 147 ~; 187 |; 21 &; 291 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 63 ( 8 ^ 34 !; 21 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(f_type,type,
f: b > a ).
thf(y_type,type,
y: b > $o ).
thf(x_type,type,
x: b > $o ).
thf(sk1_type,type,
sk1: a ).
thf(sk2_type,type,
sk2: b ).
thf(sk3_type,type,
sk3: b ).
thf(sk4_type,type,
sk4: b ).
thf(1,conjecture,
( ( ^ [A: a] :
? [B: b] :
( ( ( x @ B )
| ( y @ B ) )
& ( A
= ( f @ B ) ) ) )
= ( ^ [A: a] :
( ? [B: b] :
( ( x @ B )
& ( A
= ( f @ B ) ) )
| ? [B: b] :
( ( y @ B )
& ( A
= ( f @ B ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5202_pme) ).
thf(2,negated_conjecture,
( ( ^ [A: a] :
? [B: b] :
( ( ( x @ B )
| ( y @ B ) )
& ( A
= ( f @ B ) ) ) )
!= ( ^ [A: a] :
( ? [B: b] :
( ( x @ B )
& ( A
= ( f @ B ) ) )
| ? [B: b] :
( ( y @ B )
& ( A
= ( f @ B ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ^ [A: a] :
? [B: b] :
( ( ( x @ B )
| ( y @ B ) )
& ( A
= ( f @ B ) ) ) )
!= ( ^ [A: a] :
( ? [B: b] :
( ( x @ B )
& ( A
= ( f @ B ) ) )
| ? [B: b] :
( ( y @ B )
& ( A
= ( f @ B ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a] :
? [B: b] :
( ( ( x @ B )
| ( y @ B ) )
& ( A
= ( f @ B ) ) ) )
!= ( ^ [A: a] :
( ? [B: b] :
( ( x @ B )
& ( A
= ( f @ B ) ) )
| ? [B: b] :
( ( y @ B )
& ( A
= ( f @ B ) ) ) ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( ? [A: b] :
( ( ( x @ A )
| ( y @ A ) )
& ( sk1
= ( f @ A ) ) ) )
!= ( ? [A: b] :
( ( x @ A )
& ( sk1
= ( f @ A ) ) )
| ? [A: b] :
( ( y @ A )
& ( sk1
= ( f @ A ) ) ) ) ),
inference(func_ext,[status(esa)],[4]) ).
thf(7,plain,
( ? [A: b] :
( ( ( x @ A )
| ( y @ A ) )
& ( sk1
= ( f @ A ) ) )
| ? [A: b] :
( ( x @ A )
& ( sk1
= ( f @ A ) ) )
| ? [A: b] :
( ( y @ A )
& ( sk1
= ( f @ A ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(22,plain,
( ( sk1
= ( f @ sk3 ) )
| ( y @ sk4 )
| ( sk1
= ( f @ sk2 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(27,plain,
( ( ( f @ sk3 )
= sk1 )
| ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 ) ),
inference(lifteq,[status(thm)],[22]) ).
thf(35,plain,
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ( ( f @ sk3 )
!= ( f @ sk2 ) )
| ( sk1 != sk1 ) ),
inference(eqfactor_ordered,[status(thm)],[27]) ).
thf(37,plain,
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ( sk3 != sk2 ) ),
inference(simp,[status(thm)],[35]) ).
thf(25,plain,
( ( x @ sk3 )
| ( sk1
= ( f @ sk4 ) )
| ( sk1
= ( f @ sk2 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(32,plain,
( ( ( f @ sk4 )
= sk1 )
| ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 ) ),
inference(lifteq,[status(thm)],[25]) ).
thf(6,plain,
( ~ ? [A: b] :
( ( ( x @ A )
| ( y @ A ) )
& ( sk1
= ( f @ A ) ) )
| ~ ( ? [A: b] :
( ( x @ A )
& ( sk1
= ( f @ A ) ) )
| ? [A: b] :
( ( y @ A )
& ( sk1
= ( f @ A ) ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
! [B: b,A: b] :
( ~ ( y @ B )
| ( sk1
!= ( f @ B ) )
| ~ ( y @ A )
| ( sk1
!= ( f @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(12,plain,
! [B: b,A: b] :
( ( ( f @ B )
!= sk1 )
| ( ( f @ A )
!= sk1 )
| ~ ( y @ B )
| ~ ( y @ A ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(13,plain,
! [B: b,A: b] :
( ( ( f @ B )
!= sk1 )
| ( ( f @ A )
!= sk1 )
| ~ ( y @ B )
| ~ ( y @ A ) ),
inference(simp,[status(thm)],[12]) ).
thf(50,plain,
! [B: b,A: b] :
( ( ( f @ B )
!= sk1 )
| ~ ( y @ B )
| ~ ( y @ A )
| ( ( f @ A )
!= ( f @ B ) )
| ( sk1 != sk1 ) ),
inference(eqfactor_ordered,[status(thm)],[13]) ).
thf(52,plain,
! [A: b] :
( ( ( f @ A )
!= sk1 )
| ~ ( y @ A )
| ~ ( y @ A ) ),
inference(pattern_uni,[status(thm)],[50:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(55,plain,
! [A: b] :
( ( ( f @ A )
!= sk1 )
| ~ ( y @ A ) ),
inference(simp,[status(thm)],[52]) ).
thf(203,plain,
! [A: b] :
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ~ ( y @ A )
| ( ( f @ sk4 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[32,55]) ).
thf(204,plain,
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ~ ( y @ sk4 ) ),
inference(pattern_uni,[status(thm)],[203:[bind(A,$thf( sk4 ))]]) ).
thf(227,plain,
! [A: b] :
( ( x @ sk3 )
| ~ ( y @ sk4 )
| ~ ( y @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[204,55]) ).
thf(228,plain,
( ( x @ sk3 )
| ~ ( y @ sk4 )
| ~ ( y @ sk2 ) ),
inference(pattern_uni,[status(thm)],[227:[bind(A,$thf( sk2 ))]]) ).
thf(59,plain,
! [A: b] :
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ~ ( y @ A )
| ( ( f @ sk3 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[27,55]) ).
thf(60,plain,
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ~ ( y @ sk3 ) ),
inference(pattern_uni,[status(thm)],[59:[bind(A,$thf( sk3 ))]]) ).
thf(11,plain,
! [B: b,A: b] :
( ~ ( x @ B )
| ( sk1
!= ( f @ B ) )
| ~ ( x @ A )
| ( sk1
!= ( f @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(17,plain,
! [B: b,A: b] :
( ( ( f @ B )
!= sk1 )
| ( ( f @ A )
!= sk1 )
| ~ ( x @ B )
| ~ ( x @ A ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(533,plain,
! [B: b,A: b] :
( ( ( f @ B )
!= sk1 )
| ( ( f @ A )
!= sk1 )
| ~ ( x @ B )
| ( ( x @ A )
!= ( x @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[17]) ).
thf(534,plain,
! [A: b] :
( ( ( f @ A )
!= sk1 )
| ( ( f @ A )
!= sk1 )
| ~ ( x @ A ) ),
inference(pattern_uni,[status(thm)],[533:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(544,plain,
! [A: b] :
( ( ( f @ A )
!= sk1 )
| ~ ( x @ A ) ),
inference(simp,[status(thm)],[534]) ).
thf(589,plain,
! [A: b] :
( ( x @ sk3 )
| ~ ( y @ sk4 )
| ~ ( x @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[204,544]) ).
thf(590,plain,
( ( x @ sk3 )
| ~ ( y @ sk4 )
| ~ ( x @ sk2 ) ),
inference(pattern_uni,[status(thm)],[589:[bind(A,$thf( sk2 ))]]) ).
thf(104,plain,
! [A: b] :
( ( y @ sk4 )
| ~ ( y @ sk3 )
| ~ ( y @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[60,55]) ).
thf(105,plain,
( ( y @ sk4 )
| ~ ( y @ sk3 )
| ~ ( y @ sk2 ) ),
inference(pattern_uni,[status(thm)],[104:[bind(A,$thf( sk2 ))]]) ).
thf(250,plain,
( ~ ( y @ sk3 )
| ~ ( y @ sk2 )
| ( x @ sk3 )
| ( ( y @ sk4 )
!= ( y @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[105,228]) ).
thf(251,plain,
( ~ ( y @ sk3 )
| ~ ( y @ sk2 )
| ( x @ sk3 ) ),
inference(pattern_uni,[status(thm)],[250:[]]) ).
thf(216,plain,
( ( ( f @ sk2 )
= sk1 )
| ( sk3 != sk2 )
| ( x @ sk3 )
| ( ( y @ sk4 )
!= ( y @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[37,204]) ).
thf(217,plain,
( ( ( f @ sk2 )
= sk1 )
| ( sk3 != sk2 )
| ( x @ sk3 ) ),
inference(pattern_uni,[status(thm)],[216:[]]) ).
thf(579,plain,
! [A: b] :
( ( sk3 != sk2 )
| ( x @ sk3 )
| ~ ( x @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[217,544]) ).
thf(580,plain,
( ( sk3 != sk2 )
| ( x @ sk3 )
| ~ ( x @ sk2 ) ),
inference(pattern_uni,[status(thm)],[579:[bind(A,$thf( sk2 ))]]) ).
thf(73,plain,
! [A: b] :
( ( y @ sk4 )
| ( sk3 != sk2 )
| ~ ( y @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[37,55]) ).
thf(74,plain,
( ( y @ sk4 )
| ( sk3 != sk2 )
| ~ ( y @ sk2 ) ),
inference(pattern_uni,[status(thm)],[73:[bind(A,$thf( sk2 ))]]) ).
thf(86,plain,
! [A: b] :
( ( sk3 != sk2 )
| ~ ( y @ sk2 )
| ( ( f @ A )
!= sk1 )
| ( ( y @ sk4 )
!= ( y @ A ) ) ),
inference(paramod_ordered,[status(thm)],[74,55]) ).
thf(87,plain,
( ( sk3 != sk2 )
| ~ ( y @ sk2 )
| ( ( f @ sk4 )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[86:[bind(A,$thf( sk4 ))]]) ).
thf(567,plain,
! [A: b] :
( ( y @ sk4 )
| ~ ( y @ sk3 )
| ~ ( x @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[60,544]) ).
thf(568,plain,
( ( y @ sk4 )
| ~ ( y @ sk3 )
| ~ ( x @ sk2 ) ),
inference(pattern_uni,[status(thm)],[567:[bind(A,$thf( sk2 ))]]) ).
thf(19,plain,
( ( x @ sk3 )
| ( y @ sk4 )
| ( sk1
= ( f @ sk2 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(30,plain,
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ( y @ sk4 ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(209,plain,
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ( ( f @ sk4 )
!= ( f @ sk2 ) )
| ( sk1 != sk1 ) ),
inference(eqfactor_ordered,[status(thm)],[32]) ).
thf(211,plain,
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[209]) ).
thf(573,plain,
! [A: b] :
( ( x @ sk3 )
| ( y @ sk4 )
| ~ ( x @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[30,544]) ).
thf(574,plain,
( ( x @ sk3 )
| ( y @ sk4 )
| ~ ( x @ sk2 ) ),
inference(pattern_uni,[status(thm)],[573:[bind(A,$thf( sk2 ))]]) ).
thf(131,plain,
! [A: b] :
( ~ ( y @ sk3 )
| ~ ( y @ sk2 )
| ( ( f @ A )
!= sk1 )
| ( ( y @ sk4 )
!= ( y @ A ) ) ),
inference(paramod_ordered,[status(thm)],[105,55]) ).
thf(132,plain,
( ~ ( y @ sk3 )
| ~ ( y @ sk2 )
| ( ( f @ sk4 )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[131:[bind(A,$thf( sk4 ))]]) ).
thf(18,plain,
( ( x @ sk3 )
| ( sk1
= ( f @ sk4 ) )
| ( x @ sk2 )
| ( y @ sk2 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(28,plain,
( ( ( f @ sk4 )
= sk1 )
| ( x @ sk3 )
| ( x @ sk2 )
| ( y @ sk2 ) ),
inference(lifteq,[status(thm)],[18]) ).
thf(21,plain,
( ( x @ sk3 )
| ( y @ sk4 )
| ( x @ sk2 )
| ( y @ sk2 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(63,plain,
! [A: b] :
( ( x @ sk3 )
| ( y @ sk4 )
| ~ ( y @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[30,55]) ).
thf(64,plain,
( ( x @ sk3 )
| ( y @ sk4 )
| ~ ( y @ sk2 ) ),
inference(pattern_uni,[status(thm)],[63:[bind(A,$thf( sk2 ))]]) ).
thf(561,plain,
! [A: b] :
( ~ ( y @ sk4 )
| ~ ( y @ sk2 )
| ( ( f @ A )
!= sk1 )
| ( ( x @ sk3 )
!= ( x @ A ) ) ),
inference(paramod_ordered,[status(thm)],[228,544]) ).
thf(562,plain,
( ~ ( y @ sk4 )
| ~ ( y @ sk2 )
| ( ( f @ sk3 )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[561:[bind(A,$thf( sk3 ))]]) ).
thf(222,plain,
( ( ( f @ sk2 )
= sk1 )
| ~ ( y @ sk3 )
| ( x @ sk3 )
| ( ( y @ sk4 )
!= ( y @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[60,204]) ).
thf(223,plain,
( ( ( f @ sk2 )
= sk1 )
| ~ ( y @ sk3 )
| ( x @ sk3 ) ),
inference(pattern_uni,[status(thm)],[222:[]]) ).
thf(240,plain,
( ( ( f @ sk3 )
= sk1 )
| ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ( ( y @ sk4 )
!= ( y @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[27,204]) ).
thf(241,plain,
( ( ( f @ sk3 )
= sk1 )
| ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 ) ),
inference(pattern_uni,[status(thm)],[240:[]]) ).
thf(303,plain,
! [A: b] :
( ( x @ sk3 )
| ( sk4 != sk2 )
| ~ ( y @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[211,55]) ).
thf(304,plain,
( ( x @ sk3 )
| ( sk4 != sk2 )
| ~ ( y @ sk2 ) ),
inference(pattern_uni,[status(thm)],[303:[bind(A,$thf( sk2 ))]]) ).
thf(20,plain,
( ( sk1
= ( f @ sk3 ) )
| ( y @ sk4 )
| ( x @ sk2 )
| ( y @ sk2 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(26,plain,
( ( ( f @ sk3 )
= sk1 )
| ( y @ sk4 )
| ( x @ sk2 )
| ( y @ sk2 ) ),
inference(lifteq,[status(thm)],[20]) ).
thf(563,plain,
! [A: b] :
( ( x @ sk3 )
| ( sk4 != sk2 )
| ~ ( x @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[211,544]) ).
thf(564,plain,
( ( x @ sk3 )
| ( sk4 != sk2 )
| ~ ( x @ sk2 ) ),
inference(pattern_uni,[status(thm)],[563:[bind(A,$thf( sk2 ))]]) ).
thf(253,plain,
( ( sk3 != sk2 )
| ~ ( y @ sk2 )
| ( x @ sk3 )
| ( ( y @ sk4 )
!= ( y @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[74,228]) ).
thf(254,plain,
( ( sk3 != sk2 )
| ~ ( y @ sk2 )
| ( x @ sk3 ) ),
inference(pattern_uni,[status(thm)],[253:[]]) ).
thf(559,plain,
! [A: b] :
( ( y @ sk4 )
| ( sk3 != sk2 )
| ~ ( x @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[37,544]) ).
thf(560,plain,
( ( y @ sk4 )
| ( sk3 != sk2 )
| ~ ( x @ sk2 ) ),
inference(pattern_uni,[status(thm)],[559:[bind(A,$thf( sk2 ))]]) ).
thf(1074,plain,
$false,
inference(e,[status(thm)],[37,228,60,590,105,251,580,544,87,568,30,217,5,211,574,132,74,28,21,32,64,562,204,27,223,3,241,304,26,55,564,4,254,560]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU895^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 17:29:54 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.86/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/0.94 % [INFO] Parsing done (95ms).
% 1.20/0.95 % [INFO] Running in sequential loop mode.
% 1.49/1.14 % [INFO] eprover registered as external prover.
% 1.49/1.14 % [INFO] cvc4 registered as external prover.
% 1.49/1.14 % [INFO] Scanning for conjecture ...
% 1.76/1.20 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.76/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.76/1.22 % [INFO] Problem is higher-order (TPTP THF).
% 1.76/1.22 % [INFO] Type checking passed.
% 1.76/1.22 % [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 ...
% 8.10/2.47 % External prover 'e' found a proof!
% 8.10/2.47 % [INFO] Killing All external provers ...
% 8.10/2.47 % Time passed: 1967ms (effective reasoning time: 1525ms)
% 8.10/2.47 % 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)>
% 8.10/2.48 % Axioms used in derivation (0):
% 8.10/2.48 % No. of inferences in proof: 76
% 8.10/2.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1967 ms resp. 1525 ms w/o parsing
% 8.10/2.51 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.10/2.51 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------