TSTP Solution File: SEV235^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV235^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n028.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:59:49 EDT 2024
% Result : Theorem 21.53s 4.53s
% Output : Refutation 21.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 46
% Number of leaves : 1
% Syntax : Number of formulae : 92 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 341 ( 31 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 622 ( 121 ~; 161 |; 14 &; 305 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 54 ( 0 ^ 54 !; 0 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(cE_type,type,
cE: $i > $o ).
thf(cD_type,type,
cD: $i > $o ).
thf(sk1_type,type,
sk1: $i > $o ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(sk4_type,type,
sk4: $i ).
thf(1,conjecture,
! [A: $i > $o] :
( ( ! [B: $i] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
= ( ! [B: $i] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: $i] :
( ( A @ B )
=> ( cE @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM46A_pme) ).
thf(2,negated_conjecture,
~ ! [A: $i > $o] :
( ( ! [B: $i] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
= ( ! [B: $i] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: $i] :
( ( A @ B )
=> ( cE @ B ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $o] :
( ( ! [B: $i] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
= ( ! [B: $i] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: $i] :
( ( A @ B )
=> ( cE @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [A: $i] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) ) )
!= ( ! [A: $i] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: $i] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [A: $i] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) ) )
!= ( ! [A: $i] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: $i] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
( ~ ! [A: $i] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) )
| ~ ( ! [A: $i] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: $i] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(11,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(9,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(7,plain,
( ! [A: $i] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) )
| ( ! [A: $i] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: $i] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(16,plain,
! [B: $i,A: $i] :
( ~ ( sk1 @ B )
| ( cE @ B )
| ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(cnf,[status(esa)],[7]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ~ ( sk1 @ B )
| ( cE @ B )
| ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(simp,[status(thm)],[16]) ).
thf(684,plain,
! [B: $i,A: $i] :
( ~ ( sk1 @ B )
| ( cE @ B )
| ( cE @ A )
| ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[20]) ).
thf(685,plain,
! [A: $i] :
( ~ ( sk1 @ A )
| ( cE @ A )
| ( cE @ A ) ),
inference(pattern_uni,[status(thm)],[684:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(701,plain,
! [A: $i] :
( ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(simp,[status(thm)],[685]) ).
thf(713,plain,
! [A: $i] :
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[9,701]) ).
thf(714,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( cE @ sk4 ) ),
inference(pattern_uni,[status(thm)],[713:[bind(A,$thf( sk4 ))]]) ).
thf(19,plain,
! [B: $i,A: $i] :
( ~ ( sk1 @ B )
| ( cD @ B )
| ~ ( sk1 @ A )
| ( cD @ A ) ),
inference(cnf,[status(esa)],[7]) ).
thf(405,plain,
! [B: $i,A: $i] :
( ~ ( sk1 @ B )
| ( cD @ B )
| ( cD @ A )
| ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[19]) ).
thf(406,plain,
! [A: $i] :
( ~ ( sk1 @ A )
| ( cD @ A )
| ( cD @ A ) ),
inference(pattern_uni,[status(thm)],[405:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(414,plain,
! [A: $i] :
( ~ ( sk1 @ A )
| ( cD @ A ) ),
inference(simp,[status(thm)],[406]) ).
thf(1098,plain,
! [A: $i] :
( ( sk1 @ sk2 )
| ( cE @ sk4 )
| ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[714,414]) ).
thf(1099,plain,
( ( sk1 @ sk2 )
| ( cE @ sk4 )
| ( cD @ sk3 ) ),
inference(pattern_uni,[status(thm)],[1098:[bind(A,$thf( sk3 ))]]) ).
thf(1788,plain,
! [A: $i] :
( ( cE @ sk4 )
| ( cD @ sk3 )
| ( cE @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1099,701]) ).
thf(1789,plain,
( ( cE @ sk4 )
| ( cD @ sk3 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1788:[bind(A,$thf( sk2 ))]]) ).
thf(14,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(709,plain,
! [A: $i] :
( ~ ( cD @ sk3 )
| ( sk1 @ sk2 )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[14,701]) ).
thf(710,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk2 )
| ( cE @ sk4 ) ),
inference(pattern_uni,[status(thm)],[709:[bind(A,$thf( sk4 ))]]) ).
thf(1209,plain,
! [A: $i] :
( ~ ( cD @ sk3 )
| ( cE @ sk4 )
| ( cE @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[710,701]) ).
thf(1210,plain,
( ~ ( cD @ sk3 )
| ( cE @ sk4 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1209:[bind(A,$thf( sk2 ))]]) ).
thf(2424,plain,
( ( cE @ sk4 )
| ( cE @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[1789,1210]) ).
thf(2425,plain,
( ( cE @ sk4 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[2424:[]]) ).
thf(10,plain,
( ( sk1 @ sk3 )
| ~ ( cE @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(425,plain,
! [A: $i] :
( ~ ( cE @ sk4 )
| ( sk1 @ sk2 )
| ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[10,414]) ).
thf(426,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk2 )
| ( cD @ sk3 ) ),
inference(pattern_uni,[status(thm)],[425:[bind(A,$thf( sk3 ))]]) ).
thf(719,plain,
! [A: $i] :
( ~ ( cE @ sk4 )
| ( cD @ sk3 )
| ( cE @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[426,701]) ).
thf(720,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk3 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[719:[bind(A,$thf( sk2 ))]]) ).
thf(13,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(733,plain,
! [A: $i] :
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( cE @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[13,701]) ).
thf(734,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[733:[bind(A,$thf( sk2 ))]]) ).
thf(1461,plain,
( ~ ( cE @ sk4 )
| ( cE @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[720,734]) ).
thf(1462,plain,
( ~ ( cE @ sk4 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1461:[]]) ).
thf(2453,plain,
( ( cE @ sk2 )
| ( ( cE @ sk4 )
!= ( cE @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[2425,1462]) ).
thf(2454,plain,
cE @ sk2,
inference(pattern_uni,[status(thm)],[2453:[]]) ).
thf(2509,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ $true ),
inference(rewrite,[status(thm)],[11,2454]) ).
thf(2510,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 ) ),
inference(simp,[status(thm)],[2509]) ).
thf(12,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(2497,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ $true ),
inference(rewrite,[status(thm)],[12,2454]) ).
thf(2498,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 ) ),
inference(simp,[status(thm)],[2497]) ).
thf(468,plain,
! [A: $i] :
( ~ ( cE @ sk4 )
| ( cD @ sk3 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[426,414]) ).
thf(469,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk3 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[468:[bind(A,$thf( sk2 ))]]) ).
thf(449,plain,
! [A: $i] :
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[13,414]) ).
thf(450,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[449:[bind(A,$thf( sk2 ))]]) ).
thf(936,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[469,450]) ).
thf(937,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[936:[]]) ).
thf(15,plain,
( ( sk1 @ sk3 )
| ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(999,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk3 )
| ~ ( cE @ sk2 )
| ( ( cD @ sk2 )
!= ( cD @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[937,15]) ).
thf(1000,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk3 )
| ~ ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[999:[]]) ).
thf(2505,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk3 )
| ~ $true ),
inference(rewrite,[status(thm)],[1000,2454]) ).
thf(2506,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk3 ) ),
inference(simp,[status(thm)],[2505]) ).
thf(2556,plain,
! [A: $i] :
( ~ ( cE @ sk4 )
| ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2506,414]) ).
thf(2557,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk3 ) ),
inference(pattern_uni,[status(thm)],[2556:[bind(A,$thf( sk3 ))]]) ).
thf(8,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(996,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk3 )
| ~ ( cE @ sk2 )
| ( ( cD @ sk2 )
!= ( cD @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[937,8]) ).
thf(997,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk3 )
| ~ ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[996:[]]) ).
thf(2499,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk3 )
| ~ $true ),
inference(rewrite,[status(thm)],[997,2454]) ).
thf(2500,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk3 ) ),
inference(simp,[status(thm)],[2499]) ).
thf(2584,plain,
( ~ ( cE @ sk4 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[2557,2500]) ).
thf(2585,plain,
~ ( cE @ sk4 ),
inference(pattern_uni,[status(thm)],[2584:[]]) ).
thf(2597,plain,
( ( sk1 @ sk2 )
| $false
| ( cD @ sk3 ) ),
inference(rewrite,[status(thm)],[1099,2585]) ).
thf(2598,plain,
( ( sk1 @ sk2 )
| ( cD @ sk3 ) ),
inference(simp,[status(thm)],[2597]) ).
thf(2665,plain,
! [A: $i] :
( ( cD @ sk3 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2598,414]) ).
thf(2666,plain,
( ( cD @ sk3 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[2665:[bind(A,$thf( sk2 ))]]) ).
thf(1213,plain,
! [A: $i] :
( ~ ( cD @ sk3 )
| ( cE @ sk4 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[710,414]) ).
thf(1214,plain,
( ~ ( cD @ sk3 )
| ( cE @ sk4 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1213:[bind(A,$thf( sk2 ))]]) ).
thf(2595,plain,
( ~ ( cD @ sk3 )
| $false
| ( cD @ sk2 ) ),
inference(rewrite,[status(thm)],[1214,2585]) ).
thf(2596,plain,
( ~ ( cD @ sk3 )
| ( cD @ sk2 ) ),
inference(simp,[status(thm)],[2595]) ).
thf(2680,plain,
( ( cD @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[2666,2596]) ).
thf(2681,plain,
cD @ sk2,
inference(pattern_uni,[status(thm)],[2680:[]]) ).
thf(2802,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ $true ),
inference(rewrite,[status(thm)],[2498,2681]) ).
thf(2803,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 ) ),
inference(simp,[status(thm)],[2802]) ).
thf(2805,plain,
! [A: $i] :
( ( sk1 @ sk3 )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2803,701]) ).
thf(2806,plain,
( ( sk1 @ sk3 )
| ( cE @ sk4 ) ),
inference(pattern_uni,[status(thm)],[2805:[bind(A,$thf( sk4 ))]]) ).
thf(2812,plain,
( ( sk1 @ sk3 )
| $false ),
inference(rewrite,[status(thm)],[2806,2585]) ).
thf(2813,plain,
sk1 @ sk3,
inference(simp,[status(thm)],[2812]) ).
thf(2817,plain,
! [A: $i] :
( ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2813,414]) ).
thf(2818,plain,
cD @ sk3,
inference(pattern_uni,[status(thm)],[2817:[bind(A,$thf( sk3 ))]]) ).
thf(2837,plain,
( ~ $true
| ( sk1 @ sk4 )
| ~ $true ),
inference(rewrite,[status(thm)],[2510,2818,2681]) ).
thf(2838,plain,
sk1 @ sk4,
inference(simp,[status(thm)],[2837]) ).
thf(2841,plain,
! [A: $i] :
( ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2838,701]) ).
thf(2842,plain,
cE @ sk4,
inference(pattern_uni,[status(thm)],[2841:[bind(A,$thf( sk4 ))]]) ).
thf(2847,plain,
$false,
inference(rewrite,[status(thm)],[2842,2585]) ).
thf(2848,plain,
$false,
inference(simp,[status(thm)],[2847]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV235^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 19:20:40 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.99/0.89 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.99 % [INFO] Parsing done (102ms).
% 1.19/1.00 % [INFO] Running in sequential loop mode.
% 1.75/1.23 % [INFO] nitpick registered as external prover.
% 1.75/1.24 % [INFO] Scanning for conjecture ...
% 1.76/1.29 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.93/1.32 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.93/1.32 % [INFO] Problem is higher-order (TPTP THF).
% 1.93/1.32 % [INFO] Type checking passed.
% 1.93/1.32 % [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 ...
% 21.53/4.50 % [INFO] Killing All external provers ...
% 21.53/4.52 % Time passed: 3978ms (effective reasoning time: 3505ms)
% 21.53/4.52 % 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)>
% 21.53/4.52 % Axioms used in derivation (0):
% 21.53/4.52 % No. of inferences in proof: 92
% 21.53/4.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3978 ms resp. 3505 ms w/o parsing
% 21.66/4.64 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 21.81/4.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------