TSTP Solution File: SEV300^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV300^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% 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 15:58:44 EDT 2024
% Result : Theorem 13.84s 4.11s
% Output : Refutation 13.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 2
% Syntax : Number of formulae : 75 ( 9 unt; 0 typ; 1 def)
% Number of atoms : 364 ( 212 equ; 46 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 548 ( 159 ~; 94 |; 42 &; 247 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 91 ( 16 ^ 34 !; 41 ?; 91 :)
% Comments :
%------------------------------------------------------------------------------
thf(cONE_type,type,
cONE: ( $i > $o ) > $o ).
thf(cONE_def,definition,
( cONE
= ( cSUCC @ cZERO ) ) ).
thf(sk1_type,type,
sk1: ( $i > $i ) > ( $i > $i ) > $i ).
thf(sk2_type,type,
sk2: $i > $o ).
thf(sk3_type,type,
sk3: $i > $o ).
thf(sk4_type,type,
sk4: $i ).
thf(sk5_type,type,
sk5: $i > $i ).
thf(sk6_type,type,
sk6: $i ).
thf(sk7_type,type,
sk7: $i > $i ).
thf(sk8_type,type,
sk8: $i ).
thf(sk11_type,type,
sk11: $i ).
thf(sk12_type,type,
sk12: $i ).
thf(sk13_type,type,
sk13: $i ).
thf(sk14_type,type,
sk14: $i ).
thf(1,conjecture,
( ! [A: $i > $i,B: $i > $i] :
( ! [C: $i] :
( ( A @ C )
= ( B @ C ) )
=> ( A = B ) )
=> ( cONE
= ( ^ [A: $i > $o] :
? [B: $i] :
( A
= ( (=) @ $i @ B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX6101_EXT_pme) ).
thf(2,negated_conjecture,
~ ( ! [A: $i > $i,B: $i > $i] :
( ! [C: $i] :
( ( A @ C )
= ( B @ C ) )
=> ( A = B ) )
=> ( cONE
= ( ^ [A: $i > $o] :
? [B: $i] :
( A
= ( (=) @ $i @ B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i > $i,B: $i > $i] :
( ! [C: $i] :
( ( A @ C )
= ( B @ C ) )
=> ( A = B ) )
=> ( ( ^ [A: $i > $o] :
? [B: $i] :
( ( A @ B )
& ~ ? [C: $i] :
( ( C != B )
& ( A @ C ) ) ) )
= ( ^ [A: $i > $o] :
? [B: $i] :
( A
= ( (=) @ $i @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: $i > $o] :
? [B: $i] :
( ( A @ B )
& ~ ? [C: $i] :
( ( C != B )
& ( A @ C ) ) ) )
!= ( ^ [A: $i > $o] :
? [B: $i] :
( A
= ( (=) @ $i @ B ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
( ( ^ [A: $i > $o] :
? [B: $i] :
( ( A @ B )
& ~ ? [C: $i] :
( ( C != B )
& ( A @ C ) ) ) )
!= ( ^ [A: $i > $o] :
? [B: $i] :
( A
= ( (=) @ $i @ B ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(8,plain,
( ( ^ [A: $i > $o,B: $i] :
( ( A @ B )
& ~ ? [C: $i] :
( ( C != B )
& ( A @ C ) ) ) )
!= ( ^ [A: $i > $o,B: $i] :
( A
= ( (=) @ $i @ B ) ) ) ),
inference(simp,[status(thm)],[6]) ).
thf(10,plain,
( ( ( sk3 @ sk4 )
& ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) ),
inference(func_ext,[status(esa)],[8]) ).
thf(23,plain,
( ( ( sk3 @ sk4 )
& ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) )
| ( sk3
= ( (=) @ $i @ sk4 ) ) ),
inference(bool_ext,[status(thm)],[10]) ).
thf(25,plain,
( ( sk3
= ( (=) @ $i @ sk4 ) )
| ( ( sk3 @ sk4 )
& ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) ) ),
inference(lifteq,[status(thm)],[23]) ).
thf(30,plain,
( ( sk3 @ sk4 )
| ( sk3
= ( (=) @ $i @ sk4 ) ) ),
inference(cnf,[status(esa)],[25]) ).
thf(32,plain,
( ( sk3
= ( (=) @ $i @ sk4 ) )
| ( ( ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) )
| ( ( sk3 @ sk4 )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[30,10]) ).
thf(33,plain,
( ( sk3
= ( (=) @ $i @ sk4 ) )
| ( ( ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) ) ),
inference(pattern_uni,[status(thm)],[32:[]]) ).
thf(51,plain,
! [A: $i] :
( ( ( sk3 @ A )
= ( sk4 = A ) )
| ( ( ~ ? [B: $i] :
( ( B != sk4 )
& ( sk3 @ B ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) ) ),
inference(func_ext,[status(esa)],[33]) ).
thf(71,plain,
! [A: $i] :
( ( ( ~ ? [B: $i] :
( ( B != sk4 )
& ( sk3 @ B ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) )
| ( ( ( sk4 = A )
& ~ ? [B: $i] :
( ( B != sk4 )
& ( sk3 @ B ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) )
| ( ( sk3 @ A )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[51,10]) ).
thf(72,plain,
( ( ( ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) )
| ( ( ( sk4 = sk4 )
& ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) ) ),
inference(pattern_uni,[status(thm)],[71:[bind(A,$thf( sk4 ))]]) ).
thf(97,plain,
( ( ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) ),
inference(simp,[status(thm)],[72]) ).
thf(111,plain,
( ~ ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(bool_ext,[status(thm)],[97]) ).
thf(116,plain,
( ( sk3
!= ( (=) @ $i @ sk4 ) )
| ~ ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) ),
inference(lifteq,[status(thm)],[111]) ).
thf(123,plain,
( ( sk12 != sk4 )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(cnf,[status(esa)],[116]) ).
thf(124,plain,
( ( sk12 != sk4 )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(lifteq,[status(thm)],[123]) ).
thf(137,plain,
( ( ( sk3 @ sk13 )
!= ( sk4 = sk13 ) )
| ( sk12 != sk4 ) ),
inference(func_ext,[status(esa)],[124]) ).
thf(141,plain,
( ( sk12 != sk4 )
| ( sk3 @ sk13 )
| ( sk4 = sk13 ) ),
inference(bool_ext,[status(thm)],[137]) ).
thf(146,plain,
( ( sk13 = sk4 )
| ( sk12 != sk4 )
| ( sk3 @ sk13 ) ),
inference(lifteq,[status(thm)],[141]) ).
thf(138,plain,
( ( sk3 @ sk4 )
| ( sk12 != sk4 )
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[30,124]) ).
thf(139,plain,
( ( sk3 @ sk4 )
| ( sk12 != sk4 ) ),
inference(pattern_uni,[status(thm)],[138:[]]) ).
thf(140,plain,
( ( sk12 != sk4 )
| ~ ( sk3 @ sk13 )
| ( sk4 != sk13 ) ),
inference(bool_ext,[status(thm)],[137]) ).
thf(148,plain,
( ( sk13 != sk4 )
| ( sk12 != sk4 )
| ~ ( sk3 @ sk13 ) ),
inference(lifteq,[status(thm)],[140]) ).
thf(210,plain,
( ( sk12 != sk4 )
| ( sk13 != sk4 )
| ( ( sk3 @ sk13 )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[139,148]) ).
thf(221,plain,
( ( sk12 != sk4 )
| ( sk13 != sk4 )
| ( sk13 != sk4 ) ),
inference(simp,[status(thm)],[210]) ).
thf(224,plain,
( ( sk12 != sk4 )
| ( sk13 != sk4 ) ),
inference(simp,[status(thm)],[221]) ).
thf(233,plain,
( ( sk12 != sk4 )
| ( sk3 @ sk13 )
| ( sk13 != sk13 ) ),
inference(paramod_ordered,[status(thm)],[146,224]) ).
thf(234,plain,
( ( sk12 != sk4 )
| ( sk3 @ sk13 ) ),
inference(pattern_uni,[status(thm)],[233:[]]) ).
thf(122,plain,
( ( sk3 @ sk12 )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(cnf,[status(esa)],[116]) ).
thf(174,plain,
( ( ( sk3 @ sk14 )
!= ( sk4 = sk14 ) )
| ( sk3 @ sk12 ) ),
inference(func_ext,[status(esa)],[122]) ).
thf(9,plain,
( ( ? [A: $i] :
( ( sk2 @ A )
& ~ ? [B: $i] :
( ( B != A )
& ( sk2 @ B ) ) ) )
!= ( ? [A: $i] :
( sk2
= ( (=) @ $i @ A ) ) ) ),
inference(func_ext,[status(esa)],[6]) ).
thf(13,plain,
( ? [A: $i] :
( ( sk2 @ A )
& ~ ? [B: $i] :
( ( B != A )
& ( sk2 @ B ) ) )
| ? [A: $i] :
( sk2
= ( (=) @ $i @ A ) ) ),
inference(bool_ext,[status(thm)],[9]) ).
thf(18,plain,
! [A: $i] :
( ( sk2
= ( (=) @ $i @ ( sk7 @ A ) ) )
| ( A = sk6 )
| ~ ( sk2 @ A ) ),
inference(cnf,[status(esa)],[13]) ).
thf(20,plain,
! [A: $i] :
( ( sk2
= ( (=) @ $i @ ( sk7 @ A ) ) )
| ( A = sk6 )
| ~ ( sk2 @ A ) ),
inference(lifteq,[status(thm)],[18]) ).
thf(113,plain,
( ( sk3 @ sk4 )
| ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) )
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[30,97]) ).
thf(114,plain,
( ( sk3 @ sk4 )
| ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) ),
inference(pattern_uni,[status(thm)],[113:[]]) ).
thf(120,plain,
( ( sk11 != sk4 )
| ( sk3 @ sk4 ) ),
inference(cnf,[status(esa)],[114]) ).
thf(121,plain,
( ( sk11 != sk4 )
| ( sk3 @ sk4 ) ),
inference(lifteq,[status(thm)],[120]) ).
thf(279,plain,
( ( sk3 @ sk12 )
| ~ ( sk3 @ sk14 )
| ( sk4 != sk14 ) ),
inference(bool_ext,[status(thm)],[174]) ).
thf(293,plain,
( ( sk14 != sk4 )
| ( sk3 @ sk12 )
| ~ ( sk3 @ sk14 ) ),
inference(lifteq,[status(thm)],[279]) ).
thf(12,plain,
( ~ ? [A: $i] :
( ( sk2 @ A )
& ~ ? [B: $i] :
( ( B != A )
& ( sk2 @ B ) ) )
| ~ ? [A: $i] :
( sk2
= ( (=) @ $i @ A ) ) ),
inference(bool_ext,[status(thm)],[9]) ).
thf(15,plain,
! [B: $i,A: $i] :
( ( sk2
!= ( (=) @ $i @ B ) )
| ~ ( sk2 @ A )
| ( sk2 @ ( sk5 @ A ) ) ),
inference(cnf,[status(esa)],[12]) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( sk2
!= ( (=) @ $i @ B ) )
| ~ ( sk2 @ A )
| ( sk2 @ ( sk5 @ A ) ) ),
inference(lifteq,[status(thm)],[15]) ).
thf(5,plain,
! [B: $i > $i,A: $i > $i] :
( ( ( A @ ( sk1 @ B @ A ) )
!= ( B @ ( sk1 @ B @ A ) ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [B: $i > $i,A: $i > $i] :
( ( ( A @ ( sk1 @ B @ A ) )
!= ( B @ ( sk1 @ B @ A ) ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(22,plain,
( ~ ( ( sk3 @ sk4 )
& ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(bool_ext,[status(thm)],[10]) ).
thf(24,plain,
( ( sk3
!= ( (=) @ $i @ sk4 ) )
| ~ ( ( sk3 @ sk4 )
& ~ ? [A: $i] :
( ( A != sk4 )
& ( sk3 @ A ) ) ) ),
inference(lifteq,[status(thm)],[22]) ).
thf(26,plain,
( ~ ( sk3 @ sk4 )
| ( sk8 != sk4 )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(cnf,[status(esa)],[24]) ).
thf(28,plain,
( ( sk8 != sk4 )
| ~ ( sk3 @ sk4 )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(lifteq,[status(thm)],[26]) ).
thf(154,plain,
( ( sk11 != sk4 )
| ( sk8 != sk4 )
| ( sk3
!= ( (=) @ $i @ sk4 ) )
| ( ( sk3 @ sk4 )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[121,28]) ).
thf(155,plain,
( ( sk11 != sk4 )
| ( sk8 != sk4 )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(pattern_uni,[status(thm)],[154:[]]) ).
thf(11,plain,
( ( ^ [A: $i] :
( ( sk2 @ A )
& ~ ? [B: $i] :
( ( B != A )
& ( sk2 @ B ) ) ) )
!= ( ^ [A: $i] :
( sk2
= ( (=) @ $i @ A ) ) ) ),
inference(simp,[status(thm)],[9]) ).
thf(177,plain,
( ( sk3 @ sk4 )
| ( sk3 @ sk12 )
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[30,122]) ).
thf(178,plain,
( ( sk3 @ sk4 )
| ( sk3 @ sk12 ) ),
inference(pattern_uni,[status(thm)],[177:[]]) ).
thf(189,plain,
( ( sk3 @ sk4 )
| ( ( sk3 @ sk12 )
!= ( sk3 @ sk4 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[178]) ).
thf(192,plain,
( ( sk3 @ sk4 )
| ( ( sk3 @ sk12 )
!= ( sk3 @ sk4 ) ) ),
inference(simp,[status(thm)],[189]) ).
thf(19,plain,
! [A: $i] :
( ( sk2
= ( (=) @ $i @ ( sk7 @ A ) ) )
| ( sk2 @ sk6 ) ),
inference(cnf,[status(esa)],[13]) ).
thf(21,plain,
! [A: $i] :
( ( sk2
= ( (=) @ $i @ ( sk7 @ A ) ) )
| ( sk2 @ sk6 ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(280,plain,
( ( sk3 @ sk12 )
| ( sk3 @ sk14 )
| ( sk4 = sk14 ) ),
inference(bool_ext,[status(thm)],[174]) ).
thf(291,plain,
( ( sk14 = sk4 )
| ( sk3 @ sk12 )
| ( sk3 @ sk14 ) ),
inference(lifteq,[status(thm)],[280]) ).
thf(27,plain,
( ~ ( sk3 @ sk4 )
| ( sk3 @ sk8 )
| ( sk3
!= ( (=) @ $i @ sk4 ) ) ),
inference(cnf,[status(esa)],[24]) ).
thf(119,plain,
( ( sk3 @ sk11 )
| ( sk3 @ sk4 ) ),
inference(cnf,[status(esa)],[114]) ).
thf(131,plain,
( ( sk3 @ sk4 )
| ( ( sk3 @ sk11 )
!= ( sk3 @ sk4 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[119]) ).
thf(135,plain,
( ( sk3 @ sk4 )
| ( ( sk3 @ sk11 )
!= ( sk3 @ sk4 ) ) ),
inference(simp,[status(thm)],[131]) ).
thf(50,plain,
! [C: $i,B: $i > $i,A: $i > $i] :
( ( ( A @ C )
= ( B @ C ) )
| ( ( A @ ( sk1 @ B @ A ) )
!= ( B @ ( sk1 @ B @ A ) ) ) ),
inference(func_ext,[status(esa)],[7]) ).
thf(350,plain,
! [C: $i,B: $i > $i,A: $i > $i] :
( ( ( A @ ( sk1 @ B @ A ) )
!= ( B @ ( sk1 @ B @ A ) ) )
| ( ( ~ ? [D: $i] :
( ( D
!= ( A @ C ) )
& ( sk3 @ D ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) )
| ( ( B @ C )
!= sk4 ) ),
inference(paramod_ordered,[status(thm)],[50,97]) ).
thf(431,plain,
! [A: $i > $i] :
( ( ( A
@ ( sk1
@ ^ [B: $i] : B
@ A ) )
!= ( sk1
@ ^ [B: $i] : B
@ A ) )
| ( ( ~ ? [B: $i] :
( ( B
!= ( A @ sk4 ) )
& ( sk3 @ B ) ) )
!= ( sk3
= ( (=) @ $i @ sk4 ) ) ) ),
inference(pre_uni,[status(thm)],[350:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : D )),bind(C,$thf( sk4 ))]]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( sk2
!= ( (=) @ $i @ B ) )
| ~ ( sk2 @ A )
| ( ( sk5 @ A )
!= A ) ),
inference(cnf,[status(esa)],[12]) ).
thf(16,plain,
! [B: $i,A: $i] :
( ( sk2
!= ( (=) @ $i @ B ) )
| ( ( sk5 @ A )
!= A )
| ~ ( sk2 @ A ) ),
inference(lifteq,[status(thm)],[14]) ).
thf(1097,plain,
$false,
inference(e,[status(thm)],[234,10,174,20,121,293,6,9,124,17,7,155,11,139,30,178,122,28,192,21,137,97,224,291,27,135,3,431,50,16,8,119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEV300^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% 0.04/0.13 % Command : run_Leo-III %s %d THM
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 19:05:40 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.96/0.88 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/1.01 % [INFO] Parsing done (125ms).
% 1.35/1.02 % [INFO] Running in sequential loop mode.
% 1.71/1.31 % [INFO] eprover registered as external prover.
% 1.71/1.32 % [INFO] Scanning for conjecture ...
% 2.07/1.41 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.07/1.43 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.07/1.43 % [INFO] Problem is higher-order (TPTP THF).
% 2.07/1.44 % [INFO] Type checking passed.
% 2.07/1.44 % [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 ...
% 13.84/4.10 % External prover 'e' found a proof!
% 13.84/4.10 % [INFO] Killing All external provers ...
% 13.84/4.10 % Time passed: 3562ms (effective reasoning time: 3082ms)
% 13.84/4.10 % 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)>
% 13.84/4.11 % Axioms used in derivation (0):
% 13.84/4.11 % No. of inferences in proof: 74
% 13.84/4.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3562 ms resp. 3082 ms w/o parsing
% 13.84/4.17 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 13.84/4.17 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------