%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU895^5 : TPTP v9.3.1. Released v4.0.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 : n006.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 : Wed Sep 30 08:29:32 AM UTC 2026
% Result : Theorem 7.49s 2.14s
% Output : Refutation 6.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 41
% Number of leaves : 4
% Syntax : Number of formulae : 72 ( 12 unt; 0 typ; 3 def)
% Number of atoms : 314 ( 162 equ; 0 cnn)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 625 ( 126 ~; 173 |; 34 &; 292 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 8 ^; 35 !; 21 ?; 67 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(f_decl,type,
f: b > a ).
thf(y_decl,type,
y: b > $o ).
thf(x_decl,type,
x: b > $o ).
thf(sk1_decl,type,
sk1: a ).
thf(sk2_decl,type,
sk2: b ).
thf(sk3_decl,type,
sk3: b ).
thf(sk4_decl,type,
sk4: b ).
thf(sk2_def,definition,
( sk2
= ( @+[A: b] :
( ( ( x @ A )
| ( y @ A ) )
& ( sk1
= ( f @ A ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: b] :
( ( x @ A )
& ( sk1
= ( f @ A ) ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( @+[A: b] :
( ( y @ A )
& ( sk1
= ( f @ A ) ) ) ) ) ).
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(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,
! [C: b,B: b,A: b] :
( ( ~ ( x @ A )
| ( sk1
!= ( f @ A ) )
| ~ ( x @ B )
| ( sk1
!= ( f @ B ) ) )
& ( ~ ( x @ A )
| ( sk1
!= ( f @ A ) )
| ~ ( y @ C )
| ( sk1
!= ( f @ C ) ) )
& ( ~ ( y @ A )
| ( sk1
!= ( f @ A ) )
| ~ ( x @ B )
| ( sk1
!= ( f @ B ) ) )
& ( ~ ( y @ A )
| ( sk1
!= ( f @ A ) )
| ~ ( y @ C )
| ( sk1
!= ( f @ C ) ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(12,plain,
! [B: b,A: b] :
( ~ ( y @ A )
| ( sk1
!= ( f @ A ) )
| ~ ( y @ B )
| ( sk1
!= ( f @ B ) ) ),
inference(cnfConj,[status(thm)],[8]) ).
thf(17,plain,
! [B: b,A: b] :
( ( ( f @ A )
!= sk1 )
| ( ( f @ B )
!= sk1 )
| ~ ( y @ A )
| ~ ( y @ B ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(18,plain,
! [B: b,A: b] :
( ( ( f @ A )
!= sk1 )
| ( ( f @ B )
!= sk1 )
| ~ ( y @ A )
| ~ ( y @ B ) ),
inference(simp,[status(thm)],[17]) ).
thf(164,plain,
! [B: b,A: b] :
( ( ( f @ A )
!= sk1 )
| ~ ( y @ A )
| ~ ( y @ B )
| ( ( f @ B )
!= ( f @ A ) )
| ( sk1 != sk1 ) ),
inference(eqfactor_ordered,[status(thm)],[18]) ).
thf(166,plain,
! [A: b] :
( ( ( f @ A )
!= sk1 )
| ~ ( y @ A )
| ~ ( y @ A ) ),
inference(pattern_uni,[status(thm)],[164:[bind(A,$thf( B ))]]) ).
thf(169,plain,
! [A: b] :
( ( ( f @ A )
!= sk1 )
| ~ ( y @ A ) ),
inference(simp,[status(thm)],[166]) ).
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(19,plain,
( ( ( x @ sk2 )
| ( y @ sk2 )
| ( x @ sk3 )
| ( y @ sk4 ) )
& ( ( x @ sk2 )
| ( y @ sk2 )
| ( x @ sk3 )
| ( sk1
= ( f @ sk4 ) ) )
& ( ( x @ sk2 )
| ( y @ sk2 )
| ( sk1
= ( f @ sk3 ) )
| ( y @ sk4 ) )
& ( ( x @ sk2 )
| ( y @ sk2 )
| ( sk1
= ( f @ sk3 ) )
| ( sk1
= ( f @ sk4 ) ) )
& ( ( sk1
= ( f @ sk2 ) )
| ( x @ sk3 )
| ( y @ sk4 ) )
& ( ( sk1
= ( f @ sk2 ) )
| ( x @ sk3 )
| ( sk1
= ( f @ sk4 ) ) )
& ( ( sk1
= ( f @ sk2 ) )
| ( sk1
= ( f @ sk3 ) )
| ( y @ sk4 ) )
& ( ( sk1
= ( f @ sk2 ) )
| ( sk1
= ( f @ sk3 ) )
| ( sk1
= ( f @ sk4 ) ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(25,plain,
( ( sk1
= ( f @ sk2 ) )
| ( sk1
= ( f @ sk3 ) )
| ( sk1
= ( f @ sk4 ) ) ),
inference(cnfConj,[status(thm)],[19]) ).
thf(31,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk3 )
= sk1 )
| ( ( f @ sk4 )
= sk1 ) ),
inference(lifteq,[status(thm)],[25]) ).
thf(21,plain,
( ( sk1
= ( f @ sk2 ) )
| ( x @ sk3 )
| ( y @ sk4 ) ),
inference(cnfConj,[status(thm)],[19]) ).
thf(29,plain,
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ( y @ sk4 ) ),
inference(lifteq,[status(thm)],[21]) ).
thf(24,plain,
( ( sk1
= ( f @ sk2 ) )
| ( sk1
= ( f @ sk3 ) )
| ( y @ sk4 ) ),
inference(cnfConj,[status(thm)],[19]) ).
thf(30,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk3 )
= sk1 )
| ( y @ sk4 ) ),
inference(lifteq,[status(thm)],[24]) ).
thf(9,plain,
! [B: b,A: b] :
( ~ ( x @ A )
| ( sk1
!= ( f @ A ) )
| ~ ( x @ B )
| ( sk1
!= ( f @ B ) ) ),
inference(cnfConj,[status(thm)],[8]) ).
thf(13,plain,
! [B: b,A: b] :
( ( ( f @ A )
!= sk1 )
| ( ( f @ B )
!= sk1 )
| ~ ( x @ A )
| ~ ( x @ B ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(61,plain,
! [B: b,A: b] :
( ( ( f @ A )
!= sk1 )
| ( ( f @ B )
!= sk1 )
| ~ ( x @ A )
| ( ( x @ B )
!= ( x @ A ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[13]) ).
thf(62,plain,
! [A: b] :
( ( ( f @ A )
!= sk1 )
| ( ( f @ A )
!= sk1 )
| ~ ( x @ A ) ),
inference(pattern_uni,[status(thm)],[61:[bind(A,$thf( B ))]]) ).
thf(67,plain,
! [A: b] :
( ( ( f @ A )
!= sk1 )
| ~ ( x @ A ) ),
inference(simp,[status(thm)],[62]) ).
thf(75,plain,
! [A: b] :
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ( sk1 != sk1 )
| ~ ( x @ A )
| ( ( f @ sk3 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[30,67]) ).
thf(76,plain,
! [A: b] :
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ~ ( x @ A )
| ( ( f @ sk3 )
!= ( f @ A ) ) ),
inference(simp,[status(thm)],[75]) ).
thf(77,plain,
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ~ ( x @ sk3 ) ),
inference(pattern_uni,[status(thm)],[76:[bind(A,$thf( sk3 ))]]) ).
thf(127,plain,
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ~ $true
| ( ( x @ sk3 )
!= ( x @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[29,77]) ).
thf(128,plain,
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 )
| ( ( x @ sk3 )
!= ( x @ sk3 ) ) ),
inference(simp,[status(thm)],[127]) ).
thf(129,plain,
( ( ( f @ sk2 )
= sk1 )
| ( y @ sk4 ) ),
inference(pattern_uni,[status(thm)],[128:[]]) ).
thf(237,plain,
! [A: b] :
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ A )
!= sk1 )
| ~ $true
| ( ( y @ sk4 )
!= ( y @ A ) ) ),
inference(paramod_ordered,[status(thm)],[129,169]) ).
thf(238,plain,
! [A: b] :
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ A )
!= sk1 )
| ( ( y @ sk4 )
!= ( y @ A ) ) ),
inference(simp,[status(thm)],[237]) ).
thf(239,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk4 )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[238:[bind(A,$thf( sk4 ))]]) ).
thf(363,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk3 )
= sk1 )
| ( ( f @ sk2 )
= sk1 )
| ( sk1 != sk1 )
| ( ( f @ sk4 )
!= ( f @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[31,239]) ).
thf(364,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk3 )
= sk1 )
| ( ( f @ sk4 )
!= ( f @ sk4 ) ) ),
inference(simp,[status(thm)],[363]) ).
thf(365,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk3 )
= sk1 ) ),
inference(pattern_uni,[status(thm)],[364:[]]) ).
thf(27,plain,
( ( sk1
= ( f @ sk2 ) )
| ( x @ sk3 )
| ( sk1
= ( f @ sk4 ) ) ),
inference(cnfConj,[status(thm)],[19]) ).
thf(33,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk4 )
= sk1 )
| ( x @ sk3 ) ),
inference(lifteq,[status(thm)],[27]) ).
thf(275,plain,
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ( ( f @ sk2 )
= sk1 )
| ( sk1 != sk1 )
| ( ( f @ sk4 )
!= ( f @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[33,239]) ).
thf(276,plain,
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 )
| ( ( f @ sk4 )
!= ( f @ sk4 ) ) ),
inference(simp,[status(thm)],[275]) ).
thf(277,plain,
( ( ( f @ sk2 )
= sk1 )
| ( x @ sk3 ) ),
inference(pattern_uni,[status(thm)],[276:[]]) ).
thf(297,plain,
! [A: b] :
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ A )
!= sk1 )
| ~ $true
| ( ( x @ sk3 )
!= ( x @ A ) ) ),
inference(paramod_ordered,[status(thm)],[277,67]) ).
thf(298,plain,
! [A: b] :
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ A )
!= sk1 )
| ( ( x @ sk3 )
!= ( x @ A ) ) ),
inference(simp,[status(thm)],[297]) ).
thf(299,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk3 )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[298:[bind(A,$thf( sk3 ))]]) ).
thf(443,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk2 )
= sk1 )
| ( sk1 != sk1 )
| ( ( f @ sk3 )
!= ( f @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[365,299]) ).
thf(444,plain,
( ( ( f @ sk2 )
= sk1 )
| ( ( f @ sk3 )
!= ( f @ sk3 ) ) ),
inference(simp,[status(thm)],[443]) ).
thf(445,plain,
( ( f @ sk2 )
= sk1 ),
inference(pattern_uni,[status(thm)],[444:[]]) ).
thf(474,plain,
! [A: b] :
( ( sk1 != sk1 )
| ~ ( x @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[445,67]) ).
thf(475,plain,
! [A: b] :
( ~ ( x @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(simp,[status(thm)],[474]) ).
thf(476,plain,
~ ( x @ sk2 ),
inference(pattern_uni,[status(thm)],[475:[bind(A,$thf( sk2 ))]]) ).
thf(22,plain,
( ( x @ sk2 )
| ( y @ sk2 )
| ( sk1
= ( f @ sk3 ) )
| ( y @ sk4 ) ),
inference(cnfConj,[status(thm)],[19]) ).
thf(32,plain,
( ( ( f @ sk3 )
= sk1 )
| ( x @ sk2 )
| ( y @ sk2 )
| ( y @ sk4 ) ),
inference(lifteq,[status(thm)],[22]) ).
thf(471,plain,
! [A: b] :
( ( sk1 != sk1 )
| ~ ( y @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[445,169]) ).
thf(472,plain,
! [A: b] :
( ~ ( y @ A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(simp,[status(thm)],[471]) ).
thf(473,plain,
~ ( y @ sk2 ),
inference(pattern_uni,[status(thm)],[472:[bind(A,$thf( sk2 ))]]) ).
thf(486,plain,
( ( ( f @ sk3 )
= sk1 )
| $false
| $false
| ( y @ sk4 ) ),
inference(rewrite,[status(thm)],[32,473,476]) ).
thf(487,plain,
( ( ( f @ sk3 )
= sk1 )
| ( y @ sk4 ) ),
inference(simp,[status(thm)],[486]) ).
thf(488,plain,
! [A: b] :
( ( y @ sk4 )
| ( sk1 != sk1 )
| ~ ( y @ A )
| ( ( f @ sk3 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[487,169]) ).
thf(489,plain,
! [A: b] :
( ( y @ sk4 )
| ~ ( y @ A )
| ( ( f @ sk3 )
!= ( f @ A ) ) ),
inference(simp,[status(thm)],[488]) ).
thf(490,plain,
( ( y @ sk4 )
| ~ ( y @ sk3 ) ),
inference(pattern_uni,[status(thm)],[489:[bind(A,$thf( sk3 ))]]) ).
thf(507,plain,
! [A: b] :
( ~ ( y @ sk3 )
| ( ( f @ A )
!= sk1 )
| ~ $true
| ( ( y @ sk4 )
!= ( y @ A ) ) ),
inference(paramod_ordered,[status(thm)],[490,169]) ).
thf(508,plain,
! [A: b] :
( ~ ( y @ sk3 )
| ( ( f @ A )
!= sk1 )
| ( ( y @ sk4 )
!= ( y @ A ) ) ),
inference(simp,[status(thm)],[507]) ).
thf(509,plain,
( ~ ( y @ sk3 )
| ( ( f @ sk4 )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[508:[bind(A,$thf( sk4 ))]]) ).
thf(510,plain,
( ~ ( y @ sk3 )
| ~ $true
| ( ( y @ sk4 )
!= ( y @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[490,473]) ).
thf(511,plain,
( ~ ( y @ sk3 )
| ( ( y @ sk4 )
!= ( y @ sk2 ) ) ),
inference(simp,[status(thm)],[510]) ).
thf(516,plain,
( ~ ( y @ sk3 )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[511]) ).
thf(595,plain,
$false,
inference(e,[status(thm)],[5,169,476,445,509,3,67,4,473,490,487,516]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU895^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % 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.09/0.19 % Computer : n006.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 14:44:09 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 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.66/0.48 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.89/0.57 % [INFO] Parsing done (92ms).
% 0.89/0.58 % [INFO] Running in sequential loop mode.
% 1.15/0.76 % [INFO] eprover registered as external prover.
% 1.15/0.77 % [INFO] Scanning for conjecture ...
% 1.38/0.81 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.38/0.83 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.38/0.83 % [INFO] Problem is higher-order (TPTP THF).
% 1.38/0.83 % [INFO] Type checking passed.
% 1.38/0.83 % [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 ...
% 7.49/2.14 % External prover 'e' found a proof!
% 7.49/2.14 % [INFO] Killing All external provers ...
% 7.49/2.14 % Time passed: 1869ms (effective reasoning time: 1558ms)
% 7.49/2.14 % 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)>
% 7.49/2.14 % Axioms used in derivation (0):
% 7.49/2.14 % No. of inferences in proof: 69
% 7.49/2.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1869 ms resp. 1558 ms w/o parsing
% 6.78/2.20 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.78/2.20 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------