TSTP Solution File: SWW095+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SWW095+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n001.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 : Fri May 19 12:21:41 EDT 2023
% Result : Theorem 9.01s 3.03s
% Output : Refutation 9.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 76
% Syntax : Number of formulae : 137 ( 57 unt; 17 typ; 0 def)
% Number of atoms : 1967 ( 464 equ; 0 cnn)
% Maximal formula atoms : 521 ( 16 avg)
% Number of connectives : 7012 (1268 ~;1265 |; 582 &;3897 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 372 ( 0 ^; 368 !; 4 ?; 372 :)
% Comments :
%------------------------------------------------------------------------------
thf(object_type,type,
object: $i > $o ).
thf(null_type,type,
null: $i ).
thf(v__1_type,type,
v__1: $i > $i > $i > $o ).
thf(sortedList_first_type,type,
sortedList_first: $i ).
thf(nn_type,type,
nn: $i ).
thf(prev_2_type,type,
prev_2: $i ).
thf(node_next_type,type,
node_next: $i > $i ).
thf(integer_type,type,
integer: $i > $o ).
thf(lteq_type,type,
lteq: $i > $i > $o ).
thf(node_type,type,
node: $i > $o ).
thf(tmp_6_2_type,type,
tmp_6_2: $i ).
thf(node_key_type,type,
node_key: $i > $i ).
thf(object_alloc_type,type,
object_alloc: $i > $o ).
thf(node_value_type,type,
node_value: $i > $i ).
thf(array_type,type,
array: $i > $o ).
thf(array_arrayState_type,type,
array_arrayState: $i > $i > $i ).
thf(sortedList_type,type,
sortedList: $i > $o ).
thf(57,axiom,
object @ prev_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_prev_2) ).
thf(538,plain,
object @ prev_2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[57]) ).
thf(29,axiom,
object_alloc @ null,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_38) ).
thf(436,plain,
object_alloc @ null,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[29]) ).
thf(12,axiom,
( null
= ( node_next @ null ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_15) ).
thf(380,plain,
( null
= ( node_next @ null ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(21,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C )
& ( object @ D ) )
| ~ ( v__1 @ B @ C @ D )
| ~ ( v__1 @ B @ A @ C )
| ( ( v__1 @ B @ A @ D )
& ( v__1 @ A @ C @ D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_4) ).
thf(407,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C )
& ( object @ D ) )
| ~ ( v__1 @ B @ C @ D )
| ~ ( v__1 @ B @ A @ C )
| ( ( v__1 @ B @ A @ D )
& ( v__1 @ A @ C @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).
thf(17,axiom,
node @ nn,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_25) ).
thf(398,plain,
node @ nn,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(18,axiom,
( ( v__1 @ nn @ nn @ nn )
| ( nn = null )
| ~ ( v__1 @ sortedList_first @ nn @ nn ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_16) ).
thf(399,plain,
( ( v__1 @ nn @ nn @ nn )
| ( nn = null )
| ~ ( v__1 @ sortedList_first @ nn @ nn ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(24,axiom,
( ! [A: $i] :
( ~ ( object @ A )
| ~ ( node @ A )
| ~ ( array @ A )
| ( A = null ) )
& ! [A: $i] :
( ~ ( object @ A )
| ( A != null )
| ( ( node @ A )
& ( array @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_41) ).
thf(414,plain,
( ! [A: $i] :
( ~ ( object @ A )
| ~ ( node @ A )
| ~ ( array @ A )
| ( A = null ) )
& ! [A: $i] :
( ~ ( object @ A )
| ( A != null )
| ( ( node @ A )
& ( array @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[24]) ).
thf(14,axiom,
object_alloc @ prev_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_22) ).
thf(386,plain,
object_alloc @ prev_2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(6,axiom,
! [A: $i] : ( integer @ ( node_key @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_node_key) ).
thf(365,plain,
! [A: $i] : ( integer @ ( node_key @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(35,axiom,
nn != null,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_14) ).
thf(468,plain,
nn != null,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[35]) ).
thf(51,axiom,
nn != null,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_33) ).
thf(523,plain,
nn != null,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[51]) ).
thf(11,axiom,
! [A: $i] :
( ~ ( object @ A )
| ~ ( object_alloc @ A )
| ( object_alloc @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_27) ).
thf(379,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(31,axiom,
! [A: $i] :
( ~ ( object @ A )
| ( object_alloc @ A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( A
!= ( node_value @ B ) ) )
& ! [B: $i] :
( ~ ( object @ B )
| ( A
!= ( node_next @ B ) ) )
& ! [B: $i,C: $i] :
( ~ ( ( object @ B )
& ( integer @ C ) )
| ( A
!= ( array_arrayState @ B @ C ) ) )
& ( sortedList_first != A )
& ( null
= ( node_value @ A ) )
& ( null
= ( node_next @ A ) )
& ! [B: $i] :
( ~ ( integer @ B )
| ( null
= ( array_arrayState @ A @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_35) ).
thf(440,plain,
! [A: $i] :
( ~ ( object @ A )
| ( object_alloc @ A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( A
!= ( node_value @ B ) ) )
& ! [B: $i] :
( ~ ( object @ B )
| ( A
!= ( node_next @ B ) ) )
& ! [B: $i,C: $i] :
( ~ ( ( object @ B )
& ( integer @ C ) )
| ( A
!= ( array_arrayState @ B @ C ) ) )
& ( sortedList_first != A )
& ( null
= ( node_value @ A ) )
& ( null
= ( node_next @ A ) )
& ! [B: $i] :
( ~ ( integer @ B )
| ( null
= ( array_arrayState @ A @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[31]) ).
thf(45,axiom,
! [A: $i,B: $i] : ( object @ ( array_arrayState @ A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_array_arrayState) ).
thf(504,plain,
! [A: $i,B: $i] : ( object @ ( array_arrayState @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[45]) ).
thf(60,axiom,
object_alloc @ nn,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_26) ).
thf(542,plain,
object_alloc @ nn,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[60]) ).
thf(32,axiom,
! [A: $i] :
( ~ ( object @ A )
| ! [B: $i,C: $i] :
( ~ ( ( object @ B )
& ( object @ C ) )
| ( B
!= ( node_next @ A ) )
| ( C
!= ( node_next @ A ) )
| ( v__1 @ A @ B @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_10) ).
thf(460,plain,
! [A: $i] :
( ~ ( object @ A )
| ! [B: $i,C: $i] :
( ~ ( ( object @ B )
& ( object @ C ) )
| ( B
!= ( node_next @ A ) )
| ( C
!= ( node_next @ A ) )
| ( v__1 @ A @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[32]) ).
thf(40,axiom,
object_alloc @ nn,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_28) ).
thf(492,plain,
object_alloc @ nn,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[40]) ).
thf(37,axiom,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ( A = null )
| ( B = null )
| ( B
!= ( node_next @ A ) )
| ( ( B != null )
& ( v__1 @ sortedList_first @ B @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_31) ).
thf(480,plain,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ( A = null )
| ( B = null )
| ( B
!= ( node_next @ A ) )
| ( ( B != null )
& ( v__1 @ sortedList_first @ B @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[37]) ).
thf(1,conjecture,
! [A: $i] :
( ~ ( object @ A )
| ( A = null )
| ( ( ( ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ~ ( v__1 @ sortedList_first @ A @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
& ( ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ prev_2 )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ prev_2 )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) ) ) ) ) )
& ( ( prev_2 = A )
| ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ prev_2 @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ A @ A )
& ( ( v__1 @ sortedList_first @ A @ nn )
| ( ( v__1 @ sortedList_first @ A @ A )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != A )
& ( v__1 @ sortedList_first @ A @ nn )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) )
| ( ( nn != A )
& ( v__1 @ null @ A @ A )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) ) ) )
| ( ( ~ ( v__1 @ sortedList_first @ A @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) ) ) ) )
& ( ( prev_2 = A )
| ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ prev_2 @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ A @ A )
& ( ( v__1 @ sortedList_first @ A @ nn )
| ( ( v__1 @ sortedList_first @ A @ A )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != A )
& ( v__1 @ sortedList_first @ A @ nn )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) )
| ( ( nn != A )
& ( v__1 @ null @ A @ A )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) ) ) ) ) )
| ( ( A != null )
& ( v__1 @ sortedList_first @ A @ A )
& ( A != nn ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ~ ( object @ A )
| ( A = null )
| ( ( ( ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ~ ( v__1 @ sortedList_first @ A @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
& ( ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ prev_2 )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ prev_2 )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) ) ) ) ) )
& ( ( prev_2 = A )
| ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ prev_2 @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ A @ A )
& ( ( v__1 @ sortedList_first @ A @ nn )
| ( ( v__1 @ sortedList_first @ A @ A )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != A )
& ( v__1 @ sortedList_first @ A @ nn )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) )
| ( ( nn != A )
& ( v__1 @ null @ A @ A )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) ) ) )
| ( ( ~ ( v__1 @ sortedList_first @ A @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) ) ) ) )
& ( ( prev_2 = A )
| ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ prev_2 @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ A @ A )
& ( ( v__1 @ sortedList_first @ A @ nn )
| ( ( v__1 @ sortedList_first @ A @ A )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != A )
& ( v__1 @ sortedList_first @ A @ nn )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) )
| ( ( nn != A )
& ( v__1 @ null @ A @ A )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) ) ) ) ) )
| ( ( A != null )
& ( v__1 @ sortedList_first @ A @ A )
& ( A != nn ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(61,plain,
~ ! [A: $i] :
( ~ ( object @ A )
| ( A = null )
| ( ( ( ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ~ ( v__1 @ sortedList_first @ A @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
& ( ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ prev_2 )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ prev_2 )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) ) ) ) ) )
& ( ( prev_2 = A )
| ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ prev_2 @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ A @ A )
& ( ( v__1 @ sortedList_first @ A @ nn )
| ( ( v__1 @ sortedList_first @ A @ A )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != A )
& ( v__1 @ sortedList_first @ A @ nn )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) )
| ( ( nn != A )
& ( v__1 @ null @ A @ A )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) ) ) )
| ( ( ~ ( v__1 @ sortedList_first @ A @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ A @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) ) ) ) )
& ( ( prev_2 = A )
| ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ A )
| ( ~ ( v__1 @ sortedList_first @ A @ nn )
& ( ~ ( v__1 @ sortedList_first @ A @ A )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ~ ( v__1 @ sortedList_first @ nn @ A )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ A @ A ) ) )
| ~ ( v__1 @ null @ prev_2 @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
& ( ~ ( v__1 @ sortedList_first @ prev_2 @ prev_2 )
| ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ sortedList_first @ prev_2 @ nn )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ~ ( v__1 @ sortedList_first @ nn @ prev_2 )
& ( ~ ( v__1 @ sortedList_first @ nn @ nn )
| ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) )
| ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( v__1 @ sortedList_first @ A @ A )
& ( ( v__1 @ sortedList_first @ A @ nn )
| ( ( v__1 @ sortedList_first @ A @ A )
& ~ ( v__1 @ sortedList_first @ nn @ nn ) ) ) )
| ( ( nn != A )
& ( v__1 @ sortedList_first @ A @ nn )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) )
| ( ( nn != A )
& ( v__1 @ null @ A @ A )
& ( ( v__1 @ null @ A @ nn )
| ( ( v__1 @ null @ A @ A )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ( v__1 @ sortedList_first @ nn @ A )
| ( ( v__1 @ sortedList_first @ nn @ nn )
& ~ ( v__1 @ sortedList_first @ A @ A ) ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = prev_2 )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ prev_2 )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) ) ) )
| ~ ( v__1 @ null @ A @ prev_2 )
| ( ~ ( v__1 @ null @ prev_2 @ nn )
& ( ~ ( v__1 @ null @ prev_2 @ prev_2 )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ A )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ A @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) )
& ( ( nn = A )
| ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ A )
| ( B
!= ( node_next @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ A @ A ) ) ) )
| ~ ( v__1 @ null @ A @ A )
| ( ~ ( v__1 @ null @ A @ nn )
& ( ~ ( v__1 @ null @ A @ A )
| ( v__1 @ null @ nn @ nn ) ) ) ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ prev_2 ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ nn @ nn )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ prev_2 @ nn ) )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) )
| ( ( nn != prev_2 )
& ( v__1 @ null @ prev_2 @ prev_2 )
& ( ( v__1 @ null @ prev_2 @ nn )
| ( ( v__1 @ null @ prev_2 @ prev_2 )
& ~ ( v__1 @ null @ nn @ nn ) ) )
& ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ prev_2 ) )
| ( ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ nn ) )
| ( v__1 @ B @ nn @ nn ) )
& ! [B: $i] :
( ~ ( object @ B )
| ~ ( v__1 @ B @ prev_2 @ prev_2 )
| ( B
!= ( node_next @ nn ) ) ) ) ) ) ) ) ) )
| ( ( A != null )
& ( v__1 @ sortedList_first @ A @ A )
& ( A != nn ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(16,axiom,
( null
= ( node_value @ null ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_44) ).
thf(396,plain,
( null
= ( node_value @ null ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(23,axiom,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ~ ( v__1 @ A @ B @ A )
| ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_8) ).
thf(411,plain,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ~ ( v__1 @ A @ B @ A )
| ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[23]) ).
thf(53,axiom,
node @ prev_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_21) ).
thf(527,plain,
node @ prev_2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[53]) ).
thf(34,axiom,
node @ sortedList_first,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_34) ).
thf(467,plain,
node @ sortedList_first,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[34]) ).
thf(4,axiom,
node @ tmp_6_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_23) ).
thf(361,plain,
node @ tmp_6_2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(50,axiom,
object_alloc @ sortedList_first,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_37) ).
thf(522,plain,
object_alloc @ sortedList_first,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[50]) ).
thf(41,axiom,
! [A: $i] :
( ~ ( object @ A )
| ( object @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_42) ).
thf(493,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[41]) ).
thf(48,axiom,
object @ sortedList_first,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_sortedList_first) ).
thf(519,plain,
object @ sortedList_first,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[48]) ).
thf(43,axiom,
( ( sortedList_first = null )
| ! [A: $i] :
( ~ ( object @ A )
| ( sortedList_first
!= ( node_next @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_32) ).
thf(499,plain,
( ( sortedList_first = null )
| ! [A: $i] :
( ~ ( object @ A )
| ( sortedList_first
!= ( node_next @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[43]) ).
thf(36,axiom,
( ! [A: $i] :
( ~ ( object @ A )
| ~ ( sortedList @ A )
| ~ ( array @ A )
| ( A = null ) )
& ! [A: $i] :
( ~ ( object @ A )
| ( A != null )
| ( ( sortedList @ A )
& ( array @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_40) ).
thf(471,plain,
( ! [A: $i] :
( ~ ( object @ A )
| ~ ( sortedList @ A )
| ~ ( array @ A )
| ( A = null ) )
& ! [A: $i] :
( ~ ( object @ A )
| ( A != null )
| ( ( sortedList @ A )
& ( array @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[36]) ).
thf(52,axiom,
node @ nn,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_29) ).
thf(526,plain,
node @ nn,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[52]) ).
thf(39,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C )
& ( object @ D ) )
| ~ ( v__1 @ B @ C @ D )
| ~ ( v__1 @ C @ A @ D )
| ( ( v__1 @ B @ C @ A )
& ( v__1 @ B @ A @ D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_3) ).
thf(489,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C )
& ( object @ D ) )
| ~ ( v__1 @ B @ C @ D )
| ~ ( v__1 @ C @ A @ D )
| ( ( v__1 @ B @ C @ A )
& ( v__1 @ B @ A @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[39]) ).
thf(26,axiom,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ~ ( v__1 @ sortedList_first @ A @ A )
| ( A = null )
| ! [C: $i] :
( ~ ( object @ C )
| ~ ( v__1 @ C @ B @ B )
| ( C
!= ( node_next @ A ) ) )
| ( B = null )
| ( ! [C: $i,D: $i] :
( ~ ( ( integer @ C )
& ( integer @ D ) )
| ( C
!= ( node_key @ A ) )
| ( D
!= ( node_key @ B ) )
| ( lteq @ C @ D ) )
& ! [C: $i] :
( ~ ( integer @ C )
| ( C
!= ( node_key @ A ) )
| ( C
!= ( node_key @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_30) ).
thf(425,plain,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ~ ( v__1 @ sortedList_first @ A @ A )
| ( A = null )
| ! [C: $i] :
( ~ ( object @ C )
| ~ ( v__1 @ C @ B @ B )
| ( C
!= ( node_next @ A ) ) )
| ( B = null )
| ( ! [C: $i,D: $i] :
( ~ ( ( integer @ C )
& ( integer @ D ) )
| ( C
!= ( node_key @ A ) )
| ( D
!= ( node_key @ B ) )
| ( lteq @ C @ D ) )
& ! [C: $i] :
( ~ ( integer @ C )
| ( C
!= ( node_key @ A ) )
| ( C
!= ( node_key @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[26]) ).
thf(9,axiom,
! [A: $i,B: $i] :
( ~ ( ( integer @ A )
& ( integer @ B ) )
| ( lteq @ A @ B )
| ( lteq @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_tptp_4) ).
thf(375,plain,
! [A: $i,B: $i] :
( ~ ( ( integer @ A )
& ( integer @ B ) )
| ( lteq @ A @ B )
| ( lteq @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(25,axiom,
! [A: $i] : ( object @ ( node_value @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_node_value) ).
thf(423,plain,
! [A: $i] : ( object @ ( node_value @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[25]) ).
thf(19,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C ) )
| ~ ( v__1 @ A @ B @ C )
| ( ( v__1 @ A @ B @ B )
& ( v__1 @ B @ C @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_6) ).
thf(402,plain,
! [A: $i,B: $i,C: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C ) )
| ~ ( v__1 @ A @ B @ C )
| ( ( v__1 @ A @ B @ B )
& ( v__1 @ B @ C @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).
thf(13,axiom,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ~ ( v__1 @ A @ B @ B )
| ( A = B )
| ! [C: $i] :
( ~ ( object @ C )
| ( C
!= ( node_next @ A ) )
| ( v__1 @ A @ C @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_11) ).
thf(382,plain,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ~ ( v__1 @ A @ B @ B )
| ( A = B )
| ! [C: $i] :
( ~ ( object @ C )
| ( C
!= ( node_next @ A ) )
| ( v__1 @ A @ C @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(59,axiom,
( null
= ( node_next @ null ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_1) ).
thf(540,plain,
( null
= ( node_next @ null ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[59]) ).
thf(10,axiom,
! [A: $i] :
( ~ ( integer @ A )
| ( lteq @ A @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_tptp_1) ).
thf(377,plain,
! [A: $i] :
( ~ ( integer @ A )
| ( lteq @ A @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ~ ( ( integer @ A )
& ( integer @ B ) )
| ~ ( ( lteq @ A @ B )
& ( lteq @ B @ A ) )
| ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_tptp_2) ).
thf(362,plain,
! [A: $i,B: $i] :
( ~ ( ( integer @ A )
& ( integer @ B ) )
| ~ ( ( lteq @ A @ B )
& ( lteq @ B @ A ) )
| ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(15,axiom,
? [A: $i,B: $i] :
( ( integer @ A )
& ( integer @ B )
& ( lteq @ A @ B )
& ( A
= ( node_key @ nn ) )
& ( B
= ( node_key @ nn ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_13) ).
thf(387,plain,
? [A: $i,B: $i] :
( ( integer @ A )
& ( integer @ B )
& ( lteq @ A @ B )
& ( A
= ( node_key @ nn ) )
& ( B
= ( node_key @ nn ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(42,axiom,
( ( prev_2 = null )
| ( ( prev_2 != null )
& ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_17) ).
thf(494,plain,
( ( prev_2 = null )
| ( ( prev_2 != null )
& ( v__1 @ sortedList_first @ prev_2 @ prev_2 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[42]) ).
thf(7,axiom,
object_alloc @ tmp_6_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_24) ).
thf(367,plain,
object_alloc @ tmp_6_2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(49,axiom,
( null
= ( node_next @ null ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_43) ).
thf(520,plain,
( null
= ( node_next @ null ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[49]) ).
thf(55,axiom,
( ( nn = null )
| ( ( nn != null )
& ( v__1 @ sortedList_first @ nn @ nn ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_18) ).
thf(531,plain,
( ( nn = null )
| ( ( nn != null )
& ( v__1 @ sortedList_first @ nn @ nn ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[55]) ).
thf(38,axiom,
! [A: $i] :
( ~ ( object @ A )
| ( v__1 @ A @ A @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_7) ).
thf(487,plain,
! [A: $i] :
( ~ ( object @ A )
| ( v__1 @ A @ A @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[38]) ).
thf(44,axiom,
! [A: $i] : ( object @ ( node_next @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_node_next) ).
thf(502,plain,
! [A: $i] : ( object @ ( node_next @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[44]) ).
thf(3,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( ( integer @ A )
& ( integer @ B )
& ( integer @ C ) )
| ~ ( ( lteq @ A @ B )
& ( lteq @ B @ C ) )
| ( lteq @ A @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_tptp_3) ).
thf(359,plain,
! [A: $i,B: $i,C: $i] :
( ~ ( ( integer @ A )
& ( integer @ B )
& ( integer @ C ) )
| ~ ( ( lteq @ A @ B )
& ( lteq @ B @ C ) )
| ( lteq @ A @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(58,axiom,
object @ tmp_6_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_tmp_6_2) ).
thf(539,plain,
object @ tmp_6_2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[58]) ).
thf(8,axiom,
! [A: $i,B: $i] :
( ~ ( ( integer @ A )
& ( integer @ B ) )
| ( ( ~ ( lteq @ A @ B )
| ( A = B )
| ~ ( lteq @ B @ A ) )
& ( ~ ( ( A = B )
| ~ ( lteq @ B @ A ) )
| ( lteq @ A @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_tptp_5) ).
thf(368,plain,
! [A: $i,B: $i] :
( ~ ( ( integer @ A )
& ( integer @ B ) )
| ( ( ~ ( lteq @ A @ B )
| ( A = B )
| ~ ( lteq @ B @ A ) )
& ( ~ ( ( A = B )
| ~ ( lteq @ B @ A ) )
| ( lteq @ A @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(56,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C ) )
| ~ ( v__1 @ A @ B @ B )
| ~ ( v__1 @ A @ C @ C )
| ( v__1 @ A @ B @ C )
| ( v__1 @ A @ C @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_5) ).
thf(536,plain,
! [A: $i,B: $i,C: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C ) )
| ~ ( v__1 @ A @ B @ B )
| ~ ( v__1 @ A @ C @ C )
| ( v__1 @ A @ B @ C )
| ( v__1 @ A @ C @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[56]) ).
thf(28,axiom,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ( A
!= ( node_next @ A ) )
| ~ ( v__1 @ A @ B @ B )
| ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_9) ).
thf(433,plain,
! [A: $i,B: $i] :
( ~ ( ( object @ A )
& ( object @ B ) )
| ( A
!= ( node_next @ A ) )
| ~ ( v__1 @ A @ B @ B )
| ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[28]) ).
thf(47,axiom,
( ! [A: $i] :
( ~ ( object @ A )
| ~ ( sortedList @ A )
| ~ ( node @ A )
| ( A = null ) )
& ! [A: $i] :
( ~ ( object @ A )
| ( A != null )
| ( ( sortedList @ A )
& ( node @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_39) ).
thf(510,plain,
( ! [A: $i] :
( ~ ( object @ A )
| ~ ( sortedList @ A )
| ~ ( node @ A )
| ( A = null ) )
& ! [A: $i] :
( ~ ( object @ A )
| ( A != null )
| ( ( sortedList @ A )
& ( node @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[47]) ).
thf(27,axiom,
object @ nn,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_nn) ).
thf(432,plain,
object @ nn,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[27]) ).
thf(22,axiom,
object @ null,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sort_info_null) ).
thf(410,plain,
object @ null,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[22]) ).
thf(20,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C ) )
| ~ ( v__1 @ A @ B @ B )
| ~ ( v__1 @ B @ C @ C )
| ( v__1 @ A @ C @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_2) ).
thf(405,plain,
! [A: $i,B: $i,C: $i] :
( ~ ( ( object @ A )
& ( object @ B )
& ( object @ C ) )
| ~ ( v__1 @ A @ B @ B )
| ~ ( v__1 @ B @ C @ C )
| ( v__1 @ A @ C @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).
thf(46,axiom,
! [A: $i] :
( ~ ( object @ A )
| ~ ( node @ A )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ A ) )
| ( node @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_36) ).
thf(506,plain,
! [A: $i] :
( ~ ( object @ A )
| ~ ( node @ A )
| ! [B: $i] :
( ~ ( object @ B )
| ( B
!= ( node_next @ A ) )
| ( node @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[46]) ).
thf(30,axiom,
prev_2 != null,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_12) ).
thf(437,plain,
prev_2 != null,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[30]) ).
thf(33,axiom,
( ( prev_2 != null )
| ( nn = sortedList_first ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_19) ).
thf(464,plain,
( ( prev_2 != null )
| ( nn = sortedList_first ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[33]) ).
thf(54,axiom,
( ( prev_2 = null )
| ( nn
= ( node_next @ prev_2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp_tptp_20) ).
thf(528,plain,
( ( prev_2 = null )
| ( nn
= ( node_next @ prev_2 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[54]) ).
thf(764,plain,
$false,
inference(cvc4,[status(thm)],[538,436,380,407,398,399,414,386,365,468,523,379,440,504,542,460,492,480,61,396,411,527,467,361,522,493,519,499,471,526,489,425,375,423,402,382,540,377,362,387,494,367,520,531,487,502,359,539,368,536,433,510,432,410,405,506,437,464,528]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWW095+1 : TPTP v8.1.2. Released v5.2.0.
% 0.10/0.15 % Command : run_Leo-III %s %d
% 0.15/0.35 % Computer : n001.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 18 22:57:36 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.89/0.82 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.23/1.01 % [INFO] Parsing done (187ms).
% 1.23/1.02 % [INFO] Running in sequential loop mode.
% 1.90/1.21 % [INFO] eprover registered as external prover.
% 1.90/1.21 % [INFO] cvc4 registered as external prover.
% 1.90/1.21 % [INFO] Scanning for conjecture ...
% 2.45/1.40 % [INFO] Found a conjecture and 58 axioms. Running axiom selection ...
% 2.69/1.47 % [INFO] Axiom selection finished. Selected 58 axioms (removed 0 axioms).
% 2.78/1.50 % [INFO] Problem is first-order (TPTP FOF).
% 2.78/1.51 % [INFO] Type checking passed.
% 2.78/1.52 % [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 ...
% 9.01/3.02 % External prover 'cvc4' found a proof!
% 9.01/3.02 % [INFO] Killing All external provers ...
% 9.01/3.02 % Time passed: 2521ms (effective reasoning time: 2005ms)
% 9.01/3.03 % 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)>
% 9.01/3.03 % Axioms used in derivation (58): hyp_tptp_21, hyp_tptp_15, hyp_tptp_37, hyp_tptp_44, hyp_tptp_33, hyp_tptp_25, sort_info_null, hyp_tptp_31, hyp_tptp_20, sort_info_node_key, hyp_tptp_40, hyp_tptp_18, hyp_tptp_32, hyp_tptp_43, axiom_tptp_5, hyp_tptp_7, hyp_tptp_26, axiom_tptp_1, hyp_tptp_3, sort_info_array_arrayState, hyp_tptp_19, hyp_tptp_10, hyp_tptp_11, hyp_tptp_4, hyp_tptp_28, hyp_tptp_9, hyp_tptp_22, hyp_tptp_17, sort_info_node_next, hyp_tptp_14, hyp_tptp_29, axiom_tptp_4, hyp_tptp_36, sort_info_sortedList_first, hyp_tptp_34, sort_info_prev_2, hyp_tptp_5, hyp_tptp_30, sort_info_node_value, sort_info_nn, hyp_tptp_12, hyp_tptp_23, hyp_tptp_24, hyp_tptp_35, hyp_tptp_8, hyp_tptp_41, hyp_tptp_13, hyp_tptp_27, sort_info_tmp_6_2, hyp_tptp_16, hyp_tptp_38, axiom_tptp_3, hyp_tptp_39, hyp_tptp_1, hyp_tptp_6, hyp_tptp_42, hyp_tptp_2, axiom_tptp_2
% 9.01/3.03 % No. of inferences in proof: 120
% 9.01/3.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2521 ms resp. 2005 ms w/o parsing
% 9.44/3.12 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.44/3.13 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------