TSTP Solution File: SWV417+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n003.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 : 600s
% DateTime : Wed Jul 20 19:16:05 EDT 2022
% Result : Theorem 0.90s 1.10s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 70
% Syntax : Number of formulae : 589 ( 158 unt; 0 def)
% Number of atoms : 1306 ( 334 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 1257 ( 540 ~; 561 |; 70 &)
% ( 30 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 22 ( 19 usr; 2 prp; 0-3 aty)
% Number of functors : 40 ( 40 usr; 10 con; 0-3 aty)
% Number of variables : 1543 ( 214 sgn 530 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
file('<stdin>',ax37) ).
fof(c_0_1,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('<stdin>',ax55) ).
fof(c_0_2,axiom,
! [X1,X2,X3,X4,X5] :
( strictly_less_than(X4,X5)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> ~ $true ) ),
file('<stdin>',ax38) ).
fof(c_0_3,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('<stdin>',ax49) ).
fof(c_0_4,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('<stdin>',ax48) ).
fof(c_0_5,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('<stdin>',ax44) ).
fof(c_0_6,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('<stdin>',ax45) ).
fof(c_0_7,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('<stdin>',ax42) ).
fof(c_0_8,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('<stdin>',ax23) ).
fof(c_0_9,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('<stdin>',ax47) ).
fof(c_0_10,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('<stdin>',ax39) ).
fof(c_0_11,axiom,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
file('<stdin>',ax43) ).
fof(c_0_12,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
file('<stdin>',ax25) ).
fof(c_0_13,axiom,
! [X1,X2,X3,X4] :
( less_than(X3,X4)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X4)) ),
file('<stdin>',ax30) ).
fof(c_0_14,axiom,
! [X1,X2,X3,X4] :
( strictly_less_than(X4,X3)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X3)) ),
file('<stdin>',ax29) ).
fof(c_0_15,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('<stdin>',ax40) ).
fof(c_0_16,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('<stdin>',ax21) ).
fof(c_0_17,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('<stdin>',ax46) ).
fof(c_0_18,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
file('<stdin>',ax27) ).
fof(c_0_19,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('<stdin>',ax51) ).
fof(c_0_20,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('<stdin>',ax41) ).
fof(c_0_21,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('<stdin>',ax54) ).
fof(c_0_22,axiom,
! [X1,X2] : findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
file('<stdin>',ax50) ).
fof(c_0_23,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('<stdin>',ax36) ).
fof(c_0_24,axiom,
! [X1,X2,X3] :
( ( contains_pq(X1,X3)
& X2 != X3 )
=> remove_pq(insert_pq(X1,X2),X3) = insert_pq(remove_pq(X1,X3),X2) ),
file('<stdin>',ax12) ).
fof(c_0_25,axiom,
! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
file('<stdin>',ax26) ).
fof(c_0_26,axiom,
! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
file('<stdin>',ax24) ).
fof(c_0_27,axiom,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
file('<stdin>',ax22) ).
fof(c_0_28,axiom,
! [X1,X2,X3] : isnonempty_slb(insert_slb(X1,pair(X2,X3))),
file('<stdin>',ax19) ).
fof(c_0_29,axiom,
! [X1,X2,X3] :
( contains_pq(insert_pq(X1,X2),X3)
<=> ( contains_pq(X1,X3)
| X2 = X3 ) ),
file('<stdin>',ax9) ).
fof(c_0_30,axiom,
! [X1,X2,X3] : insert_pq(insert_pq(X1,X2),X3) = insert_pq(insert_pq(X1,X3),X2),
file('<stdin>',ax17) ).
fof(c_0_31,axiom,
! [X1,X2] :
( issmallestelement_pq(X1,X2)
<=> ! [X3] :
( contains_pq(X1,X3)
=> less_than(X2,X3) ) ),
file('<stdin>',ax10) ).
fof(c_0_32,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> removemin_pq_eff(X1,X2) = remove_pq(X1,X2) ),
file('<stdin>',ax15) ).
fof(c_0_33,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,remove_cpq(X2,X3)) ),
file('<stdin>',ax33) ).
fof(c_0_34,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,insert_cpq(X2,X3)) ),
file('<stdin>',ax32) ).
fof(c_0_35,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> removemin_pq_res(X1,X2) = X2 ),
file('<stdin>',ax16) ).
fof(c_0_36,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> findmin_pq_res(X1,X2) = X2 ),
file('<stdin>',ax14) ).
fof(c_0_37,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> findmin_pq_eff(X1,X2) = X1 ),
file('<stdin>',ax13) ).
fof(c_0_38,axiom,
! [X1,X2] :
( pi_sharp_removemin(X1,X2)
<=> ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) ),
file('<stdin>',ax60) ).
fof(c_0_39,axiom,
! [X1,X2] :
( pi_sharp_find_min(X1,X2)
<=> ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) ),
file('<stdin>',ax58) ).
fof(c_0_40,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
file('<stdin>',transitivity) ).
fof(c_0_41,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('<stdin>',stricly_smaller_definition) ).
fof(c_0_42,axiom,
! [X1,X2] :
( pi_remove(X1,X2)
<=> pi_sharp_remove(i(X1),X2) ),
file('<stdin>',ax57) ).
fof(c_0_43,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,removemin_cpq_eff(X2)) ),
file('<stdin>',ax35) ).
fof(c_0_44,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,findmin_cpq_eff(X2)) ),
file('<stdin>',ax34) ).
fof(c_0_45,axiom,
! [X1] :
( phi(X1)
<=> ? [X2] :
( succ_cpq(X1,X2)
& ok(X2)
& check_cpq(X2) ) ),
file('<stdin>',ax62) ).
fof(c_0_46,axiom,
! [X1,X2] : remove_pq(insert_pq(X1,X2),X2) = X1,
file('<stdin>',ax11) ).
fof(c_0_47,axiom,
! [X1,X2] :
( pi_sharp_remove(X1,X2)
<=> contains_pq(X1,X2) ),
file('<stdin>',ax56) ).
fof(c_0_48,axiom,
! [X1] :
( pi_removemin(X1)
<=> ? [X2] : pi_sharp_find_min(i(X1),X2) ),
file('<stdin>',ax61) ).
fof(c_0_49,axiom,
! [X1] :
( pi_find_min(X1)
<=> ? [X2] : pi_sharp_find_min(i(X1),X2) ),
file('<stdin>',ax59) ).
fof(c_0_50,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
file('<stdin>',ax52) ).
fof(c_0_51,axiom,
! [X1,X2] : isnonempty_pq(insert_pq(X1,X2)),
file('<stdin>',ax7) ).
fof(c_0_52,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('<stdin>',totality) ).
fof(c_0_53,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('<stdin>',ax20) ).
fof(c_0_54,axiom,
! [X1] : ~ contains_pq(create_pq,X1),
file('<stdin>',ax8) ).
fof(c_0_55,axiom,
! [X1] : succ_cpq(X1,X1),
file('<stdin>',ax31) ).
fof(c_0_56,axiom,
! [X1] : less_than(X1,X1),
file('<stdin>',reflexivity) ).
fof(c_0_57,axiom,
! [X1] : update_slb(create_slb,X1) = create_slb,
file('<stdin>',ax28) ).
fof(c_0_58,axiom,
! [X1] : less_than(bottom,X1),
file('<stdin>',bottom_smallest) ).
fof(c_0_59,axiom,
! [X1] : removemin_cpq_res(X1) = findmin_cpq_res(X1),
file('<stdin>',ax53) ).
fof(c_0_60,axiom,
~ isnonempty_slb(create_slb),
file('<stdin>',ax18) ).
fof(c_0_61,axiom,
~ isnonempty_pq(create_pq),
file('<stdin>',ax6) ).
fof(c_0_62,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
c_0_0 ).
fof(c_0_63,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
c_0_1 ).
fof(c_0_64,plain,
! [X1,X2,X3,X4,X5] :
( strictly_less_than(X4,X5)
=> ~ check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_65,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
c_0_3 ).
fof(c_0_66,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
c_0_4 ).
fof(c_0_67,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
c_0_5 ).
fof(c_0_68,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
c_0_6 ).
fof(c_0_69,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
c_0_7 ).
fof(c_0_70,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
c_0_8 ).
fof(c_0_71,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_72,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
c_0_10 ).
fof(c_0_73,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_74,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
c_0_12 ).
fof(c_0_75,axiom,
! [X1,X2,X3,X4] :
( less_than(X3,X4)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X4)) ),
c_0_13 ).
fof(c_0_76,axiom,
! [X1,X2,X3,X4] :
( strictly_less_than(X4,X3)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X3)) ),
c_0_14 ).
fof(c_0_77,plain,
! [X1,X2] : ~ ok(triple(X1,X2,bad)),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_78,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
c_0_16 ).
fof(c_0_79,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
c_0_17 ).
fof(c_0_80,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
c_0_18 ).
fof(c_0_81,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
c_0_19 ).
fof(c_0_82,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_83,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
c_0_21 ).
fof(c_0_84,axiom,
! [X1,X2] : findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
c_0_22 ).
fof(c_0_85,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
c_0_23 ).
fof(c_0_86,axiom,
! [X1,X2,X3] :
( ( contains_pq(X1,X3)
& X2 != X3 )
=> remove_pq(insert_pq(X1,X2),X3) = insert_pq(remove_pq(X1,X3),X2) ),
c_0_24 ).
fof(c_0_87,axiom,
! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
c_0_25 ).
fof(c_0_88,axiom,
! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
c_0_26 ).
fof(c_0_89,plain,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
inference(fof_simplification,[status(thm)],[c_0_27]) ).
fof(c_0_90,axiom,
! [X1,X2,X3] : isnonempty_slb(insert_slb(X1,pair(X2,X3))),
c_0_28 ).
fof(c_0_91,axiom,
! [X1,X2,X3] :
( contains_pq(insert_pq(X1,X2),X3)
<=> ( contains_pq(X1,X3)
| X2 = X3 ) ),
c_0_29 ).
fof(c_0_92,axiom,
! [X1,X2,X3] : insert_pq(insert_pq(X1,X2),X3) = insert_pq(insert_pq(X1,X3),X2),
c_0_30 ).
fof(c_0_93,axiom,
! [X1,X2] :
( issmallestelement_pq(X1,X2)
<=> ! [X3] :
( contains_pq(X1,X3)
=> less_than(X2,X3) ) ),
c_0_31 ).
fof(c_0_94,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> removemin_pq_eff(X1,X2) = remove_pq(X1,X2) ),
c_0_32 ).
fof(c_0_95,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,remove_cpq(X2,X3)) ),
c_0_33 ).
fof(c_0_96,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,insert_cpq(X2,X3)) ),
c_0_34 ).
fof(c_0_97,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> removemin_pq_res(X1,X2) = X2 ),
c_0_35 ).
fof(c_0_98,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> findmin_pq_res(X1,X2) = X2 ),
c_0_36 ).
fof(c_0_99,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> findmin_pq_eff(X1,X2) = X1 ),
c_0_37 ).
fof(c_0_100,axiom,
! [X1,X2] :
( pi_sharp_removemin(X1,X2)
<=> ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) ),
c_0_38 ).
fof(c_0_101,axiom,
! [X1,X2] :
( pi_sharp_find_min(X1,X2)
<=> ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) ),
c_0_39 ).
fof(c_0_102,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
c_0_40 ).
fof(c_0_103,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_41]) ).
fof(c_0_104,axiom,
! [X1,X2] :
( pi_remove(X1,X2)
<=> pi_sharp_remove(i(X1),X2) ),
c_0_42 ).
fof(c_0_105,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,removemin_cpq_eff(X2)) ),
c_0_43 ).
fof(c_0_106,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,findmin_cpq_eff(X2)) ),
c_0_44 ).
fof(c_0_107,axiom,
! [X1] :
( phi(X1)
<=> ? [X2] :
( succ_cpq(X1,X2)
& ok(X2)
& check_cpq(X2) ) ),
c_0_45 ).
fof(c_0_108,axiom,
! [X1,X2] : remove_pq(insert_pq(X1,X2),X2) = X1,
c_0_46 ).
fof(c_0_109,axiom,
! [X1,X2] :
( pi_sharp_remove(X1,X2)
<=> contains_pq(X1,X2) ),
c_0_47 ).
fof(c_0_110,axiom,
! [X1] :
( pi_removemin(X1)
<=> ? [X2] : pi_sharp_find_min(i(X1),X2) ),
c_0_48 ).
fof(c_0_111,axiom,
! [X1] :
( pi_find_min(X1)
<=> ? [X2] : pi_sharp_find_min(i(X1),X2) ),
c_0_49 ).
fof(c_0_112,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
c_0_50 ).
fof(c_0_113,axiom,
! [X1,X2] : isnonempty_pq(insert_pq(X1,X2)),
c_0_51 ).
fof(c_0_114,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
c_0_52 ).
fof(c_0_115,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[c_0_53]) ).
fof(c_0_116,plain,
! [X1] : ~ contains_pq(create_pq,X1),
inference(fof_simplification,[status(thm)],[c_0_54]) ).
fof(c_0_117,axiom,
! [X1] : succ_cpq(X1,X1),
c_0_55 ).
fof(c_0_118,axiom,
! [X1] : less_than(X1,X1),
c_0_56 ).
fof(c_0_119,axiom,
! [X1] : update_slb(create_slb,X1) = create_slb,
c_0_57 ).
fof(c_0_120,axiom,
! [X1] : less_than(bottom,X1),
c_0_58 ).
fof(c_0_121,axiom,
! [X1] : removemin_cpq_res(X1) = findmin_cpq_res(X1),
c_0_59 ).
fof(c_0_122,plain,
~ isnonempty_slb(create_slb),
inference(fof_simplification,[status(thm)],[c_0_60]) ).
fof(c_0_123,plain,
~ isnonempty_pq(create_pq),
inference(fof_simplification,[status(thm)],[c_0_61]) ).
fof(c_0_124,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| check_cpq(triple(X6,X7,X8))
| ~ less_than(X10,X9) )
& ( ~ check_cpq(triple(X6,X7,X8))
| check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| ~ less_than(X10,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])])]) ).
fof(c_0_125,plain,
! [X6,X7,X8,X9,X10] : i(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) = insert_pq(i(triple(X6,X7,X8)),X9),
inference(variable_rename,[status(thm)],[c_0_63]) ).
fof(c_0_126,plain,
! [X6,X7,X8,X9,X10] :
( ~ strictly_less_than(X9,X10)
| ~ check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])]) ).
fof(c_0_127,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| ~ contains_slb(X6,findmin_pqp_res(X5))
| ~ less_than(lookup_slb(X6,findmin_pqp_res(X5)),findmin_pqp_res(X5))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])])]) ).
fof(c_0_128,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| ~ contains_slb(X6,findmin_pqp_res(X5))
| ~ strictly_less_than(findmin_pqp_res(X5),lookup_slb(X6,findmin_pqp_res(X5)))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_66])])])]) ).
fof(c_0_129,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ less_than(lookup_slb(X6,X8),X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_67])]) ).
fof(c_0_130,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ strictly_less_than(X8,lookup_slb(X6,X8))
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])]) ).
fof(c_0_131,plain,
! [X5,X6,X7,X8] : insert_cpq(triple(X5,X6,X7),X8) = triple(insert_pqp(X5,X8),insert_slb(X6,pair(X8,bottom)),X7),
inference(variable_rename,[status(thm)],[c_0_69]) ).
fof(c_0_132,plain,
! [X6,X7,X8,X9,X10,X11,X12,X13,X14,X15] :
( ( X7 = X8
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X9 = X10
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( ~ pair_in_list(X11,X13,X15)
| pair_in_list(insert_slb(X11,pair(X12,X14)),X13,X15) )
& ( X12 != X13
| X14 != X15
| pair_in_list(insert_slb(X11,pair(X12,X14)),X13,X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])])])])]) ).
fof(c_0_133,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| contains_slb(X6,findmin_pqp_res(X5))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_71])])])]) ).
fof(c_0_134,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_slb(X6,X8) )
& ( ~ contains_slb(X10,X12)
| contains_cpq(triple(X9,X10,X11),X12) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_72])])])]) ).
fof(c_0_135,plain,
! [X5,X6,X7,X8] :
( contains_slb(X6,X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(X5,X6,bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])]) ).
fof(c_0_136,plain,
! [X5,X6,X7,X8] :
( X6 = X7
| ~ contains_slb(X5,X7)
| remove_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(remove_slb(X5,X7),pair(X6,X8)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_74])])])]) ).
fof(c_0_137,plain,
! [X5,X6,X7,X8] :
( ~ less_than(X7,X8)
| update_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(update_slb(X5,X7),pair(X6,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_75])]) ).
fof(c_0_138,plain,
! [X5,X6,X7,X8] :
( ~ strictly_less_than(X8,X7)
| update_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(update_slb(X5,X7),pair(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_76])]) ).
fof(c_0_139,plain,
! [X3,X4] : ~ ok(triple(X3,X4,bad)),
inference(variable_rename,[status(thm)],[c_0_77]) ).
fof(c_0_140,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
| contains_slb(X5,X7)
| X6 = X7 )
& ( ~ contains_slb(X9,X11)
| contains_slb(insert_slb(X9,pair(X10,X12)),X11) )
& ( X10 != X11
| contains_slb(insert_slb(X9,pair(X10,X12)),X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_78])])])])]) ).
fof(c_0_141,plain,
! [X3,X4] : findmin_cpq_eff(triple(X3,create_slb,X4)) = triple(X3,create_slb,bad),
inference(variable_rename,[status(thm)],[c_0_79]) ).
fof(c_0_142,plain,
! [X5,X6,X7,X8] :
( X6 = X7
| ~ contains_slb(X5,X7)
| lookup_slb(insert_slb(X5,pair(X6,X8)),X7) = lookup_slb(X5,X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_80])])])]) ).
fof(c_0_143,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| findmin_cpq_res(triple(X5,X6,X7)) = findmin_pqp_res(X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_81])])])]) ).
fof(c_0_144,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| X6 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_82])]) ).
fof(c_0_145,plain,
! [X3,X4] : i(triple(X3,create_slb,X4)) = create_pq,
inference(variable_rename,[status(thm)],[c_0_83]) ).
fof(c_0_146,plain,
! [X3,X4] : findmin_cpq_res(triple(X3,create_slb,X4)) = bottom,
inference(variable_rename,[status(thm)],[c_0_84]) ).
fof(c_0_147,plain,
! [X3,X4] : check_cpq(triple(X3,create_slb,X4)),
inference(variable_rename,[status(thm)],[c_0_85]) ).
fof(c_0_148,plain,
! [X4,X5,X6] :
( ~ contains_pq(X4,X6)
| X5 = X6
| remove_pq(insert_pq(X4,X5),X6) = insert_pq(remove_pq(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_86])]) ).
fof(c_0_149,plain,
! [X4,X5,X6] : lookup_slb(insert_slb(X4,pair(X5,X6)),X5) = X6,
inference(variable_rename,[status(thm)],[c_0_87]) ).
fof(c_0_150,plain,
! [X4,X5,X6] : remove_slb(insert_slb(X4,pair(X5,X6)),X5) = X4,
inference(variable_rename,[status(thm)],[c_0_88]) ).
fof(c_0_151,plain,
! [X3,X4] : ~ pair_in_list(create_slb,X3,X4),
inference(variable_rename,[status(thm)],[c_0_89]) ).
fof(c_0_152,plain,
! [X4,X5,X6] : isnonempty_slb(insert_slb(X4,pair(X5,X6))),
inference(variable_rename,[status(thm)],[c_0_90]) ).
fof(c_0_153,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ contains_pq(insert_pq(X4,X5),X6)
| contains_pq(X4,X6)
| X5 = X6 )
& ( ~ contains_pq(X7,X9)
| contains_pq(insert_pq(X7,X8),X9) )
& ( X8 != X9
| contains_pq(insert_pq(X7,X8),X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_91])])])])]) ).
fof(c_0_154,plain,
! [X4,X5,X6] : insert_pq(insert_pq(X4,X5),X6) = insert_pq(insert_pq(X4,X6),X5),
inference(variable_rename,[status(thm)],[c_0_92]) ).
fof(c_0_155,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ issmallestelement_pq(X4,X5)
| ~ contains_pq(X4,X6)
| less_than(X5,X6) )
& ( contains_pq(X7,esk1_2(X7,X8))
| issmallestelement_pq(X7,X8) )
& ( ~ less_than(X8,esk1_2(X7,X8))
| issmallestelement_pq(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_93])])])])])]) ).
fof(c_0_156,plain,
! [X3,X4] :
( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| removemin_pq_eff(X3,X4) = remove_pq(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_94])]) ).
fof(c_0_157,plain,
! [X4,X5,X6] :
( ~ succ_cpq(X4,X5)
| succ_cpq(X4,remove_cpq(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_95])])])]) ).
fof(c_0_158,plain,
! [X4,X5,X6] :
( ~ succ_cpq(X4,X5)
| succ_cpq(X4,insert_cpq(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_96])])])]) ).
fof(c_0_159,plain,
! [X3,X4] :
( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| removemin_pq_res(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_97])]) ).
fof(c_0_160,plain,
! [X3,X4] :
( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| findmin_pq_res(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_98])]) ).
fof(c_0_161,plain,
! [X3,X4] :
( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| findmin_pq_eff(X3,X4) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_99])]) ).
fof(c_0_162,plain,
! [X3,X4,X5,X6] :
( ( contains_pq(X3,X4)
| ~ pi_sharp_removemin(X3,X4) )
& ( issmallestelement_pq(X3,X4)
| ~ pi_sharp_removemin(X3,X4) )
& ( ~ contains_pq(X5,X6)
| ~ issmallestelement_pq(X5,X6)
| pi_sharp_removemin(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_100])])])])]) ).
fof(c_0_163,plain,
! [X3,X4,X5,X6] :
( ( contains_pq(X3,X4)
| ~ pi_sharp_find_min(X3,X4) )
& ( issmallestelement_pq(X3,X4)
| ~ pi_sharp_find_min(X3,X4) )
& ( ~ contains_pq(X5,X6)
| ~ issmallestelement_pq(X5,X6)
| pi_sharp_find_min(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_101])])])])]) ).
fof(c_0_164,plain,
! [X4,X5,X6] :
( ~ less_than(X4,X5)
| ~ less_than(X5,X6)
| less_than(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_102])]) ).
fof(c_0_165,plain,
! [X3,X4,X5,X6] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X5,X6)
| less_than(X6,X5)
| strictly_less_than(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_103])])])])]) ).
fof(c_0_166,plain,
! [X3,X4,X5,X6] :
( ( ~ pi_remove(X3,X4)
| pi_sharp_remove(i(X3),X4) )
& ( ~ pi_sharp_remove(i(X5),X6)
| pi_remove(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_104])])])]) ).
fof(c_0_167,plain,
! [X3,X4] :
( ~ succ_cpq(X3,X4)
| succ_cpq(X3,removemin_cpq_eff(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_105])]) ).
fof(c_0_168,plain,
! [X3,X4] :
( ~ succ_cpq(X3,X4)
| succ_cpq(X3,findmin_cpq_eff(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_106])]) ).
fof(c_0_169,plain,
! [X3,X5,X6] :
( ( succ_cpq(X3,esk4_1(X3))
| ~ phi(X3) )
& ( ok(esk4_1(X3))
| ~ phi(X3) )
& ( check_cpq(esk4_1(X3))
| ~ phi(X3) )
& ( ~ succ_cpq(X5,X6)
| ~ ok(X6)
| ~ check_cpq(X6)
| phi(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_107])])])])])]) ).
fof(c_0_170,plain,
! [X3,X4] : remove_pq(insert_pq(X3,X4),X4) = X3,
inference(variable_rename,[status(thm)],[c_0_108]) ).
fof(c_0_171,plain,
! [X3,X4,X5,X6] :
( ( ~ pi_sharp_remove(X3,X4)
| contains_pq(X3,X4) )
& ( ~ contains_pq(X5,X6)
| pi_sharp_remove(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_109])])])]) ).
fof(c_0_172,plain,
! [X3,X5,X6] :
( ( ~ pi_removemin(X3)
| pi_sharp_find_min(i(X3),esk3_1(X3)) )
& ( ~ pi_sharp_find_min(i(X5),X6)
| pi_removemin(X5) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_110])])])])]) ).
fof(c_0_173,plain,
! [X3,X5,X6] :
( ( ~ pi_find_min(X3)
| pi_sharp_find_min(i(X3),esk2_1(X3)) )
& ( ~ pi_sharp_find_min(i(X5),X6)
| pi_find_min(X5) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_111])])])])]) ).
fof(c_0_174,plain,
! [X2] : removemin_cpq_eff(X2) = remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)),
inference(variable_rename,[status(thm)],[c_0_112]) ).
fof(c_0_175,plain,
! [X3,X4] : isnonempty_pq(insert_pq(X3,X4)),
inference(variable_rename,[status(thm)],[c_0_113]) ).
fof(c_0_176,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_114]) ).
fof(c_0_177,plain,
! [X2] : ~ contains_slb(create_slb,X2),
inference(variable_rename,[status(thm)],[c_0_115]) ).
fof(c_0_178,plain,
! [X2] : ~ contains_pq(create_pq,X2),
inference(variable_rename,[status(thm)],[c_0_116]) ).
fof(c_0_179,plain,
! [X2] : succ_cpq(X2,X2),
inference(variable_rename,[status(thm)],[c_0_117]) ).
fof(c_0_180,plain,
! [X2] : less_than(X2,X2),
inference(variable_rename,[status(thm)],[c_0_118]) ).
fof(c_0_181,plain,
! [X2] : update_slb(create_slb,X2) = create_slb,
inference(variable_rename,[status(thm)],[c_0_119]) ).
fof(c_0_182,plain,
! [X2] : less_than(bottom,X2),
inference(variable_rename,[status(thm)],[c_0_120]) ).
fof(c_0_183,plain,
! [X2] : removemin_cpq_res(X2) = findmin_cpq_res(X2),
inference(variable_rename,[status(thm)],[c_0_121]) ).
fof(c_0_184,plain,
~ isnonempty_slb(create_slb),
c_0_122 ).
fof(c_0_185,plain,
~ isnonempty_pq(create_pq),
c_0_123 ).
cnf(c_0_186,plain,
( check_cpq(triple(X3,X4,X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_187,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_188,plain,
( check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,X4,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_189,plain,
( ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_190,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)
| X2 = create_slb
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_191,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_192,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)
| ~ less_than(lookup_slb(X2,X4),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_129]) ).
cnf(c_0_193,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_130]) ).
cnf(c_0_194,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[c_0_131]) ).
cnf(c_0_195,plain,
( pair_in_list(X1,X4,X5)
| X2 = X4
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_132]) ).
cnf(c_0_196,plain,
( pair_in_list(X1,X4,X5)
| X3 = X5
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_132]) ).
cnf(c_0_197,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| contains_slb(X2,findmin_pqp_res(X1))
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_133]) ).
cnf(c_0_198,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_132]) ).
cnf(c_0_199,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_200,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_135]) ).
cnf(c_0_201,plain,
( remove_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(remove_slb(X1,X4),pair(X2,X3))
| X2 = X4
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_136]) ).
cnf(c_0_202,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3))
| ~ less_than(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_203,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_138]) ).
cnf(c_0_204,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_139]) ).
cnf(c_0_205,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_206,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[c_0_141]) ).
cnf(c_0_207,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_208,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_132]) ).
cnf(c_0_209,plain,
( lookup_slb(insert_slb(X1,pair(X2,X3)),X4) = lookup_slb(X1,X4)
| X2 = X4
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_142]) ).
cnf(c_0_210,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_143]) ).
cnf(c_0_211,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_212,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_144]) ).
cnf(c_0_213,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[c_0_145]) ).
cnf(c_0_214,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_215,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_216,plain,
( remove_pq(insert_pq(X1,X2),X3) = insert_pq(remove_pq(X1,X3),X2)
| X2 = X3
| ~ contains_pq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_148]) ).
cnf(c_0_217,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_218,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_149]) ).
cnf(c_0_219,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_150]) ).
cnf(c_0_220,plain,
~ pair_in_list(create_slb,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_151]) ).
cnf(c_0_221,plain,
isnonempty_slb(insert_slb(X1,pair(X2,X3))),
inference(split_conjunct,[status(thm)],[c_0_152]) ).
cnf(c_0_222,plain,
( X1 = X2
| contains_pq(X3,X2)
| ~ contains_pq(insert_pq(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_223,plain,
insert_pq(insert_pq(X1,X2),X3) = insert_pq(insert_pq(X1,X3),X2),
inference(split_conjunct,[status(thm)],[c_0_154]) ).
cnf(c_0_224,plain,
( issmallestelement_pq(X1,X2)
| ~ less_than(X2,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_155]) ).
cnf(c_0_225,plain,
( removemin_pq_eff(X1,X2) = remove_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_156]) ).
cnf(c_0_226,plain,
( succ_cpq(X1,remove_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_157]) ).
cnf(c_0_227,plain,
( succ_cpq(X1,insert_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_158]) ).
cnf(c_0_228,plain,
( contains_pq(insert_pq(X1,X2),X3)
| ~ contains_pq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_229,plain,
( removemin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_159]) ).
cnf(c_0_230,plain,
( findmin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_160]) ).
cnf(c_0_231,plain,
( findmin_pq_eff(X1,X2) = X1
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_161]) ).
cnf(c_0_232,plain,
( pi_sharp_removemin(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_162]) ).
cnf(c_0_233,plain,
( pi_sharp_find_min(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_163]) ).
cnf(c_0_234,plain,
( less_than(X1,X2)
| ~ contains_pq(X3,X2)
| ~ issmallestelement_pq(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_155]) ).
cnf(c_0_235,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_236,plain,
( issmallestelement_pq(X1,X2)
| contains_pq(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_155]) ).
cnf(c_0_237,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_165]) ).
cnf(c_0_238,plain,
( pi_remove(X1,X2)
| ~ pi_sharp_remove(i(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_166]) ).
cnf(c_0_239,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_165]) ).
cnf(c_0_240,plain,
( contains_pq(insert_pq(X1,X2),X3)
| X2 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_241,plain,
( pi_sharp_remove(i(X1),X2)
| ~ pi_remove(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_166]) ).
cnf(c_0_242,plain,
( succ_cpq(X1,removemin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_167]) ).
cnf(c_0_243,plain,
( succ_cpq(X1,findmin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_168]) ).
cnf(c_0_244,plain,
( phi(X1)
| ~ check_cpq(X2)
| ~ ok(X2)
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_169]) ).
cnf(c_0_245,plain,
remove_pq(insert_pq(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_170]) ).
cnf(c_0_246,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_removemin(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_162]) ).
cnf(c_0_247,plain,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_removemin(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_162]) ).
cnf(c_0_248,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_163]) ).
cnf(c_0_249,plain,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_163]) ).
cnf(c_0_250,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_remove(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_171]) ).
cnf(c_0_251,plain,
( pi_sharp_remove(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_171]) ).
cnf(c_0_252,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_165]) ).
cnf(c_0_253,plain,
( pi_removemin(X1)
| ~ pi_sharp_find_min(i(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_172]) ).
cnf(c_0_254,plain,
( pi_find_min(X1)
| ~ pi_sharp_find_min(i(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_173]) ).
cnf(c_0_255,plain,
( pi_sharp_find_min(i(X1),esk3_1(X1))
| ~ pi_removemin(X1) ),
inference(split_conjunct,[status(thm)],[c_0_172]) ).
cnf(c_0_256,plain,
( pi_sharp_find_min(i(X1),esk2_1(X1))
| ~ pi_find_min(X1) ),
inference(split_conjunct,[status(thm)],[c_0_173]) ).
cnf(c_0_257,plain,
removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
inference(split_conjunct,[status(thm)],[c_0_174]) ).
cnf(c_0_258,plain,
isnonempty_pq(insert_pq(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_175]) ).
cnf(c_0_259,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_176]) ).
cnf(c_0_260,plain,
( succ_cpq(X1,esk4_1(X1))
| ~ phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_169]) ).
cnf(c_0_261,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_177]) ).
cnf(c_0_262,plain,
~ contains_pq(create_pq,X1),
inference(split_conjunct,[status(thm)],[c_0_178]) ).
cnf(c_0_263,plain,
( ok(esk4_1(X1))
| ~ phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_169]) ).
cnf(c_0_264,plain,
( check_cpq(esk4_1(X1))
| ~ phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_169]) ).
cnf(c_0_265,plain,
succ_cpq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_179]) ).
cnf(c_0_266,plain,
less_than(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_180]) ).
cnf(c_0_267,plain,
update_slb(create_slb,X1) = create_slb,
inference(split_conjunct,[status(thm)],[c_0_181]) ).
cnf(c_0_268,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[c_0_182]) ).
cnf(c_0_269,plain,
removemin_cpq_res(X1) = findmin_cpq_res(X1),
inference(split_conjunct,[status(thm)],[c_0_183]) ).
cnf(c_0_270,plain,
~ isnonempty_slb(create_slb),
inference(split_conjunct,[status(thm)],[c_0_184]) ).
cnf(c_0_271,plain,
~ isnonempty_pq(create_pq),
inference(split_conjunct,[status(thm)],[c_0_185]) ).
cnf(c_0_272,plain,
( check_cpq(triple(X3,X4,X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
c_0_186,
[final] ).
cnf(c_0_273,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
c_0_187,
[final] ).
cnf(c_0_274,plain,
( check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,X4,X5)) ),
c_0_188,
[final] ).
cnf(c_0_275,plain,
( ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ strictly_less_than(X3,X4) ),
c_0_189,
[final] ).
cnf(c_0_276,plain,
( triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) = findmin_cpq_eff(triple(X1,X2,X3))
| X2 = create_slb
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
c_0_190,
[final] ).
cnf(c_0_277,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
c_0_191,
[final] ).
cnf(c_0_278,plain,
( triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) = remove_cpq(triple(X1,X2,X3),X4)
| ~ less_than(lookup_slb(X2,X4),X4)
| ~ contains_slb(X2,X4) ),
c_0_192,
[final] ).
cnf(c_0_279,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| ~ contains_slb(X2,X4) ),
c_0_193,
[final] ).
cnf(c_0_280,plain,
triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3) = insert_cpq(triple(X1,X2,X3),X4),
c_0_194,
[final] ).
cnf(c_0_281,plain,
( pair_in_list(X1,X4,X5)
| X2 = X4
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
c_0_195,
[final] ).
cnf(c_0_282,plain,
( pair_in_list(X1,X4,X5)
| X3 = X5
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
c_0_196,
[final] ).
cnf(c_0_283,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| contains_slb(X2,findmin_pqp_res(X1))
| X2 = create_slb ),
c_0_197,
[final] ).
cnf(c_0_284,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
c_0_198,
[final] ).
cnf(c_0_285,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
c_0_199,
[final] ).
cnf(c_0_286,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
c_0_200,
[final] ).
cnf(c_0_287,plain,
( remove_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(remove_slb(X1,X4),pair(X2,X3))
| X2 = X4
| ~ contains_slb(X1,X4) ),
c_0_201,
[final] ).
cnf(c_0_288,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3))
| ~ less_than(X4,X3) ),
c_0_202,
[final] ).
cnf(c_0_289,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| ~ strictly_less_than(X3,X4) ),
c_0_203,
[final] ).
cnf(c_0_290,plain,
~ ok(triple(X1,X2,bad)),
c_0_204,
[final] ).
cnf(c_0_291,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
c_0_205,
[final] ).
cnf(c_0_292,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
c_0_206,
[final] ).
cnf(c_0_293,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
c_0_207,
[final] ).
cnf(c_0_294,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
c_0_208,
[final] ).
cnf(c_0_295,plain,
( lookup_slb(insert_slb(X1,pair(X2,X3)),X4) = lookup_slb(X1,X4)
| X2 = X4
| ~ contains_slb(X1,X4) ),
c_0_209,
[final] ).
cnf(c_0_296,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
c_0_210,
[final] ).
cnf(c_0_297,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| ~ contains_slb(X1,X4) ),
c_0_211,
[final] ).
cnf(c_0_298,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
c_0_212,
[final] ).
cnf(c_0_299,plain,
i(triple(X1,create_slb,X2)) = create_pq,
c_0_213,
[final] ).
cnf(c_0_300,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
c_0_214,
[final] ).
cnf(c_0_301,plain,
check_cpq(triple(X1,create_slb,X2)),
c_0_215,
[final] ).
cnf(c_0_302,plain,
( remove_pq(insert_pq(X1,X2),X3) = insert_pq(remove_pq(X1,X3),X2)
| X2 = X3
| ~ contains_pq(X1,X3) ),
c_0_216,
[final] ).
cnf(c_0_303,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| X2 != X4 ),
c_0_217,
[final] ).
cnf(c_0_304,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
c_0_218,
[final] ).
cnf(c_0_305,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
c_0_219,
[final] ).
cnf(c_0_306,plain,
~ pair_in_list(create_slb,X1,X2),
c_0_220,
[final] ).
cnf(c_0_307,plain,
isnonempty_slb(insert_slb(X1,pair(X2,X3))),
c_0_221,
[final] ).
cnf(c_0_308,plain,
( X1 = X2
| contains_pq(X3,X2)
| ~ contains_pq(insert_pq(X3,X1),X2) ),
c_0_222,
[final] ).
cnf(c_0_309,plain,
insert_pq(insert_pq(X1,X2),X3) = insert_pq(insert_pq(X1,X3),X2),
c_0_223,
[final] ).
cnf(c_0_310,plain,
( issmallestelement_pq(X1,X2)
| ~ less_than(X2,esk1_2(X1,X2)) ),
c_0_224,
[final] ).
cnf(c_0_311,plain,
( removemin_pq_eff(X1,X2) = remove_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
c_0_225,
[final] ).
cnf(c_0_312,plain,
( succ_cpq(X1,remove_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
c_0_226,
[final] ).
cnf(c_0_313,plain,
( succ_cpq(X1,insert_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
c_0_227,
[final] ).
cnf(c_0_314,plain,
( contains_pq(insert_pq(X1,X2),X3)
| ~ contains_pq(X1,X3) ),
c_0_228,
[final] ).
cnf(c_0_315,plain,
( removemin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
c_0_229,
[final] ).
cnf(c_0_316,plain,
( findmin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
c_0_230,
[final] ).
cnf(c_0_317,plain,
( findmin_pq_eff(X1,X2) = X1
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
c_0_231,
[final] ).
cnf(c_0_318,plain,
( pi_sharp_removemin(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
c_0_232,
[final] ).
cnf(c_0_319,plain,
( pi_sharp_find_min(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
c_0_233,
[final] ).
cnf(c_0_320,plain,
( less_than(X1,X2)
| ~ contains_pq(X3,X2)
| ~ issmallestelement_pq(X3,X1) ),
c_0_234,
[final] ).
cnf(c_0_321,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
c_0_235,
[final] ).
cnf(c_0_322,plain,
( issmallestelement_pq(X1,X2)
| contains_pq(X1,esk1_2(X1,X2)) ),
c_0_236,
[final] ).
cnf(c_0_323,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
c_0_237,
[final] ).
cnf(c_0_324,plain,
( pi_remove(X1,X2)
| ~ pi_sharp_remove(i(X1),X2) ),
c_0_238,
[final] ).
cnf(c_0_325,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
c_0_239,
[final] ).
cnf(c_0_326,plain,
( contains_pq(insert_pq(X1,X2),X3)
| X2 != X3 ),
c_0_240,
[final] ).
cnf(c_0_327,plain,
( pi_sharp_remove(i(X1),X2)
| ~ pi_remove(X1,X2) ),
c_0_241,
[final] ).
cnf(c_0_328,plain,
( succ_cpq(X1,removemin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
c_0_242,
[final] ).
cnf(c_0_329,plain,
( succ_cpq(X1,findmin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
c_0_243,
[final] ).
cnf(c_0_330,plain,
( phi(X1)
| ~ check_cpq(X2)
| ~ ok(X2)
| ~ succ_cpq(X1,X2) ),
c_0_244,
[final] ).
cnf(c_0_331,plain,
remove_pq(insert_pq(X1,X2),X2) = X1,
c_0_245,
[final] ).
cnf(c_0_332,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_removemin(X1,X2) ),
c_0_246,
[final] ).
cnf(c_0_333,plain,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_removemin(X1,X2) ),
c_0_247,
[final] ).
cnf(c_0_334,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
c_0_248,
[final] ).
cnf(c_0_335,plain,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
c_0_249,
[final] ).
cnf(c_0_336,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_remove(X1,X2) ),
c_0_250,
[final] ).
cnf(c_0_337,plain,
( pi_sharp_remove(X1,X2)
| ~ contains_pq(X1,X2) ),
c_0_251,
[final] ).
cnf(c_0_338,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
c_0_252,
[final] ).
cnf(c_0_339,plain,
( pi_removemin(X1)
| ~ pi_sharp_find_min(i(X1),X2) ),
c_0_253,
[final] ).
cnf(c_0_340,plain,
( pi_find_min(X1)
| ~ pi_sharp_find_min(i(X1),X2) ),
c_0_254,
[final] ).
cnf(c_0_341,plain,
( pi_sharp_find_min(i(X1),esk3_1(X1))
| ~ pi_removemin(X1) ),
c_0_255,
[final] ).
cnf(c_0_342,plain,
( pi_sharp_find_min(i(X1),esk2_1(X1))
| ~ pi_find_min(X1) ),
c_0_256,
[final] ).
cnf(c_0_343,plain,
remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)) = removemin_cpq_eff(X1),
c_0_257,
[final] ).
cnf(c_0_344,plain,
isnonempty_pq(insert_pq(X1,X2)),
c_0_258,
[final] ).
cnf(c_0_345,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
c_0_259,
[final] ).
cnf(c_0_346,plain,
( succ_cpq(X1,esk4_1(X1))
| ~ phi(X1) ),
c_0_260,
[final] ).
cnf(c_0_347,plain,
~ contains_slb(create_slb,X1),
c_0_261,
[final] ).
cnf(c_0_348,plain,
~ contains_pq(create_pq,X1),
c_0_262,
[final] ).
cnf(c_0_349,plain,
( ok(esk4_1(X1))
| ~ phi(X1) ),
c_0_263,
[final] ).
cnf(c_0_350,plain,
( check_cpq(esk4_1(X1))
| ~ phi(X1) ),
c_0_264,
[final] ).
cnf(c_0_351,plain,
succ_cpq(X1,X1),
c_0_265,
[final] ).
cnf(c_0_352,plain,
less_than(X1,X1),
c_0_266,
[final] ).
cnf(c_0_353,plain,
update_slb(create_slb,X1) = create_slb,
c_0_267,
[final] ).
cnf(c_0_354,plain,
less_than(bottom,X1),
c_0_268,
[final] ).
cnf(c_0_355,plain,
removemin_cpq_res(X1) = findmin_cpq_res(X1),
c_0_269,
[final] ).
cnf(c_0_356,plain,
~ isnonempty_slb(create_slb),
c_0_270,
[final] ).
cnf(c_0_357,plain,
~ isnonempty_pq(create_pq),
c_0_271,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_272_0,axiom,
( check_cpq(triple(X3,X4,X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_272_1,axiom,
( ~ less_than(X1,X2)
| check_cpq(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_272_2,axiom,
( ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))
| ~ less_than(X1,X2)
| check_cpq(triple(X3,X4,X5)) ),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_274_0,axiom,
( check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,X4,X5)) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_274_1,axiom,
( ~ less_than(X1,X2)
| check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))
| ~ check_cpq(triple(X3,X4,X5)) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_274_2,axiom,
( ~ check_cpq(triple(X3,X4,X5))
| ~ less_than(X1,X2)
| check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_275_0,axiom,
( ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ strictly_less_than(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_275]) ).
cnf(c_0_275_1,axiom,
( ~ strictly_less_than(X3,X4)
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) ),
inference(literals_permutation,[status(thm)],[c_0_275]) ).
cnf(c_0_276_0,axiom,
( triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) = findmin_cpq_eff(triple(X1,X2,X3))
| X2 = create_slb
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_276_1,axiom,
( X2 = create_slb
| triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) = findmin_cpq_eff(triple(X1,X2,X3))
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_276_2,axiom,
( ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| X2 = create_slb
| triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) = findmin_cpq_eff(triple(X1,X2,X3))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_276_3,axiom,
( ~ contains_slb(X2,findmin_pqp_res(X1))
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| X2 = create_slb
| triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) = findmin_cpq_eff(triple(X1,X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_277_0,axiom,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_277_1,axiom,
( X2 = create_slb
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_277_2,axiom,
( ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| X2 = create_slb
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_277_3,axiom,
( ~ contains_slb(X2,findmin_pqp_res(X1))
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| X2 = create_slb
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_278_0,axiom,
( triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) = remove_cpq(triple(X1,X2,X3),X4)
| ~ less_than(lookup_slb(X2,X4),X4)
| ~ contains_slb(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_278_1,axiom,
( ~ less_than(lookup_slb(X2,X4),X4)
| triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) = remove_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_278_2,axiom,
( ~ contains_slb(X2,X4)
| ~ less_than(lookup_slb(X2,X4),X4)
| triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) = remove_cpq(triple(X1,X2,X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_279_0,axiom,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| ~ contains_slb(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_1,axiom,
( ~ strictly_less_than(X4,lookup_slb(X2,X4))
| remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ contains_slb(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_2,axiom,
( ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_281_0,axiom,
( pair_in_list(X1,X4,X5)
| X2 = X4
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_281_1,axiom,
( X2 = X4
| pair_in_list(X1,X4,X5)
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_281_2,axiom,
( ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X2 = X4
| pair_in_list(X1,X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_282_0,axiom,
( pair_in_list(X1,X4,X5)
| X3 = X5
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_282_1,axiom,
( X3 = X5
| pair_in_list(X1,X4,X5)
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_282_2,axiom,
( ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 = X5
| pair_in_list(X1,X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_283_0,axiom,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| contains_slb(X2,findmin_pqp_res(X1))
| X2 = create_slb ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_283_1,axiom,
( contains_slb(X2,findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_283_2,axiom,
( X2 = create_slb
| contains_slb(X2,findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_284_0,axiom,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_284_1,axiom,
( ~ pair_in_list(X1,X4,X5)
| pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_285_0,axiom,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_285_1,axiom,
( ~ contains_cpq(triple(X3,X1,X4),X2)
| contains_slb(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_286_0,axiom,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_286_1,axiom,
( contains_slb(X2,X4)
| remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_287_0,axiom,
( remove_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(remove_slb(X1,X4),pair(X2,X3))
| X2 = X4
| ~ contains_slb(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_287_1,axiom,
( X2 = X4
| remove_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(remove_slb(X1,X4),pair(X2,X3))
| ~ contains_slb(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_287_2,axiom,
( ~ contains_slb(X1,X4)
| X2 = X4
| remove_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(remove_slb(X1,X4),pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_288_0,axiom,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3))
| ~ less_than(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_288_1,axiom,
( ~ less_than(X4,X3)
| update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_289_0,axiom,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| ~ strictly_less_than(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_289_1,axiom,
( ~ strictly_less_than(X3,X4)
| update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_291_0,axiom,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_291_1,axiom,
( contains_slb(X3,X2)
| X1 = X2
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_291_2,axiom,
( ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2)
| contains_slb(X3,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_293_0,axiom,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_1,axiom,
( ~ contains_slb(X2,X4)
| contains_cpq(triple(X1,X2,X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_294_0,axiom,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_1,axiom,
( X3 != X5
| pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X2 != X4 ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_2,axiom,
( X2 != X4
| X3 != X5
| pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_295_0,axiom,
( lookup_slb(insert_slb(X1,pair(X2,X3)),X4) = lookup_slb(X1,X4)
| X2 = X4
| ~ contains_slb(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_1,axiom,
( X2 = X4
| lookup_slb(insert_slb(X1,pair(X2,X3)),X4) = lookup_slb(X1,X4)
| ~ contains_slb(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_2,axiom,
( ~ contains_slb(X1,X4)
| X2 = X4
| lookup_slb(insert_slb(X1,pair(X2,X3)),X4) = lookup_slb(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_296_0,axiom,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_296_1,axiom,
( X2 = create_slb
| findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_297_0,axiom,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| ~ contains_slb(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_1,axiom,
( ~ contains_slb(X1,X4)
| contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_298_0,axiom,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_298_1,axiom,
( ok(triple(X2,X3,X1))
| X1 = bad ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_302_0,axiom,
( remove_pq(insert_pq(X1,X2),X3) = insert_pq(remove_pq(X1,X3),X2)
| X2 = X3
| ~ contains_pq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_302_1,axiom,
( X2 = X3
| remove_pq(insert_pq(X1,X2),X3) = insert_pq(remove_pq(X1,X3),X2)
| ~ contains_pq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_302_2,axiom,
( ~ contains_pq(X1,X3)
| X2 = X3
| remove_pq(insert_pq(X1,X2),X3) = insert_pq(remove_pq(X1,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_303_0,axiom,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| X2 != X4 ),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_303_1,axiom,
( X2 != X4
| contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_308_0,axiom,
( X1 = X2
| contains_pq(X3,X2)
| ~ contains_pq(insert_pq(X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_308_1,axiom,
( contains_pq(X3,X2)
| X1 = X2
| ~ contains_pq(insert_pq(X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_308_2,axiom,
( ~ contains_pq(insert_pq(X3,X1),X2)
| contains_pq(X3,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_310_0,axiom,
( issmallestelement_pq(X1,X2)
| ~ less_than(X2,sk1_esk1_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_310]) ).
cnf(c_0_310_1,axiom,
( ~ less_than(X2,sk1_esk1_2(X1,X2))
| issmallestelement_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_310]) ).
cnf(c_0_311_0,axiom,
( removemin_pq_eff(X1,X2) = remove_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_311_1,axiom,
( ~ issmallestelement_pq(X1,X2)
| removemin_pq_eff(X1,X2) = remove_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_311_2,axiom,
( ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| removemin_pq_eff(X1,X2) = remove_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_312_0,axiom,
( succ_cpq(X1,remove_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_312_1,axiom,
( ~ succ_cpq(X1,X2)
| succ_cpq(X1,remove_cpq(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_313_0,axiom,
( succ_cpq(X1,insert_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_313_1,axiom,
( ~ succ_cpq(X1,X2)
| succ_cpq(X1,insert_cpq(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_314_0,axiom,
( contains_pq(insert_pq(X1,X2),X3)
| ~ contains_pq(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_314]) ).
cnf(c_0_314_1,axiom,
( ~ contains_pq(X1,X3)
| contains_pq(insert_pq(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_314]) ).
cnf(c_0_315_0,axiom,
( removemin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_315_1,axiom,
( ~ issmallestelement_pq(X1,X2)
| removemin_pq_res(X1,X2) = X2
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_315_2,axiom,
( ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| removemin_pq_res(X1,X2) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_316_0,axiom,
( findmin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_316_1,axiom,
( ~ issmallestelement_pq(X1,X2)
| findmin_pq_res(X1,X2) = X2
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_316_2,axiom,
( ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| findmin_pq_res(X1,X2) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_317_0,axiom,
( findmin_pq_eff(X1,X2) = X1
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_317_1,axiom,
( ~ issmallestelement_pq(X1,X2)
| findmin_pq_eff(X1,X2) = X1
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_317_2,axiom,
( ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| findmin_pq_eff(X1,X2) = X1 ),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_318_0,axiom,
( pi_sharp_removemin(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_318_1,axiom,
( ~ issmallestelement_pq(X1,X2)
| pi_sharp_removemin(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_318_2,axiom,
( ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| pi_sharp_removemin(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_319_0,axiom,
( pi_sharp_find_min(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_319_1,axiom,
( ~ issmallestelement_pq(X1,X2)
| pi_sharp_find_min(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_319_2,axiom,
( ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| pi_sharp_find_min(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_320_0,axiom,
( less_than(X1,X2)
| ~ contains_pq(X3,X2)
| ~ issmallestelement_pq(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_320]) ).
cnf(c_0_320_1,axiom,
( ~ contains_pq(X3,X2)
| less_than(X1,X2)
| ~ issmallestelement_pq(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_320]) ).
cnf(c_0_320_2,axiom,
( ~ issmallestelement_pq(X3,X1)
| ~ contains_pq(X3,X2)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_320]) ).
cnf(c_0_321_0,axiom,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_321]) ).
cnf(c_0_321_1,axiom,
( ~ less_than(X3,X2)
| less_than(X1,X2)
| ~ less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_321]) ).
cnf(c_0_321_2,axiom,
( ~ less_than(X1,X3)
| ~ less_than(X3,X2)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_321]) ).
cnf(c_0_322_0,axiom,
( issmallestelement_pq(X1,X2)
| contains_pq(X1,sk1_esk1_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_322]) ).
cnf(c_0_322_1,axiom,
( contains_pq(X1,sk1_esk1_2(X1,X2))
| issmallestelement_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_322]) ).
cnf(c_0_323_0,axiom,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_323_1,axiom,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_323_2,axiom,
( ~ less_than(X1,X2)
| less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_324_0,axiom,
( pi_remove(X1,X2)
| ~ pi_sharp_remove(i(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_324_1,axiom,
( ~ pi_sharp_remove(i(X1),X2)
| pi_remove(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_325_0,axiom,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_325_1,axiom,
( ~ less_than(X2,X1)
| ~ strictly_less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_326_0,axiom,
( contains_pq(insert_pq(X1,X2),X3)
| X2 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_326]) ).
cnf(c_0_326_1,axiom,
( X2 != X3
| contains_pq(insert_pq(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_326]) ).
cnf(c_0_327_0,axiom,
( pi_sharp_remove(i(X1),X2)
| ~ pi_remove(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_327]) ).
cnf(c_0_327_1,axiom,
( ~ pi_remove(X1,X2)
| pi_sharp_remove(i(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_327]) ).
cnf(c_0_328_0,axiom,
( succ_cpq(X1,removemin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_328]) ).
cnf(c_0_328_1,axiom,
( ~ succ_cpq(X1,X2)
| succ_cpq(X1,removemin_cpq_eff(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_328]) ).
cnf(c_0_329_0,axiom,
( succ_cpq(X1,findmin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_329_1,axiom,
( ~ succ_cpq(X1,X2)
| succ_cpq(X1,findmin_cpq_eff(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_330_0,axiom,
( phi(X1)
| ~ check_cpq(X2)
| ~ ok(X2)
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_330_1,axiom,
( ~ check_cpq(X2)
| phi(X1)
| ~ ok(X2)
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_330_2,axiom,
( ~ ok(X2)
| ~ check_cpq(X2)
| phi(X1)
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_330_3,axiom,
( ~ succ_cpq(X1,X2)
| ~ ok(X2)
| ~ check_cpq(X2)
| phi(X1) ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_332_0,axiom,
( contains_pq(X1,X2)
| ~ pi_sharp_removemin(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_332]) ).
cnf(c_0_332_1,axiom,
( ~ pi_sharp_removemin(X1,X2)
| contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_332]) ).
cnf(c_0_333_0,axiom,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_removemin(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_333]) ).
cnf(c_0_333_1,axiom,
( ~ pi_sharp_removemin(X1,X2)
| issmallestelement_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_333]) ).
cnf(c_0_334_0,axiom,
( contains_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_334]) ).
cnf(c_0_334_1,axiom,
( ~ pi_sharp_find_min(X1,X2)
| contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_334]) ).
cnf(c_0_335_0,axiom,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_335]) ).
cnf(c_0_335_1,axiom,
( ~ pi_sharp_find_min(X1,X2)
| issmallestelement_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_335]) ).
cnf(c_0_336_0,axiom,
( contains_pq(X1,X2)
| ~ pi_sharp_remove(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_336]) ).
cnf(c_0_336_1,axiom,
( ~ pi_sharp_remove(X1,X2)
| contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_336]) ).
cnf(c_0_337_0,axiom,
( pi_sharp_remove(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_337]) ).
cnf(c_0_337_1,axiom,
( ~ contains_pq(X1,X2)
| pi_sharp_remove(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_337]) ).
cnf(c_0_338_0,axiom,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_338]) ).
cnf(c_0_338_1,axiom,
( ~ strictly_less_than(X1,X2)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_338]) ).
cnf(c_0_339_0,axiom,
( pi_removemin(X1)
| ~ pi_sharp_find_min(i(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_339]) ).
cnf(c_0_339_1,axiom,
( ~ pi_sharp_find_min(i(X1),X2)
| pi_removemin(X1) ),
inference(literals_permutation,[status(thm)],[c_0_339]) ).
cnf(c_0_340_0,axiom,
( pi_find_min(X1)
| ~ pi_sharp_find_min(i(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_340]) ).
cnf(c_0_340_1,axiom,
( ~ pi_sharp_find_min(i(X1),X2)
| pi_find_min(X1) ),
inference(literals_permutation,[status(thm)],[c_0_340]) ).
cnf(c_0_341_0,axiom,
( pi_sharp_find_min(i(X1),sk1_esk3_1(X1))
| ~ pi_removemin(X1) ),
inference(literals_permutation,[status(thm)],[c_0_341]) ).
cnf(c_0_341_1,axiom,
( ~ pi_removemin(X1)
| pi_sharp_find_min(i(X1),sk1_esk3_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_341]) ).
cnf(c_0_342_0,axiom,
( pi_sharp_find_min(i(X1),sk1_esk2_1(X1))
| ~ pi_find_min(X1) ),
inference(literals_permutation,[status(thm)],[c_0_342]) ).
cnf(c_0_342_1,axiom,
( ~ pi_find_min(X1)
| pi_sharp_find_min(i(X1),sk1_esk2_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_342]) ).
cnf(c_0_345_0,axiom,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_345]) ).
cnf(c_0_345_1,axiom,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_345]) ).
cnf(c_0_346_0,axiom,
( succ_cpq(X1,sk1_esk4_1(X1))
| ~ phi(X1) ),
inference(literals_permutation,[status(thm)],[c_0_346]) ).
cnf(c_0_346_1,axiom,
( ~ phi(X1)
| succ_cpq(X1,sk1_esk4_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_346]) ).
cnf(c_0_349_0,axiom,
( ok(sk1_esk4_1(X1))
| ~ phi(X1) ),
inference(literals_permutation,[status(thm)],[c_0_349]) ).
cnf(c_0_349_1,axiom,
( ~ phi(X1)
| ok(sk1_esk4_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_349]) ).
cnf(c_0_350_0,axiom,
( check_cpq(sk1_esk4_1(X1))
| ~ phi(X1) ),
inference(literals_permutation,[status(thm)],[c_0_350]) ).
cnf(c_0_350_1,axiom,
( ~ phi(X1)
| check_cpq(sk1_esk4_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_350]) ).
cnf(c_0_290_0,axiom,
~ ok(triple(X1,X2,bad)),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_306_0,axiom,
~ pair_in_list(create_slb,X1,X2),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
cnf(c_0_347_0,axiom,
~ contains_slb(create_slb,X1),
inference(literals_permutation,[status(thm)],[c_0_347]) ).
cnf(c_0_348_0,axiom,
~ contains_pq(create_pq,X1),
inference(literals_permutation,[status(thm)],[c_0_348]) ).
cnf(c_0_356_0,axiom,
~ isnonempty_slb(create_slb),
inference(literals_permutation,[status(thm)],[c_0_356]) ).
cnf(c_0_357_0,axiom,
~ isnonempty_pq(create_pq),
inference(literals_permutation,[status(thm)],[c_0_357]) ).
cnf(c_0_273_0,axiom,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_280_0,axiom,
triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3) = insert_cpq(triple(X1,X2,X3),X4),
inference(literals_permutation,[status(thm)],[c_0_280]) ).
cnf(c_0_292_0,axiom,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_299_0,axiom,
i(triple(X1,create_slb,X2)) = create_pq,
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_300_0,axiom,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_301_0,axiom,
check_cpq(triple(X1,create_slb,X2)),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_304_0,axiom,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(literals_permutation,[status(thm)],[c_0_304]) ).
cnf(c_0_305_0,axiom,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_307_0,axiom,
isnonempty_slb(insert_slb(X1,pair(X2,X3))),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_309_0,axiom,
insert_pq(insert_pq(X1,X2),X3) = insert_pq(insert_pq(X1,X3),X2),
inference(literals_permutation,[status(thm)],[c_0_309]) ).
cnf(c_0_331_0,axiom,
remove_pq(insert_pq(X1,X2),X2) = X1,
inference(literals_permutation,[status(thm)],[c_0_331]) ).
cnf(c_0_343_0,axiom,
remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)) = removemin_cpq_eff(X1),
inference(literals_permutation,[status(thm)],[c_0_343]) ).
cnf(c_0_344_0,axiom,
isnonempty_pq(insert_pq(X1,X2)),
inference(literals_permutation,[status(thm)],[c_0_344]) ).
cnf(c_0_351_0,axiom,
succ_cpq(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_351]) ).
cnf(c_0_352_0,axiom,
less_than(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_352]) ).
cnf(c_0_353_0,axiom,
update_slb(create_slb,X1) = create_slb,
inference(literals_permutation,[status(thm)],[c_0_353]) ).
cnf(c_0_354_0,axiom,
less_than(bottom,X1),
inference(literals_permutation,[status(thm)],[c_0_354]) ).
cnf(c_0_355_0,axiom,
removemin_cpq_res(X1) = findmin_cpq_res(X1),
inference(literals_permutation,[status(thm)],[c_0_355]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
=> ( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> ? [X4] :
( pi_sharp_find_min(i(triple(X1,X2,X3)),X4)
& findmin_cpq_res(triple(X1,X2,X3)) = findmin_pq_res(i(triple(X1,X2,X3)),X4) ) ) ),
file('<stdin>',co4) ).
fof(c_0_1_002,lemma,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('<stdin>',main4_l7) ).
fof(c_0_2_003,negated_conjecture,
~ ! [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
=> ( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> ? [X4] :
( pi_sharp_find_min(i(triple(X1,X2,X3)),X4)
& findmin_cpq_res(triple(X1,X2,X3)) = findmin_pq_res(i(triple(X1,X2,X3)),X4) ) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_3_004,lemma,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
c_0_1 ).
fof(c_0_4_005,negated_conjecture,
! [X8] :
( pi_find_min(triple(esk1_0,esk2_0,esk3_0))
& phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ( ~ pi_sharp_find_min(i(triple(esk1_0,esk2_0,esk3_0)),X8)
| findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)) != findmin_pq_res(i(triple(esk1_0,esk2_0,esk3_0)),X8) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_5_006,lemma,
! [X4,X5,X6] :
( ~ phi(findmin_cpq_eff(triple(X4,X5,X6)))
| pi_sharp_find_min(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6_007,negated_conjecture,
( findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)) != findmin_pq_res(i(triple(esk1_0,esk2_0,esk3_0)),X1)
| ~ pi_sharp_find_min(i(triple(esk1_0,esk2_0,esk3_0)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,lemma,
( pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9_010,negated_conjecture,
pi_find_min(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10_011,negated_conjecture,
( findmin_pq_res(i(triple(esk1_0,esk2_0,esk3_0)),X1) != findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))
| ~ pi_sharp_find_min(i(triple(esk1_0,esk2_0,esk3_0)),X1) ),
c_0_6,
[final] ).
cnf(c_0_11_012,lemma,
( pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
c_0_7,
[final] ).
cnf(c_0_12_013,negated_conjecture,
phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
c_0_8,
[final] ).
cnf(c_0_13_014,negated_conjecture,
pi_find_min(triple(esk1_0,esk2_0,esk3_0)),
c_0_9,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_177,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6031af.p',c_0_11) ).
cnf(c_262,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(copy,[status(esa)],[c_177]) ).
cnf(c_277,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(copy,[status(esa)],[c_262]) ).
cnf(c_282,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(copy,[status(esa)],[c_277]) ).
cnf(c_284,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(copy,[status(esa)],[c_282]) ).
cnf(c_809,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(copy,[status(esa)],[c_284]) ).
cnf(c_48,plain,
( contains_pq(X0,X1)
| ~ pi_sharp_find_min(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6031af.p',c_0_334_1) ).
cnf(c_553,plain,
( contains_pq(X0,X1)
| ~ pi_sharp_find_min(X0,X1) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_953,plain,
( contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(resolution,[status(thm)],[c_809,c_553]) ).
cnf(c_956,plain,
( contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(rewriting,[status(thm)],[c_953]) ).
cnf(c_90,plain,
( findmin_pq_res(X0,X1) = X1
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6031af.p',c_0_316_2) ).
cnf(c_637,plain,
( findmin_pq_res(X0,X1) = X1
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_638,plain,
( ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| findmin_pq_res(X0,X1) = X1 ),
inference(rewriting,[status(thm)],[c_637]) ).
cnf(c_981,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| findmin_pq_res(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(resolution,[status(thm)],[c_956,c_638]) ).
cnf(c_990,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| findmin_pq_res(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(rewriting,[status(thm)],[c_981]) ).
cnf(c_46,plain,
( issmallestelement_pq(X0,X1)
| ~ pi_sharp_find_min(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6031af.p',c_0_335_1) ).
cnf(c_549,plain,
( issmallestelement_pq(X0,X1)
| ~ pi_sharp_find_min(X0,X1) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_550,plain,
( ~ pi_sharp_find_min(X0,X1)
| issmallestelement_pq(X0,X1) ),
inference(rewriting,[status(thm)],[c_549]) ).
cnf(c_954,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(resolution,[status(thm)],[c_809,c_550]) ).
cnf(c_955,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(rewriting,[status(thm)],[c_954]) ).
cnf(c_1436,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| findmin_pq_res(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_990,c_955]) ).
cnf(c_1437,plain,
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| findmin_pq_res(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(rewriting,[status(thm)],[c_1436]) ).
cnf(c_176,negated_conjecture,
( ~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0)
| findmin_pq_res(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0) != findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_6031af.p',c_0_10) ).
cnf(c_264,negated_conjecture,
( ~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0)
| findmin_pq_res(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0) != findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ),
inference(copy,[status(esa)],[c_176]) ).
cnf(c_276,negated_conjecture,
( ~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0)
| findmin_pq_res(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0) != findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ),
inference(copy,[status(esa)],[c_264]) ).
cnf(c_283,negated_conjecture,
( ~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0)
| findmin_pq_res(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0) != findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ),
inference(copy,[status(esa)],[c_276]) ).
cnf(c_287,negated_conjecture,
( ~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0)
| findmin_pq_res(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0) != findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ),
inference(copy,[status(esa)],[c_283]) ).
cnf(c_815,negated_conjecture,
( ~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0)
| findmin_pq_res(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),X0) != findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ),
inference(copy,[status(esa)],[c_287]) ).
cnf(c_1448,plain,
( ~ phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)))
| ~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))) ),
inference(resolution,[status(thm)],[c_1437,c_815]) ).
cnf(c_1449,plain,
( ~ phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)))
| ~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))) ),
inference(rewriting,[status(thm)],[c_1448]) ).
cnf(c_178,negated_conjecture,
phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
file('/export/starexec/sandbox/tmp/iprover_modulo_6031af.p',c_0_12) ).
cnf(c_266,negated_conjecture,
phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(copy,[status(esa)],[c_178]) ).
cnf(c_278,negated_conjecture,
phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(copy,[status(esa)],[c_266]) ).
cnf(c_281,negated_conjecture,
phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(copy,[status(esa)],[c_278]) ).
cnf(c_285,negated_conjecture,
phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(copy,[status(esa)],[c_281]) ).
cnf(c_811,plain,
phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(copy,[status(esa)],[c_285]) ).
cnf(c_1452,plain,
~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(forward_subsumption_resolution,[status(thm)],[c_1449,c_811]) ).
cnf(c_1453,plain,
~ pi_sharp_find_min(i(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),findmin_cpq_res(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(rewriting,[status(thm)],[c_1452]) ).
cnf(c_1455,plain,
~ phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(resolution,[status(thm)],[c_1453,c_809]) ).
cnf(c_1456,plain,
~ phi(findmin_cpq_eff(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0))),
inference(rewriting,[status(thm)],[c_1455]) ).
cnf(c_1458,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1456,c_811]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : iprover_modulo %s %d
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 09:34:11 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Running in mono-core mode
% 0.21/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42 % FOF problem with conjecture
% 0.21/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b377d7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6031af.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6cb338 | grep -v "SZS"
% 0.21/0.45
% 0.21/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % ------ iProver source info
% 0.21/0.45
% 0.21/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.45 % git: non_committed_changes: true
% 0.21/0.45 % git: last_make_outside_of_git: true
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % ------ Input Options
% 0.21/0.45
% 0.21/0.45 % --out_options all
% 0.21/0.45 % --tptp_safe_out true
% 0.21/0.45 % --problem_path ""
% 0.21/0.45 % --include_path ""
% 0.21/0.45 % --clausifier .//eprover
% 0.21/0.45 % --clausifier_options --tstp-format
% 0.21/0.45 % --stdin false
% 0.21/0.45 % --dbg_backtrace false
% 0.21/0.45 % --dbg_dump_prop_clauses false
% 0.21/0.45 % --dbg_dump_prop_clauses_file -
% 0.21/0.45 % --dbg_out_stat false
% 0.21/0.45
% 0.21/0.45 % ------ General Options
% 0.21/0.45
% 0.21/0.45 % --fof false
% 0.21/0.45 % --time_out_real 150.
% 0.21/0.45 % --time_out_prep_mult 0.2
% 0.21/0.45 % --time_out_virtual -1.
% 0.21/0.45 % --schedule none
% 0.21/0.45 % --ground_splitting input
% 0.21/0.45 % --splitting_nvd 16
% 0.21/0.45 % --non_eq_to_eq false
% 0.21/0.45 % --prep_gs_sim true
% 0.21/0.45 % --prep_unflatten false
% 0.21/0.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b377d7.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45 % ------ Parsing...%
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % ------ Statistics
% 0.21/0.45
% 0.21/0.45 % ------ General
% 0.21/0.45
% 0.21/0.45 % num_of_input_clauses: 66
% 0.21/0.45 % num_of_input_neg_conjectures: 0
% 0.21/0.45 % num_of_splits: 0
% 0.21/0.45 % num_of_split_atoms: 0
% 0.21/0.45 % num_of_sem_filtered_clauses: 0
% 0.21/0.45 % num_of_subtypes: 0
% 0.21/0.45 % monotx_restored_types: 0
% 0.21/0.45 % sat_num_of_epr_types: 0
% 0.21/0.45 % sat_num_of_non_cyclic_types: 0
% 0.21/0.45 % sat_guarded_non_collapsed_types: 0
% 0.21/0.45 % is_epr: 0
% 0.21/0.45 % is_horn: 0
% 0.21/0.45 % has_eq: 0
% 0.21/0.45 % num_pure_diseq_elim: 0
% 0.21/0.45 % simp_replaced_by: 0
% 0.21/0.45 % res_preprocessed: 0
% 0.21/0.45 % prep_upred: 0
% 0.21/0.45 % prep_unflattend: 0
% 0.21/0.45 % pred_elim_cands: 0
% 0.21/0.45 % pred_elim: 0
% 0.21/0.45 % pred_elim_cl: 0
% 0.21/0.45 % pred_elim_cycles: 0
% 0.21/0.45 % forced_gc_time: 0
% 0.21/0.45 % gc_basic_clause_elim: 0
% 0.21/0.45 % parsing_time: 0.
% 0.21/0.45 % sem_filter_time: 0.
% 0.21/0.45 % pred_elim_time: 0.
% 0.21/0.45 % out_proof_time: 0.
% 0.21/0.45 % monotx_time: 0.
% 0.21/0.45 % subtype_inf_time: 0.
% 0.21/0.45 % unif_index_cands_time: 0.
% 0.21/0.45 % unFatal error: exception Failure("Parse error in: /export/starexec/sandbox/tmp/iprover_modulo_6031af.p line: 69 near token: '!='")
% 0.21/0.45 if_index_add_time: 0.
% 0.21/0.45 % total_time: 0.02
% 0.21/0.45 % num_of_symbols: 72
% 0.21/0.45 % num_of_terms: 241
% 0.21/0.45
% 0.21/0.45 % ------ Propositional Solver
% 0.21/0.45
% 0.21/0.45 % prop_solver_calls: 0
% 0.21/0.45 % prop_fast_solver_calls: 0
% 0.21/0.45 % prop_num_of_clauses: 0
% 0.21/0.45 % prop_preprocess_simplified: 0
% 0.21/0.45 % prop_fo_subsumed: 0
% 0.21/0.45 % prop_solver_time: 0.
% 0.21/0.45 % prop_fast_solver_time: 0.
% 0.21/0.45 % prop_unsat_core_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ QBF
% 0.21/0.45
% 0.21/0.45 % qbf_q_res: 0
% 0.21/0.45 % qbf_num_tautologies: 0
% 0.21/0.45 % qbf_prep_cycles: 0
% 0.21/0.45
% 0.21/0.45 % ------ BMC1
% 0.21/0.45
% 0.21/0.45 % bmc1_current_bound: -1
% 0.21/0.45 % bmc1_last_solved_bound: -1
% 0.21/0.45 % bmc1_unsat_core_size: -1
% 0.21/0.45 % bmc1_unsat_core_parents_size: -1
% 0.21/0.45 % bmc1_merge_next_fun: 0
% 0.21/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation
% 0.21/0.45
% 0.21/0.45 % inst_num_of_clauses: undef
% 0.21/0.45 % inst_num_in_passive: undef
% 0.21/0.45 % inst_num_in_active: 0
% 0.21/0.45 % inst_num_in_unprocessed: 0
% 0.21/0.45 % inst_num_of_loops: 0
% 0.21/0.45 % inst_num_of_learning_restarts: 0
% 0.21/0.45 % inst_num_moves_active_passive: 0
% 0.21/0.45 % inst_lit_activity: 0
% 0.21/0.45 % inst_lit_activity_moves: 0
% 0.21/0.45 % inst_num_tautologies: 0
% 0.21/0.45 % inst_num_prop_implied: 0
% 0.21/0.45 % inst_num_existing_simplified: 0
% 0.21/0.45 % inst_num_eq_res_simplified: 0
% 0.21/0.45 % inst_num_child_elim: 0
% 0.21/0.45 % inst_num_of_dismatching_blockings: 0
% 0.21/0.45 % inst_num_of_non_proper_insts: 0
% 0.21/0.45 % inst_num_of_duplicates: 0
% 0.21/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.45 % inst_dismatching_checking_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Resolution
% 0.21/0.45
% 0.21/0.45 % res_num_of_clauses: undef
% 0.21/0.45 % res_num_in_passive: undef
% 0.21/0.45 % res_num_in_active: 0
% 0.21/0.45 % res_num_of_loops: 0
% 0.21/0.45 % res_forward_subset_subsumed: 0
% 0.21/0.45 % res_backward_subset_subsumed: 0
% 0.21/0.45 % res_forward_subsumed: 0
% 0.21/0.45 % res_backward_subsumed: 0
% 0.21/0.45 % res_forward_subsumption_resolution: 0
% 0.21/0.45 % res_backward_subsumption_resolution: 0
% 0.21/0.45 % res_clause_to_clause_subsumption: 0
% 0.21/0.45 % res_orphan_elimination: 0
% 0.21/0.45 % res_tautology_del: 0
% 0.21/0.45 % res_num_eq_res_simplified: 0
% 0.21/0.45 % res_num_sel_changes: 0
% 0.21/0.45 % res_moves_from_active_to_pass: 0
% 0.21/0.45
% 0.21/0.45 % Status Unknown
% 0.21/0.51 % Orienting using strategy ClausalAll
% 0.21/0.51 % FOF problem with conjecture
% 0.21/0.51 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b377d7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6031af.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_4b172b | grep -v "SZS"
% 0.21/0.53
% 0.21/0.53 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.53
% 0.21/0.53 %
% 0.21/0.53 % ------ iProver source info
% 0.21/0.53
% 0.21/0.53 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.53 % git: non_committed_changes: true
% 0.21/0.53 % git: last_make_outside_of_git: true
% 0.21/0.53
% 0.21/0.53 %
% 0.21/0.53 % ------ Input Options
% 0.21/0.53
% 0.21/0.53 % --out_options all
% 0.21/0.53 % --tptp_safe_out true
% 0.21/0.53 % --problem_path ""
% 0.21/0.53 % --include_path ""
% 0.21/0.53 % --clausifier .//eprover
% 0.21/0.53 % --clausifier_options --tstp-format
% 0.21/0.53 % --stdin false
% 0.21/0.53 % --dbg_backtrace false
% 0.21/0.53 % --dbg_dump_prop_clauses false
% 0.21/0.53 % --dbg_dump_prop_clauses_file -
% 0.21/0.53 % --dbg_out_stat false
% 0.21/0.53
% 0.21/0.53 % ------ General Options
% 0.21/0.53
% 0.21/0.53 % --fof false
% 0.21/0.53 % --time_out_real 150.
% 0.21/0.53 % --time_out_prep_mult 0.2
% 0.21/0.53 % --time_out_virtual -1.
% 0.21/0.53 % --schedule none
% 0.21/0.53 % --ground_splitting input
% 0.21/0.53 % --splitting_nvd 16
% 0.21/0.53 % --non_eq_to_eq false
% 0.21/0.53 % --prep_gs_sim true
% 0.21/0.53 % --prep_unflatten false
% 0.21/0.53 % --prep_res_sim true
% 0.21/0.53 % --prep_upred true
% 0.21/0.53 % --res_sim_input true
% 0.21/0.53 % --clause_weak_htbl true
% 0.21/0.53 % --gc_record_bc_elim false
% 0.21/0.53 % --symbol_type_check false
% 0.21/0.53 % --clausify_out false
% 0.21/0.53 % --large_theory_mode false
% 0.21/0.53 % --prep_sem_filter none
% 0.21/0.53 % --prep_sem_filter_out false
% 0.21/0.53 % --preprocessed_out false
% 0.21/0.53 % --sub_typing false
% 0.21/0.53 % --brand_transform false
% 0.21/0.53 % --pure_diseq_elim true
% 0.21/0.53 % --min_unsat_core false
% 0.21/0.53 % --pred_elim true
% 0.21/0.53 % --add_important_lit false
% 0.21/0.53 % --soft_assumptions false
% 0.21/0.53 % --reset_solvers false
% 0.21/0.53 % --bc_imp_inh []
% 0.21/0.53 % --conj_cone_tolerance 1.5
% 0.21/0.53 % --prolific_symb_bound 500
% 0.21/0.53 % --lt_threshold 2000
% 0.21/0.53
% 0.21/0.53 % ------ SAT Options
% 0.21/0.53
% 0.21/0.53 % --sat_mode false
% 0.21/0.53 % --sat_fm_restart_options ""
% 0.21/0.53 % --sat_gr_def false
% 0.21/0.53 % --sat_epr_types true
% 0.21/0.53 % --sat_non_cyclic_types false
% 0.21/0.53 % --sat_finite_models false
% 0.21/0.53 % --sat_fm_lemmas false
% 0.21/0.53 % --sat_fm_prep false
% 0.21/0.53 % --sat_fm_uc_incr true
% 0.21/0.53 % --sat_out_model small
% 0.21/0.53 % --sat_out_clauses false
% 0.21/0.53
% 0.21/0.53 % ------ QBF Options
% 0.21/0.53
% 0.21/0.53 % --qbf_mode false
% 0.21/0.53 % --qbf_elim_univ true
% 0.21/0.53 % --qbf_sk_in true
% 0.21/0.53 % --qbf_pred_elim true
% 0.21/0.53 % --qbf_split 32
% 0.21/0.53
% 0.21/0.53 % ------ BMC1 Options
% 0.21/0.53
% 0.21/0.53 % --bmc1_incremental false
% 0.21/0.53 % --bmc1_axioms reachable_all
% 0.21/0.53 % --bmc1_min_bound 0
% 0.21/0.53 % --bmc1_max_bound -1
% 0.21/0.53 % --bmc1_max_bound_default -1
% 0.21/0.53 % --bmc1_symbol_reachability true
% 0.21/0.53 % --bmc1_property_lemmas false
% 0.21/0.53 % --bmc1_k_induction false
% 0.21/0.53 % --bmc1_non_equiv_states false
% 0.21/0.53 % --bmc1_deadlock false
% 0.21/0.53 % --bmc1_ucm false
% 0.21/0.53 % --bmc1_add_unsat_core none
% 0.21/0.53 % --bmc1_unsat_core_children false
% 0.21/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.53 % --bmc1_out_stat full
% 0.21/0.53 % --bmc1_ground_init false
% 0.21/0.53 % --bmc1_pre_inst_next_state false
% 0.21/0.53 % --bmc1_pre_inst_state false
% 0.21/0.53 % --bmc1_pre_inst_reach_state false
% 0.21/0.53 % --bmc1_out_unsat_core false
% 0.21/0.53 % --bmc1_aig_witness_out false
% 0.21/0.53 % --bmc1_verbose false
% 0.21/0.53 % --bmc1_dump_clauses_tptp false
% 0.76/1.07 % --bmc1_dump_unsat_core_tptp false
% 0.76/1.07 % --bmc1_dump_file -
% 0.76/1.07 % --bmc1_ucm_expand_uc_limit 128
% 0.76/1.07 % --bmc1_ucm_n_expand_iterations 6
% 0.76/1.07 % --bmc1_ucm_extend_mode 1
% 0.76/1.07 % --bmc1_ucm_init_mode 2
% 0.76/1.07 % --bmc1_ucm_cone_mode none
% 0.76/1.07 % --bmc1_ucm_reduced_relation_type 0
% 0.76/1.07 % --bmc1_ucm_relax_model 4
% 0.76/1.07 % --bmc1_ucm_full_tr_after_sat true
% 0.76/1.07 % --bmc1_ucm_expand_neg_assumptions false
% 0.76/1.07 % --bmc1_ucm_layered_model none
% 0.76/1.07 % --bmc1_ucm_max_lemma_size 10
% 0.76/1.07
% 0.76/1.07 % ------ AIG Options
% 0.76/1.07
% 0.76/1.07 % --aig_mode false
% 0.76/1.07
% 0.76/1.07 % ------ Instantiation Options
% 0.76/1.07
% 0.76/1.07 % --instantiation_flag true
% 0.76/1.07 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.76/1.07 % --inst_solver_per_active 750
% 0.76/1.07 % --inst_solver_calls_frac 0.5
% 0.76/1.07 % --inst_passive_queue_type priority_queues
% 0.76/1.07 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.76/1.07 % --inst_passive_queues_freq [25;2]
% 0.76/1.07 % --inst_dismatching true
% 0.76/1.07 % --inst_eager_unprocessed_to_passive true
% 0.76/1.07 % --inst_prop_sim_given true
% 0.76/1.07 % --inst_prop_sim_new false
% 0.76/1.07 % --inst_orphan_elimination true
% 0.76/1.07 % --inst_learning_loop_flag true
% 0.76/1.07 % --inst_learning_start 3000
% 0.76/1.07 % --inst_learning_factor 2
% 0.76/1.07 % --inst_start_prop_sim_after_learn 3
% 0.76/1.07 % --inst_sel_renew solver
% 0.76/1.07 % --inst_lit_activity_flag true
% 0.76/1.07 % --inst_out_proof true
% 0.76/1.07
% 0.76/1.07 % ------ Resolution Options
% 0.76/1.07
% 0.76/1.07 % --resolution_flag true
% 0.76/1.07 % --res_lit_sel kbo_max
% 0.76/1.07 % --res_to_prop_solver none
% 0.76/1.07 % --res_prop_simpl_new false
% 0.76/1.07 % --res_prop_simpl_given false
% 0.76/1.07 % --res_passive_queue_type priority_queues
% 0.76/1.07 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.76/1.07 % --res_passive_queues_freq [15;5]
% 0.76/1.07 % --res_forward_subs full
% 0.76/1.07 % --res_backward_subs full
% 0.76/1.07 % --res_forward_subs_resolution true
% 0.76/1.07 % --res_backward_subs_resolution true
% 0.76/1.07 % --res_orphan_elimination false
% 0.76/1.07 % --res_time_limit 1000.
% 0.76/1.07 % --res_out_proof true
% 0.76/1.07 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b377d7.s
% 0.76/1.07 % --modulo true
% 0.76/1.07
% 0.76/1.07 % ------ Combination Options
% 0.76/1.07
% 0.76/1.07 % --comb_res_mult 1000
% 0.76/1.07 % --comb_inst_mult 300
% 0.76/1.07 % ------
% 0.76/1.07
% 0.76/1.07 % ------ Parsing...% successful
% 0.76/1.07
% 0.76/1.07 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.76/1.07
% 0.76/1.07 % ------ Proving...
% 0.76/1.07 % ------ Problem Properties
% 0.76/1.07
% 0.76/1.07 %
% 0.76/1.07 % EPR false
% 0.76/1.07 % Horn false
% 0.76/1.07 % Has equality true
% 0.76/1.07
% 0.76/1.07 % % ------ Input Options Time Limit: Unbounded
% 0.76/1.07
% 0.76/1.07
% 0.76/1.07 Compiling...
% 0.76/1.07 Loading plugin: done.
% 0.76/1.07 Compiling...
% 0.76/1.07 Loading plugin: done.
% 0.76/1.07 Compiling...
% 0.76/1.07 Loading plugin: done.
% 0.76/1.07 Compiling...
% 0.76/1.07 Loading plugin: done.
% 0.76/1.07 Compiling...
% 0.76/1.07 Loading plugin: done.
% 0.76/1.07 % % ------ Current options:
% 0.76/1.07
% 0.76/1.07 % ------ Input Options
% 0.76/1.07
% 0.76/1.07 % --out_options all
% 0.76/1.07 % --tptp_safe_out true
% 0.76/1.07 % --problem_path ""
% 0.76/1.07 % --include_path ""
% 0.76/1.07 % --clausifier .//eprover
% 0.76/1.07 % --clausifier_options --tstp-format
% 0.76/1.07 % --stdin false
% 0.76/1.07 % --dbg_backtrace false
% 0.76/1.07 % --dbg_dump_prop_clauses false
% 0.76/1.07 % --dbg_dump_prop_clauses_file -
% 0.76/1.07 % --dbg_out_stat false
% 0.76/1.07
% 0.76/1.07 % ------ General Options
% 0.76/1.07
% 0.76/1.07 % --fof false
% 0.76/1.07 % --time_out_real 150.
% 0.76/1.07 % --time_out_prep_mult 0.2
% 0.76/1.07 % --time_out_virtual -1.
% 0.76/1.07 % --schedule none
% 0.76/1.07 % --ground_splitting input
% 0.76/1.07 % --splitting_nvd 16
% 0.76/1.07 % --non_eq_to_eq false
% 0.76/1.07 % --prep_gs_sim true
% 0.76/1.07 % --prep_unflatten false
% 0.76/1.07 % --prep_res_sim true
% 0.76/1.07 % --prep_upred true
% 0.76/1.07 % --res_sim_input true
% 0.76/1.07 % --clause_weak_htbl true
% 0.76/1.07 % --gc_record_bc_elim false
% 0.76/1.07 % --symbol_type_check false
% 0.76/1.07 % --clausify_out false
% 0.76/1.07 % --large_theory_mode false
% 0.76/1.07 % --prep_sem_filter none
% 0.76/1.07 % --prep_sem_filter_out false
% 0.76/1.07 % --preprocessed_out false
% 0.76/1.07 % --sub_typing false
% 0.76/1.07 % --brand_transform false
% 0.76/1.07 % --pure_diseq_elim true
% 0.76/1.07 % --min_unsat_core false
% 0.76/1.07 % --pred_elim true
% 0.76/1.07 % --add_important_lit false
% 0.76/1.07 % --soft_assumptions false
% 0.76/1.07 % --reset_solvers false
% 0.76/1.07 % --bc_imp_inh []
% 0.76/1.07 % --conj_cone_tolerance 1.5
% 0.76/1.07 % --prolific_symb_bound 500
% 0.76/1.07 % --lt_threshold 2000
% 0.76/1.07
% 0.76/1.07 % ------ SAT Options
% 0.76/1.07
% 0.76/1.07 % --sat_mode false
% 0.76/1.07 % --sat_fm_restart_options ""
% 0.76/1.07 % --sat_gr_def false
% 0.76/1.07 % --sat_epr_types true
% 0.76/1.07 % --sat_non_cyclic_types false
% 0.76/1.07 % --sat_finite_models false
% 0.76/1.07 % --sat_fm_lemmas false
% 0.76/1.07 % --sat_fm_prep false
% 0.76/1.07 % --sat_fm_uc_incr true
% 0.76/1.07 % --sat_out_model small
% 0.76/1.07 % --sat_out_clauses false
% 0.76/1.07
% 0.76/1.07 % ------ QBF Options
% 0.76/1.07
% 0.76/1.07 % --qbf_mode false
% 0.76/1.07 % --qbf_elim_univ true
% 0.76/1.07 % --qbf_sk_in true
% 0.76/1.07 % --qbf_pred_elim true
% 0.76/1.07 % --qbf_split 32
% 0.76/1.07
% 0.76/1.07 % ------ BMC1 Options
% 0.76/1.07
% 0.76/1.07 % --bmc1_incremental false
% 0.76/1.07 % --bmc1_axioms reachable_all
% 0.76/1.07 % --bmc1_min_bound 0
% 0.76/1.07 % --bmc1_max_bound -1
% 0.76/1.07 % --bmc1_max_bound_default -1
% 0.76/1.07 % --bmc1_symbol_reachability true
% 0.76/1.07 % --bmc1_property_lemmas false
% 0.76/1.07 % --bmc1_k_induction false
% 0.76/1.07 % --bmc1_non_equiv_states false
% 0.76/1.07 % --bmc1_deadlock false
% 0.76/1.07 % --bmc1_ucm false
% 0.76/1.07 % --bmc1_add_unsat_core none
% 0.76/1.07 % --bmc1_unsat_core_children false
% 0.76/1.07 % --bmc1_unsat_core_extrapolate_axioms false
% 0.76/1.07 % --bmc1_out_stat full
% 0.76/1.07 % --bmc1_ground_init false
% 0.76/1.07 % --bmc1_pre_inst_next_state false
% 0.76/1.07 % --bmc1_pre_inst_state false
% 0.76/1.07 % --bmc1_pre_inst_reach_state false
% 0.76/1.07 % --bmc1_out_unsat_core false
% 0.76/1.07 % --bmc1_aig_witness_out false
% 0.76/1.07 % --bmc1_verbose false
% 0.76/1.07 % --bmc1_dump_clauses_tptp false
% 0.76/1.07 % --bmc1_dump_unsat_core_tptp false
% 0.76/1.07 % --bmc1_dump_file -
% 0.76/1.07 % --bmc1_ucm_expand_uc_limit 128
% 0.76/1.07 % --bmc1_ucm_n_expand_iterations 6
% 0.76/1.07 % --bmc1_ucm_extend_mode 1
% 0.76/1.07 % --bmc1_ucm_init_mode 2
% 0.76/1.07 % --bmc1_ucm_cone_mode none
% 0.76/1.07 % --bmc1_ucm_reduced_relation_type 0
% 0.76/1.07 % --bmc1_ucm_relax_model 4
% 0.76/1.07 % --bmc1_ucm_full_tr_after_sat true
% 0.76/1.07 % --bmc1_ucm_expand_neg_assumptions false
% 0.76/1.07 % --bmc1_ucm_layered_model none
% 0.76/1.07 % --bmc1_ucm_max_lemma_size 10
% 0.76/1.07
% 0.76/1.07 % ------ AIG Options
% 0.76/1.07
% 0.76/1.07 % --aig_mode false
% 0.76/1.07
% 0.76/1.07 % ------ Instantiation Options
% 0.76/1.07
% 0.76/1.07 % --instantiation_flag true
% 0.76/1.07 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.76/1.07 % --inst_solver_per_active 750
% 0.76/1.07 % --inst_solver_calls_frac 0.5
% 0.76/1.07 % --inst_passive_queue_type priority_queues
% 0.76/1.07 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.90/1.10 % --inst_passive_queues_freq [25;2]
% 0.90/1.10 % --inst_dismatching true
% 0.90/1.10 % --inst_eager_unprocessed_to_passive true
% 0.90/1.10 % --inst_prop_sim_given true
% 0.90/1.10 % --inst_prop_sim_new false
% 0.90/1.10 % --inst_orphan_elimination true
% 0.90/1.10 % --inst_learning_loop_flag true
% 0.90/1.10 % --inst_learning_start 3000
% 0.90/1.10 % --inst_learning_factor 2
% 0.90/1.10 % --inst_start_prop_sim_after_learn 3
% 0.90/1.10 % --inst_sel_renew solver
% 0.90/1.10 % --inst_lit_activity_flag true
% 0.90/1.10 % --inst_out_proof true
% 0.90/1.10
% 0.90/1.10 % ------ Resolution Options
% 0.90/1.10
% 0.90/1.10 % --resolution_flag true
% 0.90/1.10 % --res_lit_sel kbo_max
% 0.90/1.10 % --res_to_prop_solver none
% 0.90/1.10 % --res_prop_simpl_new false
% 0.90/1.10 % --res_prop_simpl_given false
% 0.90/1.10 % --res_passive_queue_type priority_queues
% 0.90/1.10 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.90/1.10 % --res_passive_queues_freq [15;5]
% 0.90/1.10 % --res_forward_subs full
% 0.90/1.10 % --res_backward_subs full
% 0.90/1.10 % --res_forward_subs_resolution true
% 0.90/1.10 % --res_backward_subs_resolution true
% 0.90/1.10 % --res_orphan_elimination false
% 0.90/1.10 % --res_time_limit 1000.
% 0.90/1.10 % --res_out_proof true
% 0.90/1.10 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b377d7.s
% 0.90/1.10 % --modulo true
% 0.90/1.10
% 0.90/1.10 % ------ Combination Options
% 0.90/1.10
% 0.90/1.10 % --comb_res_mult 1000
% 0.90/1.10 % --comb_inst_mult 300
% 0.90/1.10 % ------
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10 % ------ Proving...
% 0.90/1.10 %
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10 % Resolution empty clause
% 0.90/1.10
% 0.90/1.10 % ------ Statistics
% 0.90/1.10
% 0.90/1.10 % ------ General
% 0.90/1.10
% 0.90/1.10 % num_of_input_clauses: 180
% 0.90/1.10 % num_of_input_neg_conjectures: 3
% 0.90/1.10 % num_of_splits: 0
% 0.90/1.10 % num_of_split_atoms: 0
% 0.90/1.10 % num_of_sem_filtered_clauses: 0
% 0.90/1.10 % num_of_subtypes: 0
% 0.90/1.10 % monotx_restored_types: 0
% 0.90/1.10 % sat_num_of_epr_types: 0
% 0.90/1.10 % sat_num_of_non_cyclic_types: 0
% 0.90/1.10 % sat_guarded_non_collapsed_types: 0
% 0.90/1.10 % is_epr: 0
% 0.90/1.10 % is_horn: 0
% 0.90/1.10 % has_eq: 1
% 0.90/1.10 % num_pure_diseq_elim: 0
% 0.90/1.10 % simp_replaced_by: 0
% 0.90/1.10 % res_preprocessed: 7
% 0.90/1.10 % prep_upred: 0
% 0.90/1.10 % prep_unflattend: 0
% 0.90/1.10 % pred_elim_cands: 0
% 0.90/1.10 % pred_elim: 0
% 0.90/1.10 % pred_elim_cl: 0
% 0.90/1.10 % pred_elim_cycles: 0
% 0.90/1.10 % forced_gc_time: 0
% 0.90/1.10 % gc_basic_clause_elim: 0
% 0.90/1.10 % parsing_time: 0.007
% 0.90/1.10 % sem_filter_time: 0.
% 0.90/1.10 % pred_elim_time: 0.
% 0.90/1.10 % out_proof_time: 0.001
% 0.90/1.10 % monotx_time: 0.
% 0.90/1.10 % subtype_inf_time: 0.
% 0.90/1.10 % unif_index_cands_time: 0.
% 0.90/1.10 % unif_index_add_time: 0.
% 0.90/1.10 % total_time: 0.58
% 0.90/1.10 % num_of_symbols: 77
% 0.90/1.10 % num_of_terms: 1129
% 0.90/1.10
% 0.90/1.10 % ------ Propositional Solver
% 0.90/1.10
% 0.90/1.10 % prop_solver_calls: 1
% 0.90/1.10 % prop_fast_solver_calls: 16
% 0.90/1.10 % prop_num_of_clauses: 206
% 0.90/1.10 % prop_preprocess_simplified: 548
% 0.90/1.10 % prop_fo_subsumed: 0
% 0.90/1.10 % prop_solver_time: 0.
% 0.90/1.10 % prop_fast_solver_time: 0.
% 0.90/1.10 % prop_unsat_core_time: 0.
% 0.90/1.10
% 0.90/1.10 % ------ QBF
% 0.90/1.10
% 0.90/1.10 % qbf_q_res: 0
% 0.90/1.10 % qbf_num_tautologies: 0
% 0.90/1.10 % qbf_prep_cycles: 0
% 0.90/1.10
% 0.90/1.10 % ------ BMC1
% 0.90/1.10
% 0.90/1.10 % bmc1_current_bound: -1
% 0.90/1.10 % bmc1_last_solved_bound: -1
% 0.90/1.10 % bmc1_unsat_core_size: -1
% 0.90/1.10 % bmc1_unsat_core_parents_size: -1
% 0.90/1.10 % bmc1_merge_next_fun: 0
% 0.90/1.10 % bmc1_unsat_core_clauses_time: 0.
% 0.90/1.10
% 0.90/1.10 % ------ Instantiation
% 0.90/1.10
% 0.90/1.10 % inst_num_of_clauses: 179
% 0.90/1.10 % inst_num_in_passive: 0
% 0.90/1.10 % inst_num_in_active: 0
% 0.90/1.10 % inst_num_in_unprocessed: 180
% 0.90/1.10 % inst_num_of_loops: 0
% 0.90/1.10 % inst_num_of_learning_restarts: 0
% 0.90/1.10 % inst_num_moves_active_passive: 0
% 0.90/1.10 % inst_lit_activity: 0
% 0.90/1.10 % inst_lit_activity_moves: 0
% 0.90/1.10 % inst_num_tautologies: 0
% 0.90/1.10 % inst_num_prop_implied: 0
% 0.90/1.10 % inst_num_existing_simplified: 0
% 0.90/1.10 % inst_num_eq_res_simplified: 0
% 0.90/1.10 % inst_num_child_elim: 0
% 0.90/1.10 % inst_num_of_dismatching_blockings: 0
% 0.90/1.10 % inst_num_of_non_proper_insts: 0
% 0.90/1.10 % inst_num_of_duplicates: 0
% 0.90/1.10 % inst_inst_num_from_inst_to_res: 0
% 0.90/1.10 % inst_dismatching_checking_time: 0.
% 0.90/1.10
% 0.90/1.10 % ------ Resolution
% 0.90/1.10
% 0.90/1.10 % res_num_of_clauses: 375
% 0.90/1.10 % res_num_in_passive: 134
% 0.90/1.10 % res_num_in_active: 136
% 0.90/1.10 % res_num_of_loops: 62
% 0.90/1.10 % res_forward_subset_subsumed: 126
% 0.90/1.10 % res_backward_subset_subsumed: 0
% 0.90/1.10 % res_forward_subsumed: 4
% 0.90/1.10 % res_backward_subsumed: 0
% 0.90/1.10 % res_forward_subsumption_resolution: 11
% 0.90/1.10 % res_backward_subsumption_resolution: 0
% 0.90/1.10 % res_clause_to_clause_subsumption: 54
% 0.90/1.10 % res_orphan_elimination: 0
% 0.90/1.10 % res_tautology_del: 0
% 0.90/1.10 % res_num_eq_res_simplified: 0
% 0.90/1.10 % res_num_sel_changes: 0
% 0.90/1.10 % res_moves_from_active_to_pass: 0
% 0.90/1.10
% 0.90/1.10 % Status Unsatisfiable
% 0.90/1.10 % SZS status Theorem
% 0.90/1.10 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------