TSTP Solution File: SWV387+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWV387+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n006.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:15:58 EDT 2022
% Result : Theorem 0.76s 1.06s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 47
% Syntax : Number of formulae : 364 ( 126 unt; 0 def)
% Number of atoms : 771 ( 231 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 705 ( 298 ~; 316 |; 37 &)
% ( 12 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 9 usr; 2 prp; 0-3 aty)
% Number of functors : 26 ( 26 usr; 11 con; 0-3 aty)
% Number of variables : 1049 ( 180 sgn 386 !; 0 ?)
% 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] :
( strictly_less_than(X4,X5)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> ~ $true ) ),
file('<stdin>',ax38) ).
fof(c_0_2,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_3,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_4,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_5,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_6,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_7,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_8,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_9,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('<stdin>',ax39) ).
fof(c_0_10,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_11,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_12,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_13,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_14,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('<stdin>',ax40) ).
fof(c_0_15,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_16,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('<stdin>',ax46) ).
fof(c_0_17,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_18,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_19,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('<stdin>',ax41) ).
fof(c_0_20,axiom,
! [X1,X2] : findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
file('<stdin>',ax50) ).
fof(c_0_21,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('<stdin>',ax36) ).
fof(c_0_22,axiom,
! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
file('<stdin>',ax26) ).
fof(c_0_23,axiom,
! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
file('<stdin>',ax24) ).
fof(c_0_24,axiom,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
file('<stdin>',ax22) ).
fof(c_0_25,axiom,
! [X1,X2,X3] : isnonempty_slb(insert_slb(X1,pair(X2,X3))),
file('<stdin>',ax19) ).
fof(c_0_26,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,remove_cpq(X2,X3)) ),
file('<stdin>',ax33) ).
fof(c_0_27,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,insert_cpq(X2,X3)) ),
file('<stdin>',ax32) ).
fof(c_0_28,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
file('<stdin>',transitivity) ).
fof(c_0_29,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('<stdin>',stricly_smaller_definition) ).
fof(c_0_30,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,removemin_cpq_eff(X2)) ),
file('<stdin>',ax35) ).
fof(c_0_31,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,findmin_cpq_eff(X2)) ),
file('<stdin>',ax34) ).
fof(c_0_32,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
file('<stdin>',ax52) ).
fof(c_0_33,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('<stdin>',totality) ).
fof(c_0_34,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('<stdin>',ax20) ).
fof(c_0_35,axiom,
! [X1] : succ_cpq(X1,X1),
file('<stdin>',ax31) ).
fof(c_0_36,axiom,
! [X1] : less_than(X1,X1),
file('<stdin>',reflexivity) ).
fof(c_0_37,axiom,
! [X1] : update_slb(create_slb,X1) = create_slb,
file('<stdin>',ax28) ).
fof(c_0_38,axiom,
! [X1] : less_than(bottom,X1),
file('<stdin>',bottom_smallest) ).
fof(c_0_39,axiom,
! [X1] : removemin_cpq_res(X1) = findmin_cpq_res(X1),
file('<stdin>',ax53) ).
fof(c_0_40,axiom,
~ isnonempty_slb(create_slb),
file('<stdin>',ax18) ).
fof(c_0_41,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_42,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_1]) ).
fof(c_0_43,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_2 ).
fof(c_0_44,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_3 ).
fof(c_0_45,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_4 ).
fof(c_0_46,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_5 ).
fof(c_0_47,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_6 ).
fof(c_0_48,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_7 ).
fof(c_0_49,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_8]) ).
fof(c_0_50,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
c_0_9 ).
fof(c_0_51,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_10]) ).
fof(c_0_52,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_11 ).
fof(c_0_53,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_12 ).
fof(c_0_54,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_13 ).
fof(c_0_55,plain,
! [X1,X2] : ~ ok(triple(X1,X2,bad)),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_56,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
c_0_15 ).
fof(c_0_57,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
c_0_16 ).
fof(c_0_58,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_17 ).
fof(c_0_59,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
c_0_18 ).
fof(c_0_60,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_61,axiom,
! [X1,X2] : findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
c_0_20 ).
fof(c_0_62,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
c_0_21 ).
fof(c_0_63,axiom,
! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
c_0_22 ).
fof(c_0_64,axiom,
! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
c_0_23 ).
fof(c_0_65,plain,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
fof(c_0_66,axiom,
! [X1,X2,X3] : isnonempty_slb(insert_slb(X1,pair(X2,X3))),
c_0_25 ).
fof(c_0_67,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,remove_cpq(X2,X3)) ),
c_0_26 ).
fof(c_0_68,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,insert_cpq(X2,X3)) ),
c_0_27 ).
fof(c_0_69,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
c_0_28 ).
fof(c_0_70,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_29]) ).
fof(c_0_71,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,removemin_cpq_eff(X2)) ),
c_0_30 ).
fof(c_0_72,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,findmin_cpq_eff(X2)) ),
c_0_31 ).
fof(c_0_73,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
c_0_32 ).
fof(c_0_74,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
c_0_33 ).
fof(c_0_75,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[c_0_34]) ).
fof(c_0_76,axiom,
! [X1] : succ_cpq(X1,X1),
c_0_35 ).
fof(c_0_77,axiom,
! [X1] : less_than(X1,X1),
c_0_36 ).
fof(c_0_78,axiom,
! [X1] : update_slb(create_slb,X1) = create_slb,
c_0_37 ).
fof(c_0_79,axiom,
! [X1] : less_than(bottom,X1),
c_0_38 ).
fof(c_0_80,axiom,
! [X1] : removemin_cpq_res(X1) = findmin_cpq_res(X1),
c_0_39 ).
fof(c_0_81,plain,
~ isnonempty_slb(create_slb),
inference(fof_simplification,[status(thm)],[c_0_40]) ).
fof(c_0_82,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_41])])]) ).
fof(c_0_83,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_42])]) ).
fof(c_0_84,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_43])])])]) ).
fof(c_0_85,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_44])])])]) ).
fof(c_0_86,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_45])]) ).
fof(c_0_87,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_46])]) ).
fof(c_0_88,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_47]) ).
fof(c_0_89,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_48])])])])]) ).
fof(c_0_90,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_49])])])]) ).
fof(c_0_91,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_50])])])]) ).
fof(c_0_92,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_51])]) ).
fof(c_0_93,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_52])])])]) ).
fof(c_0_94,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_53])]) ).
fof(c_0_95,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_54])]) ).
fof(c_0_96,plain,
! [X3,X4] : ~ ok(triple(X3,X4,bad)),
inference(variable_rename,[status(thm)],[c_0_55]) ).
fof(c_0_97,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_56])])])])]) ).
fof(c_0_98,plain,
! [X3,X4] : findmin_cpq_eff(triple(X3,create_slb,X4)) = triple(X3,create_slb,bad),
inference(variable_rename,[status(thm)],[c_0_57]) ).
fof(c_0_99,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_58])])])]) ).
fof(c_0_100,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_59])])])]) ).
fof(c_0_101,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| X6 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])]) ).
fof(c_0_102,plain,
! [X3,X4] : findmin_cpq_res(triple(X3,create_slb,X4)) = bottom,
inference(variable_rename,[status(thm)],[c_0_61]) ).
fof(c_0_103,plain,
! [X3,X4] : check_cpq(triple(X3,create_slb,X4)),
inference(variable_rename,[status(thm)],[c_0_62]) ).
fof(c_0_104,plain,
! [X4,X5,X6] : lookup_slb(insert_slb(X4,pair(X5,X6)),X5) = X6,
inference(variable_rename,[status(thm)],[c_0_63]) ).
fof(c_0_105,plain,
! [X4,X5,X6] : remove_slb(insert_slb(X4,pair(X5,X6)),X5) = X4,
inference(variable_rename,[status(thm)],[c_0_64]) ).
fof(c_0_106,plain,
! [X3,X4] : ~ pair_in_list(create_slb,X3,X4),
inference(variable_rename,[status(thm)],[c_0_65]) ).
fof(c_0_107,plain,
! [X4,X5,X6] : isnonempty_slb(insert_slb(X4,pair(X5,X6))),
inference(variable_rename,[status(thm)],[c_0_66]) ).
fof(c_0_108,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_67])])])]) ).
fof(c_0_109,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_68])])])]) ).
fof(c_0_110,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_69])]) ).
fof(c_0_111,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_70])])])])]) ).
fof(c_0_112,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_71])]) ).
fof(c_0_113,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_72])]) ).
fof(c_0_114,plain,
! [X2] : removemin_cpq_eff(X2) = remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)),
inference(variable_rename,[status(thm)],[c_0_73]) ).
fof(c_0_115,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_74]) ).
fof(c_0_116,plain,
! [X2] : ~ contains_slb(create_slb,X2),
inference(variable_rename,[status(thm)],[c_0_75]) ).
fof(c_0_117,plain,
! [X2] : succ_cpq(X2,X2),
inference(variable_rename,[status(thm)],[c_0_76]) ).
fof(c_0_118,plain,
! [X2] : less_than(X2,X2),
inference(variable_rename,[status(thm)],[c_0_77]) ).
fof(c_0_119,plain,
! [X2] : update_slb(create_slb,X2) = create_slb,
inference(variable_rename,[status(thm)],[c_0_78]) ).
fof(c_0_120,plain,
! [X2] : less_than(bottom,X2),
inference(variable_rename,[status(thm)],[c_0_79]) ).
fof(c_0_121,plain,
! [X2] : removemin_cpq_res(X2) = findmin_cpq_res(X2),
inference(variable_rename,[status(thm)],[c_0_80]) ).
fof(c_0_122,plain,
~ isnonempty_slb(create_slb),
c_0_81 ).
cnf(c_0_123,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_82]) ).
cnf(c_0_124,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_82]) ).
cnf(c_0_125,plain,
( ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_126,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_84]) ).
cnf(c_0_127,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_85]) ).
cnf(c_0_128,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_86]) ).
cnf(c_0_129,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_87]) ).
cnf(c_0_130,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_88]) ).
cnf(c_0_131,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_89]) ).
cnf(c_0_132,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_89]) ).
cnf(c_0_133,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_90]) ).
cnf(c_0_134,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_89]) ).
cnf(c_0_135,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_136,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_137,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_93]) ).
cnf(c_0_138,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_94]) ).
cnf(c_0_139,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_95]) ).
cnf(c_0_140,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_141,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_142,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_143,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_144,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_145,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_99]) ).
cnf(c_0_146,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_147,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_148,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_149,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_150,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_151,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_152,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_153,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_154,plain,
~ pair_in_list(create_slb,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_155,plain,
isnonempty_slb(insert_slb(X1,pair(X2,X3))),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_156,plain,
( succ_cpq(X1,remove_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_157,plain,
( succ_cpq(X1,insert_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_158,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_159,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_160,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_161,plain,
( succ_cpq(X1,removemin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_162,plain,
( succ_cpq(X1,findmin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_163,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_164,plain,
removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_165,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_166,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_167,plain,
succ_cpq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_168,plain,
less_than(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_169,plain,
update_slb(create_slb,X1) = create_slb,
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_170,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_171,plain,
removemin_cpq_res(X1) = findmin_cpq_res(X1),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_172,plain,
~ isnonempty_slb(create_slb),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_173,plain,
( check_cpq(triple(X3,X4,X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
c_0_123,
[final] ).
cnf(c_0_174,plain,
( check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,X4,X5)) ),
c_0_124,
[final] ).
cnf(c_0_175,plain,
( ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ strictly_less_than(X3,X4) ),
c_0_125,
[final] ).
cnf(c_0_176,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_126,
[final] ).
cnf(c_0_177,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_127,
[final] ).
cnf(c_0_178,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_128,
[final] ).
cnf(c_0_179,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_129,
[final] ).
cnf(c_0_180,plain,
triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3) = insert_cpq(triple(X1,X2,X3),X4),
c_0_130,
[final] ).
cnf(c_0_181,plain,
( pair_in_list(X1,X4,X5)
| X2 = X4
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
c_0_131,
[final] ).
cnf(c_0_182,plain,
( pair_in_list(X1,X4,X5)
| X3 = X5
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
c_0_132,
[final] ).
cnf(c_0_183,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_133,
[final] ).
cnf(c_0_184,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
c_0_134,
[final] ).
cnf(c_0_185,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
c_0_135,
[final] ).
cnf(c_0_186,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
c_0_136,
[final] ).
cnf(c_0_187,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_137,
[final] ).
cnf(c_0_188,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_138,
[final] ).
cnf(c_0_189,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_139,
[final] ).
cnf(c_0_190,plain,
~ ok(triple(X1,X2,bad)),
c_0_140,
[final] ).
cnf(c_0_191,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
c_0_141,
[final] ).
cnf(c_0_192,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
c_0_142,
[final] ).
cnf(c_0_193,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
c_0_143,
[final] ).
cnf(c_0_194,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
c_0_144,
[final] ).
cnf(c_0_195,plain,
( lookup_slb(insert_slb(X1,pair(X2,X3)),X4) = lookup_slb(X1,X4)
| X2 = X4
| ~ contains_slb(X1,X4) ),
c_0_145,
[final] ).
cnf(c_0_196,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
c_0_146,
[final] ).
cnf(c_0_197,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| ~ contains_slb(X1,X4) ),
c_0_147,
[final] ).
cnf(c_0_198,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
c_0_148,
[final] ).
cnf(c_0_199,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
c_0_149,
[final] ).
cnf(c_0_200,plain,
check_cpq(triple(X1,create_slb,X2)),
c_0_150,
[final] ).
cnf(c_0_201,plain,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| X2 != X4 ),
c_0_151,
[final] ).
cnf(c_0_202,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
c_0_152,
[final] ).
cnf(c_0_203,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
c_0_153,
[final] ).
cnf(c_0_204,plain,
~ pair_in_list(create_slb,X1,X2),
c_0_154,
[final] ).
cnf(c_0_205,plain,
isnonempty_slb(insert_slb(X1,pair(X2,X3))),
c_0_155,
[final] ).
cnf(c_0_206,plain,
( succ_cpq(X1,remove_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
c_0_156,
[final] ).
cnf(c_0_207,plain,
( succ_cpq(X1,insert_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
c_0_157,
[final] ).
cnf(c_0_208,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
c_0_158,
[final] ).
cnf(c_0_209,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
c_0_159,
[final] ).
cnf(c_0_210,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
c_0_160,
[final] ).
cnf(c_0_211,plain,
( succ_cpq(X1,removemin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
c_0_161,
[final] ).
cnf(c_0_212,plain,
( succ_cpq(X1,findmin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
c_0_162,
[final] ).
cnf(c_0_213,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
c_0_163,
[final] ).
cnf(c_0_214,plain,
remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)) = removemin_cpq_eff(X1),
c_0_164,
[final] ).
cnf(c_0_215,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
c_0_165,
[final] ).
cnf(c_0_216,plain,
~ contains_slb(create_slb,X1),
c_0_166,
[final] ).
cnf(c_0_217,plain,
succ_cpq(X1,X1),
c_0_167,
[final] ).
cnf(c_0_218,plain,
less_than(X1,X1),
c_0_168,
[final] ).
cnf(c_0_219,plain,
update_slb(create_slb,X1) = create_slb,
c_0_169,
[final] ).
cnf(c_0_220,plain,
less_than(bottom,X1),
c_0_170,
[final] ).
cnf(c_0_221,plain,
findmin_cpq_res(X1) = removemin_cpq_res(X1),
c_0_171,
[final] ).
cnf(c_0_222,plain,
~ isnonempty_slb(create_slb),
c_0_172,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_173_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_173]) ).
cnf(c_0_173_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_173]) ).
cnf(c_0_173_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_173]) ).
cnf(c_0_174_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_174]) ).
cnf(c_0_174_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_174]) ).
cnf(c_0_174_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_174]) ).
cnf(c_0_175_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_175]) ).
cnf(c_0_175_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_175]) ).
cnf(c_0_176_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_176]) ).
cnf(c_0_176_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_176]) ).
cnf(c_0_176_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_176]) ).
cnf(c_0_176_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_176]) ).
cnf(c_0_177_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_177]) ).
cnf(c_0_177_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_177]) ).
cnf(c_0_177_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_177]) ).
cnf(c_0_177_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_177]) ).
cnf(c_0_178_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_178]) ).
cnf(c_0_178_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_178]) ).
cnf(c_0_178_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_178]) ).
cnf(c_0_179_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_179]) ).
cnf(c_0_179_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_179]) ).
cnf(c_0_179_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_179]) ).
cnf(c_0_181_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_181]) ).
cnf(c_0_181_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_181]) ).
cnf(c_0_181_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_181]) ).
cnf(c_0_182_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_182]) ).
cnf(c_0_182_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_182]) ).
cnf(c_0_182_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_182]) ).
cnf(c_0_183_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_183]) ).
cnf(c_0_183_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_183]) ).
cnf(c_0_183_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_183]) ).
cnf(c_0_184_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_184]) ).
cnf(c_0_184_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_184]) ).
cnf(c_0_185_0,axiom,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_185_1,axiom,
( ~ contains_cpq(triple(X3,X1,X4),X2)
| contains_slb(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_186_0,axiom,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_186_1,axiom,
( contains_slb(X2,X4)
| remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_187_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_187]) ).
cnf(c_0_187_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_187]) ).
cnf(c_0_187_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_187]) ).
cnf(c_0_188_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_188]) ).
cnf(c_0_188_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_188]) ).
cnf(c_0_189_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_189]) ).
cnf(c_0_189_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_189]) ).
cnf(c_0_191_0,axiom,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(literals_permutation,[status(thm)],[c_0_191]) ).
cnf(c_0_191_1,axiom,
( contains_slb(X3,X2)
| X1 = X2
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(literals_permutation,[status(thm)],[c_0_191]) ).
cnf(c_0_191_2,axiom,
( ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2)
| contains_slb(X3,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_191]) ).
cnf(c_0_193_0,axiom,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_193]) ).
cnf(c_0_193_1,axiom,
( ~ contains_slb(X2,X4)
| contains_cpq(triple(X1,X2,X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_193]) ).
cnf(c_0_194_0,axiom,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_194_1,axiom,
( X3 != X5
| pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X2 != X4 ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_194_2,axiom,
( X2 != X4
| X3 != X5
| pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_195_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_195]) ).
cnf(c_0_195_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_195]) ).
cnf(c_0_195_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_195]) ).
cnf(c_0_196_0,axiom,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(literals_permutation,[status(thm)],[c_0_196]) ).
cnf(c_0_196_1,axiom,
( X2 = create_slb
| findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
inference(literals_permutation,[status(thm)],[c_0_196]) ).
cnf(c_0_197_0,axiom,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| ~ contains_slb(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_197]) ).
cnf(c_0_197_1,axiom,
( ~ contains_slb(X1,X4)
| contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(literals_permutation,[status(thm)],[c_0_197]) ).
cnf(c_0_198_0,axiom,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_198]) ).
cnf(c_0_198_1,axiom,
( ok(triple(X2,X3,X1))
| X1 = bad ),
inference(literals_permutation,[status(thm)],[c_0_198]) ).
cnf(c_0_201_0,axiom,
( contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| X2 != X4 ),
inference(literals_permutation,[status(thm)],[c_0_201]) ).
cnf(c_0_201_1,axiom,
( X2 != X4
| contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(literals_permutation,[status(thm)],[c_0_201]) ).
cnf(c_0_206_0,axiom,
( succ_cpq(X1,remove_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_206]) ).
cnf(c_0_206_1,axiom,
( ~ succ_cpq(X1,X2)
| succ_cpq(X1,remove_cpq(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_206]) ).
cnf(c_0_207_0,axiom,
( succ_cpq(X1,insert_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_207_1,axiom,
( ~ succ_cpq(X1,X2)
| succ_cpq(X1,insert_cpq(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_208_0,axiom,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_208_1,axiom,
( ~ less_than(X3,X2)
| less_than(X1,X2)
| ~ less_than(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_208_2,axiom,
( ~ less_than(X1,X3)
| ~ less_than(X3,X2)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_209_0,axiom,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_209_1,axiom,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_209_2,axiom,
( ~ less_than(X1,X2)
| less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_210_0,axiom,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_210]) ).
cnf(c_0_210_1,axiom,
( ~ less_than(X2,X1)
| ~ strictly_less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_210]) ).
cnf(c_0_211_0,axiom,
( succ_cpq(X1,removemin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_211]) ).
cnf(c_0_211_1,axiom,
( ~ succ_cpq(X1,X2)
| succ_cpq(X1,removemin_cpq_eff(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_211]) ).
cnf(c_0_212_0,axiom,
( succ_cpq(X1,findmin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
cnf(c_0_212_1,axiom,
( ~ succ_cpq(X1,X2)
| succ_cpq(X1,findmin_cpq_eff(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
cnf(c_0_213_0,axiom,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_213]) ).
cnf(c_0_213_1,axiom,
( ~ strictly_less_than(X1,X2)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_213]) ).
cnf(c_0_215_0,axiom,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_215_1,axiom,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_190_0,axiom,
~ ok(triple(X1,X2,bad)),
inference(literals_permutation,[status(thm)],[c_0_190]) ).
cnf(c_0_204_0,axiom,
~ pair_in_list(create_slb,X1,X2),
inference(literals_permutation,[status(thm)],[c_0_204]) ).
cnf(c_0_216_0,axiom,
~ contains_slb(create_slb,X1),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_222_0,axiom,
~ isnonempty_slb(create_slb),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_180_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_180]) ).
cnf(c_0_192_0,axiom,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(literals_permutation,[status(thm)],[c_0_192]) ).
cnf(c_0_199_0,axiom,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_200_0,axiom,
check_cpq(triple(X1,create_slb,X2)),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_202_0,axiom,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(literals_permutation,[status(thm)],[c_0_202]) ).
cnf(c_0_203_0,axiom,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(literals_permutation,[status(thm)],[c_0_203]) ).
cnf(c_0_205_0,axiom,
isnonempty_slb(insert_slb(X1,pair(X2,X3))),
inference(literals_permutation,[status(thm)],[c_0_205]) ).
cnf(c_0_214_0,axiom,
remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)) = removemin_cpq_eff(X1),
inference(literals_permutation,[status(thm)],[c_0_214]) ).
cnf(c_0_217_0,axiom,
succ_cpq(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_217]) ).
cnf(c_0_218_0,axiom,
less_than(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_219_0,axiom,
update_slb(create_slb,X1) = create_slb,
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_220_0,axiom,
less_than(bottom,X1),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_221_0,axiom,
findmin_cpq_res(X1) = removemin_cpq_res(X1),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,lemma,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
file('<stdin>',l23_l027) ).
fof(c_0_1_002,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4] :
( ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ) ),
file('<stdin>',l23_co) ).
fof(c_0_2_003,lemma,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
c_0_0 ).
fof(c_0_3_004,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ! [X4] :
( ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_1])]) ).
fof(c_0_4_005,lemma,
! [X5,X6,X7,X8] :
( ~ check_cpq(remove_cpq(triple(X5,X6,X7),X8))
| ~ ok(remove_cpq(triple(X5,X6,X7),X8))
| check_cpq(triple(X5,X6,X7)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_5_006,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
& check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6_007,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,negated_conjecture,
check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9_010,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10_011,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4)) ),
c_0_6,
[final] ).
cnf(c_0_11_012,negated_conjecture,
check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
c_0_7,
[final] ).
cnf(c_0_12_013,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
c_0_8,
[final] ).
cnf(c_0_13_014,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
c_0_9,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_100,plain,
( ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(X0,X1,X2))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a8bd0a.p',c_0_10) ).
cnf(c_150,plain,
( ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(X0,X1,X2))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_164,plain,
( ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(X0,X1,X2))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(copy,[status(esa)],[c_150]) ).
cnf(c_171,plain,
( ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(X0,X1,X2))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(copy,[status(esa)],[c_164]) ).
cnf(c_172,plain,
( ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(X0,X1,X2))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(copy,[status(esa)],[c_171]) ).
cnf(c_472,plain,
( ~ check_cpq(remove_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(X0,X1,X2))
| ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(copy,[status(esa)],[c_172]) ).
cnf(c_103,negated_conjecture,
ok(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_a8bd0a.p',c_0_12) ).
cnf(c_156,negated_conjecture,
ok(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_167,negated_conjecture,
ok(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_156]) ).
cnf(c_168,negated_conjecture,
ok(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_167]) ).
cnf(c_175,negated_conjecture,
ok(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_168]) ).
cnf(c_478,negated_conjecture,
ok(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_175]) ).
cnf(c_492,plain,
( ~ check_cpq(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0))
| check_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ),
inference(resolution,[status(thm)],[c_472,c_478]) ).
cnf(c_493,plain,
( ~ check_cpq(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0))
| check_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ),
inference(rewriting,[status(thm)],[c_492]) ).
cnf(c_101,negated_conjecture,
~ check_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_a8bd0a.p',c_0_13) ).
cnf(c_152,negated_conjecture,
~ check_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_165,negated_conjecture,
~ check_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),
inference(copy,[status(esa)],[c_152]) ).
cnf(c_170,negated_conjecture,
~ check_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),
inference(copy,[status(esa)],[c_165]) ).
cnf(c_173,negated_conjecture,
~ check_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),
inference(copy,[status(esa)],[c_170]) ).
cnf(c_474,negated_conjecture,
~ check_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)),
inference(copy,[status(esa)],[c_173]) ).
cnf(c_102,negated_conjecture,
check_cpq(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_a8bd0a.p',c_0_11) ).
cnf(c_154,negated_conjecture,
check_cpq(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_166,negated_conjecture,
check_cpq(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_154]) ).
cnf(c_169,negated_conjecture,
check_cpq(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_166]) ).
cnf(c_174,negated_conjecture,
check_cpq(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_169]) ).
cnf(c_476,negated_conjecture,
check_cpq(remove_cpq(triple(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk4_0)),
inference(copy,[status(esa)],[c_174]) ).
cnf(c_496,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_493,c_474,c_476]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV387+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 15:57:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.13/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.41 % FOF problem with conjecture
% 0.13/0.41 % 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_789ad3.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a8bd0a.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_39b41b | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_789ad3.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...%
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % ------ Statistics
% 0.21/0.44
% 0.21/0.44 % ------ General
% 0.21/0.44
% 0.21/0.44 % num_of_input_clauses: 30
% 0.21/0.44 % num_of_input_neg_conjectures: 0
% 0.21/0.44 % num_of_splits: 0
% 0.21/0.44 % num_of_split_atoms: 0
% 0.21/0.44 % num_of_sem_filtered_clauses: 0
% 0.21/0.44 % num_of_subtypes: 0
% 0.21/0.44 % monotx_restored_types: 0
% 0.21/0.44 % sat_num_of_epr_types: 0
% 0.21/0.44 % sat_num_of_non_cyclic_types: 0
% 0.21/0.44 % sat_guarded_non_collapsed_types: 0
% 0.21/0.44 % is_epr: 0
% 0.21/0.44 % is_horn: 0
% 0.21/0.44 % has_eq: 0
% 0.21/0.44 % num_pure_diseq_elim: 0
% 0.21/0.44 % simp_replaced_by: 0
% 0.21/0.44 % res_preprocessed: 0
% 0.21/0.44 % prep_upred: 0
% 0.21/0.44 % prep_unflattend: 0
% 0.21/0.44 % pred_elim_cands: 0
% 0.21/0.44 % pred_elim: 0
% 0.21/0.44 % pred_elim_cl: 0
% 0.21/0.44 % pred_elim_cycles: 0
% 0.21/0.44 % forced_gc_time: 0
% 0.21/0.44 % gc_basic_clause_elim: 0
% 0.21/0.44 % parsing_time: 0.
% 0.21/0.44 % sem_filter_time: 0.
% 0.21/0.44 % pred_elim_time: 0.
% 0.21/0.44 % out_proof_time: 0.
% 0.21/0.44 % monotx_time: 0.
% 0.21/0.44 % subtype_inf_time: 0.
% 0.21/0.44 % unif_index_cands_time: 0.
% 0.21/0.44 % unFatal error: exception Failure("Parse error in: /export/starexec/sandbox/tmp/iprover_modulo_a8bd0a.p line: 33 near token: '!='")
% 0.21/0.44 if_index_add_time: 0.
% 0.21/0.44 % total_time: 0.019
% 0.21/0.44 % num_of_symbols: 50
% 0.21/0.44 % num_of_terms: 115
% 0.21/0.44
% 0.21/0.44 % ------ Propositional Solver
% 0.21/0.44
% 0.21/0.44 % prop_solver_calls: 0
% 0.21/0.44 % prop_fast_solver_calls: 0
% 0.21/0.44 % prop_num_of_clauses: 0
% 0.21/0.44 % prop_preprocess_simplified: 0
% 0.21/0.44 % prop_fo_subsumed: 0
% 0.21/0.44 % prop_solver_time: 0.
% 0.21/0.44 % prop_fast_solver_time: 0.
% 0.21/0.44 % prop_unsat_core_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ QBF
% 0.21/0.44
% 0.21/0.44 % qbf_q_res: 0
% 0.21/0.44 % qbf_num_tautologies: 0
% 0.21/0.44 % qbf_prep_cycles: 0
% 0.21/0.44
% 0.21/0.44 % ------ BMC1
% 0.21/0.44
% 0.21/0.44 % bmc1_current_bound: -1
% 0.21/0.44 % bmc1_last_solved_bound: -1
% 0.21/0.44 % bmc1_unsat_core_size: -1
% 0.21/0.44 % bmc1_unsat_core_parents_size: -1
% 0.21/0.44 % bmc1_merge_next_fun: 0
% 0.21/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation
% 0.21/0.44
% 0.21/0.44 % inst_num_of_clauses: undef
% 0.21/0.44 % inst_num_in_passive: undef
% 0.21/0.44 % inst_num_in_active: 0
% 0.21/0.44 % inst_num_in_unprocessed: 0
% 0.21/0.44 % inst_num_of_loops: 0
% 0.21/0.44 % inst_num_of_learning_restarts: 0
% 0.21/0.44 % inst_num_moves_active_passive: 0
% 0.21/0.44 % inst_lit_activity: 0
% 0.21/0.44 % inst_lit_activity_moves: 0
% 0.21/0.44 % inst_num_tautologies: 0
% 0.21/0.44 % inst_num_prop_implied: 0
% 0.21/0.44 % inst_num_existing_simplified: 0
% 0.21/0.44 % inst_num_eq_res_simplified: 0
% 0.21/0.44 % inst_num_child_elim: 0
% 0.21/0.44 % inst_num_of_dismatching_blockings: 0
% 0.21/0.44 % inst_num_of_non_proper_insts: 0
% 0.21/0.44 % inst_num_of_duplicates: 0
% 0.21/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.44 % inst_dismatching_checking_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Resolution
% 0.21/0.44
% 0.21/0.44 % res_num_of_clauses: undef
% 0.21/0.44 % res_num_in_passive: undef
% 0.21/0.44 % res_num_in_active: 0
% 0.21/0.44 % res_num_of_loops: 0
% 0.21/0.44 % res_forward_subset_subsumed: 0
% 0.21/0.44 % res_backward_subset_subsumed: 0
% 0.21/0.44 % res_forward_subsumed: 0
% 0.21/0.44 % res_backward_subsumed: 0
% 0.21/0.44 % res_forward_subsumption_resolution: 0
% 0.21/0.44 % res_backward_subsumption_resolution: 0
% 0.21/0.44 % res_clause_to_clause_subsumption: 0
% 0.21/0.44 % res_orphan_elimination: 0
% 0.21/0.44 % res_tautology_del: 0
% 0.21/0.44 % res_num_eq_res_simplified: 0
% 0.21/0.44 % res_num_sel_changes: 0
% 0.21/0.44 % res_moves_from_active_to_pass: 0
% 0.21/0.44
% 0.21/0.44 % Status Unknown
% 0.21/0.49 % Orienting using strategy ClausalAll
% 0.21/0.49 % FOF problem with conjecture
% 0.21/0.49 % 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_789ad3.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a8bd0a.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_3757ce | grep -v "SZS"
% 0.21/0.51
% 0.21/0.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % ------ iProver source info
% 0.21/0.51
% 0.21/0.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.51 % git: non_committed_changes: true
% 0.21/0.51 % git: last_make_outside_of_git: true
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % ------ Input Options
% 0.21/0.51
% 0.21/0.51 % --out_options all
% 0.21/0.51 % --tptp_safe_out true
% 0.21/0.51 % --problem_path ""
% 0.21/0.51 % --include_path ""
% 0.21/0.51 % --clausifier .//eprover
% 0.21/0.51 % --clausifier_options --tstp-format
% 0.21/0.51 % --stdin false
% 0.21/0.51 % --dbg_backtrace false
% 0.21/0.51 % --dbg_dump_prop_clauses false
% 0.21/0.51 % --dbg_dump_prop_clauses_file -
% 0.21/0.51 % --dbg_out_stat false
% 0.21/0.51
% 0.21/0.51 % ------ General Options
% 0.21/0.51
% 0.21/0.51 % --fof false
% 0.21/0.51 % --time_out_real 150.
% 0.21/0.51 % --time_out_prep_mult 0.2
% 0.21/0.51 % --time_out_virtual -1.
% 0.21/0.51 % --schedule none
% 0.21/0.51 % --ground_splitting input
% 0.21/0.51 % --splitting_nvd 16
% 0.21/0.51 % --non_eq_to_eq false
% 0.21/0.51 % --prep_gs_sim true
% 0.21/0.51 % --prep_unflatten false
% 0.21/0.51 % --prep_res_sim true
% 0.21/0.51 % --prep_upred true
% 0.21/0.51 % --res_sim_input true
% 0.21/0.51 % --clause_weak_htbl true
% 0.21/0.51 % --gc_record_bc_elim false
% 0.21/0.51 % --symbol_type_check false
% 0.21/0.51 % --clausify_out false
% 0.21/0.51 % --large_theory_mode false
% 0.21/0.51 % --prep_sem_filter none
% 0.21/0.51 % --prep_sem_filter_out false
% 0.21/0.51 % --preprocessed_out false
% 0.21/0.51 % --sub_typing false
% 0.21/0.51 % --brand_transform false
% 0.21/0.51 % --pure_diseq_elim true
% 0.21/0.51 % --min_unsat_core false
% 0.21/0.51 % --pred_elim true
% 0.21/0.51 % --add_important_lit false
% 0.21/0.51 % --soft_assumptions false
% 0.21/0.51 % --reset_solvers false
% 0.21/0.51 % --bc_imp_inh []
% 0.21/0.51 % --conj_cone_tolerance 1.5
% 0.21/0.51 % --prolific_symb_bound 500
% 0.21/0.51 % --lt_threshold 2000
% 0.21/0.51
% 0.21/0.51 % ------ SAT Options
% 0.21/0.51
% 0.21/0.51 % --sat_mode false
% 0.21/0.51 % --sat_fm_restart_options ""
% 0.21/0.51 % --sat_gr_def false
% 0.21/0.51 % --sat_epr_types true
% 0.21/0.51 % --sat_non_cyclic_types false
% 0.21/0.51 % --sat_finite_models false
% 0.21/0.51 % --sat_fm_lemmas false
% 0.21/0.51 % --sat_fm_prep false
% 0.21/0.51 % --sat_fm_uc_incr true
% 0.21/0.51 % --sat_out_model small
% 0.21/0.51 % --sat_out_clauses false
% 0.21/0.51
% 0.21/0.51 % ------ QBF Options
% 0.21/0.51
% 0.21/0.51 % --qbf_mode false
% 0.21/0.51 % --qbf_elim_univ true
% 0.21/0.51 % --qbf_sk_in true
% 0.21/0.51 % --qbf_pred_elim true
% 0.21/0.51 % --qbf_split 32
% 0.21/0.51
% 0.21/0.51 % ------ BMC1 Options
% 0.21/0.51
% 0.21/0.51 % --bmc1_incremental false
% 0.21/0.51 % --bmc1_axioms reachable_all
% 0.21/0.51 % --bmc1_min_bound 0
% 0.21/0.51 % --bmc1_max_bound -1
% 0.21/0.51 % --bmc1_max_bound_default -1
% 0.21/0.51 % --bmc1_symbol_reachability true
% 0.21/0.51 % --bmc1_property_lemmas false
% 0.21/0.51 % --bmc1_k_induction false
% 0.21/0.51 % --bmc1_non_equiv_states false
% 0.21/0.51 % --bmc1_deadlock false
% 0.21/0.51 % --bmc1_ucm false
% 0.21/0.51 % --bmc1_add_unsat_core none
% 0.21/0.51 % --bmc1_unsat_core_children false
% 0.21/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.51 % --bmc1_out_stat full
% 0.21/0.51 % --bmc1_ground_init false
% 0.21/0.51 % --bmc1_pre_inst_next_state false
% 0.21/0.51 % --bmc1_pre_inst_state false
% 0.21/0.51 % --bmc1_pre_inst_reach_state false
% 0.21/0.51 % --bmc1_out_unsat_core false
% 0.21/0.51 % --bmc1_aig_witness_out false
% 0.21/0.51 % --bmc1_verbose false
% 0.21/0.51 % --bmc1_dump_clauses_tptp false
% 0.76/1.06 % --bmc1_dump_unsat_core_tptp false
% 0.76/1.06 % --bmc1_dump_file -
% 0.76/1.06 % --bmc1_ucm_expand_uc_limit 128
% 0.76/1.06 % --bmc1_ucm_n_expand_iterations 6
% 0.76/1.06 % --bmc1_ucm_extend_mode 1
% 0.76/1.06 % --bmc1_ucm_init_mode 2
% 0.76/1.06 % --bmc1_ucm_cone_mode none
% 0.76/1.06 % --bmc1_ucm_reduced_relation_type 0
% 0.76/1.06 % --bmc1_ucm_relax_model 4
% 0.76/1.06 % --bmc1_ucm_full_tr_after_sat true
% 0.76/1.06 % --bmc1_ucm_expand_neg_assumptions false
% 0.76/1.06 % --bmc1_ucm_layered_model none
% 0.76/1.06 % --bmc1_ucm_max_lemma_size 10
% 0.76/1.06
% 0.76/1.06 % ------ AIG Options
% 0.76/1.06
% 0.76/1.06 % --aig_mode false
% 0.76/1.06
% 0.76/1.06 % ------ Instantiation Options
% 0.76/1.06
% 0.76/1.06 % --instantiation_flag true
% 0.76/1.06 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.76/1.06 % --inst_solver_per_active 750
% 0.76/1.06 % --inst_solver_calls_frac 0.5
% 0.76/1.06 % --inst_passive_queue_type priority_queues
% 0.76/1.06 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.76/1.06 % --inst_passive_queues_freq [25;2]
% 0.76/1.06 % --inst_dismatching true
% 0.76/1.06 % --inst_eager_unprocessed_to_passive true
% 0.76/1.06 % --inst_prop_sim_given true
% 0.76/1.06 % --inst_prop_sim_new false
% 0.76/1.06 % --inst_orphan_elimination true
% 0.76/1.06 % --inst_learning_loop_flag true
% 0.76/1.06 % --inst_learning_start 3000
% 0.76/1.06 % --inst_learning_factor 2
% 0.76/1.06 % --inst_start_prop_sim_after_learn 3
% 0.76/1.06 % --inst_sel_renew solver
% 0.76/1.06 % --inst_lit_activity_flag true
% 0.76/1.06 % --inst_out_proof true
% 0.76/1.06
% 0.76/1.06 % ------ Resolution Options
% 0.76/1.06
% 0.76/1.06 % --resolution_flag true
% 0.76/1.06 % --res_lit_sel kbo_max
% 0.76/1.06 % --res_to_prop_solver none
% 0.76/1.06 % --res_prop_simpl_new false
% 0.76/1.06 % --res_prop_simpl_given false
% 0.76/1.06 % --res_passive_queue_type priority_queues
% 0.76/1.06 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.76/1.06 % --res_passive_queues_freq [15;5]
% 0.76/1.06 % --res_forward_subs full
% 0.76/1.06 % --res_backward_subs full
% 0.76/1.06 % --res_forward_subs_resolution true
% 0.76/1.06 % --res_backward_subs_resolution true
% 0.76/1.06 % --res_orphan_elimination false
% 0.76/1.06 % --res_time_limit 1000.
% 0.76/1.06 % --res_out_proof true
% 0.76/1.06 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_789ad3.s
% 0.76/1.06 % --modulo true
% 0.76/1.06
% 0.76/1.06 % ------ Combination Options
% 0.76/1.06
% 0.76/1.06 % --comb_res_mult 1000
% 0.76/1.06 % --comb_inst_mult 300
% 0.76/1.06 % ------
% 0.76/1.06
% 0.76/1.06 % ------ Parsing...% successful
% 0.76/1.06
% 0.76/1.06 % ------ 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.06
% 0.76/1.06 % ------ Proving...
% 0.76/1.06 % ------ Problem Properties
% 0.76/1.06
% 0.76/1.06 %
% 0.76/1.06 % EPR false
% 0.76/1.06 % Horn false
% 0.76/1.06 % Has equality true
% 0.76/1.06
% 0.76/1.06 % % ------ Input Options Time Limit: Unbounded
% 0.76/1.06
% 0.76/1.06
% 0.76/1.06 Compiling...
% 0.76/1.06 Loading plugin: done.
% 0.76/1.06 Compiling...
% 0.76/1.06 Loading plugin: done.
% 0.76/1.06 Compiling...
% 0.76/1.06 Loading plugin: done.
% 0.76/1.06 Compiling...
% 0.76/1.06 Loading plugin: done.
% 0.76/1.06 Compiling...
% 0.76/1.06 Loading plugin: done.
% 0.76/1.06 % % ------ Current options:
% 0.76/1.06
% 0.76/1.06 % ------ Input Options
% 0.76/1.06
% 0.76/1.06 % --out_options all
% 0.76/1.06 % --tptp_safe_out true
% 0.76/1.06 % --problem_path ""
% 0.76/1.06 % --include_path ""
% 0.76/1.06 % --clausifier .//eprover
% 0.76/1.06 % --clausifier_options --tstp-format
% 0.76/1.06 % --stdin false
% 0.76/1.06 % --dbg_backtrace false
% 0.76/1.06 % --dbg_dump_prop_clauses false
% 0.76/1.06 % --dbg_dump_prop_clauses_file -
% 0.76/1.06 % --dbg_out_stat false
% 0.76/1.06
% 0.76/1.06 % ------ General Options
% 0.76/1.06
% 0.76/1.06 % --fof false
% 0.76/1.06 % --time_out_real 150.
% 0.76/1.06 % --time_out_prep_mult 0.2
% 0.76/1.06 % --time_out_virtual -1.
% 0.76/1.06 % --schedule none
% 0.76/1.06 % --ground_splitting input
% 0.76/1.06 % --splitting_nvd 16
% 0.76/1.06 % --non_eq_to_eq false
% 0.76/1.06 % --prep_gs_sim true
% 0.76/1.06 % --prep_unflatten false
% 0.76/1.06 % --prep_res_sim true
% 0.76/1.06 % --prep_upred true
% 0.76/1.06 % --res_sim_input true
% 0.76/1.06 % --clause_weak_htbl true
% 0.76/1.06 % --gc_record_bc_elim false
% 0.76/1.06 % --symbol_type_check false
% 0.76/1.06 % --clausify_out false
% 0.76/1.06 % --large_theory_mode false
% 0.76/1.06 % --prep_sem_filter none
% 0.76/1.06 % --prep_sem_filter_out false
% 0.76/1.06 % --preprocessed_out false
% 0.76/1.06 % --sub_typing false
% 0.76/1.06 % --brand_transform false
% 0.76/1.06 % --pure_diseq_elim true
% 0.76/1.06 % --min_unsat_core false
% 0.76/1.06 % --pred_elim true
% 0.76/1.06 % --add_important_lit false
% 0.76/1.06 % --soft_assumptions false
% 0.76/1.06 % --reset_solvers false
% 0.76/1.06 % --bc_imp_inh []
% 0.76/1.06 % --conj_cone_tolerance 1.5
% 0.76/1.06 % --prolific_symb_bound 500
% 0.76/1.06 % --lt_threshold 2000
% 0.76/1.06
% 0.76/1.06 % ------ SAT Options
% 0.76/1.06
% 0.76/1.06 % --sat_mode false
% 0.76/1.06 % --sat_fm_restart_options ""
% 0.76/1.06 % --sat_gr_def false
% 0.76/1.06 % --sat_epr_types true
% 0.76/1.06 % --sat_non_cyclic_types false
% 0.76/1.06 % --sat_finite_models false
% 0.76/1.06 % --sat_fm_lemmas false
% 0.76/1.06 % --sat_fm_prep false
% 0.76/1.06 % --sat_fm_uc_incr true
% 0.76/1.06 % --sat_out_model small
% 0.76/1.06 % --sat_out_clauses false
% 0.76/1.06
% 0.76/1.06 % ------ QBF Options
% 0.76/1.06
% 0.76/1.06 % --qbf_mode false
% 0.76/1.06 % --qbf_elim_univ true
% 0.76/1.06 % --qbf_sk_in true
% 0.76/1.06 % --qbf_pred_elim true
% 0.76/1.06 % --qbf_split 32
% 0.76/1.06
% 0.76/1.06 % ------ BMC1 Options
% 0.76/1.06
% 0.76/1.06 % --bmc1_incremental false
% 0.76/1.06 % --bmc1_axioms reachable_all
% 0.76/1.06 % --bmc1_min_bound 0
% 0.76/1.06 % --bmc1_max_bound -1
% 0.76/1.06 % --bmc1_max_bound_default -1
% 0.76/1.06 % --bmc1_symbol_reachability true
% 0.76/1.06 % --bmc1_property_lemmas false
% 0.76/1.06 % --bmc1_k_induction false
% 0.76/1.06 % --bmc1_non_equiv_states false
% 0.76/1.06 % --bmc1_deadlock false
% 0.76/1.06 % --bmc1_ucm false
% 0.76/1.06 % --bmc1_add_unsat_core none
% 0.76/1.06 % --bmc1_unsat_core_children false
% 0.76/1.06 % --bmc1_unsat_core_extrapolate_axioms false
% 0.76/1.06 % --bmc1_out_stat full
% 0.76/1.06 % --bmc1_ground_init false
% 0.76/1.06 % --bmc1_pre_inst_next_state false
% 0.76/1.06 % --bmc1_pre_inst_state false
% 0.76/1.06 % --bmc1_pre_inst_reach_state false
% 0.76/1.06 % --bmc1_out_unsat_core false
% 0.76/1.06 % --bmc1_aig_witness_out false
% 0.76/1.06 % --bmc1_verbose false
% 0.76/1.06 % --bmc1_dump_clauses_tptp false
% 0.76/1.06 % --bmc1_dump_unsat_core_tptp false
% 0.76/1.06 % --bmc1_dump_file -
% 0.76/1.06 % --bmc1_ucm_expand_uc_limit 128
% 0.76/1.06 % --bmc1_ucm_n_expand_iterations 6
% 0.76/1.06 % --bmc1_ucm_extend_mode 1
% 0.76/1.06 % --bmc1_ucm_init_mode 2
% 0.76/1.06 % --bmc1_ucm_cone_mode none
% 0.76/1.06 % --bmc1_ucm_reduced_relation_type 0
% 0.76/1.06 % --bmc1_ucm_relax_model 4
% 0.76/1.06 % --bmc1_ucm_full_tr_after_sat true
% 0.76/1.06 % --bmc1_ucm_expand_neg_assumptions false
% 0.76/1.06 % --bmc1_ucm_layered_model none
% 0.76/1.06 % --bmc1_ucm_max_lemma_size 10
% 0.76/1.06
% 0.76/1.06 % ------ AIG Options
% 0.76/1.06
% 0.76/1.06 % --aig_mode false
% 0.76/1.06
% 0.76/1.06 % ------ Instantiation Options
% 0.76/1.06
% 0.76/1.06 % --instantiation_flag true
% 0.76/1.06 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.76/1.06 % --inst_solver_per_active 750
% 0.76/1.06 % --inst_solver_calls_frac 0.5
% 0.76/1.06 % --inst_passive_queue_type priority_queues
% 0.76/1.06 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.76/1.06 % --inst_passive_queues_freq [25;2]
% 0.76/1.06 % --inst_dismatching true
% 0.76/1.06 % --inst_eager_unprocessed_to_passive true
% 0.76/1.06 % --inst_prop_sim_given true
% 0.76/1.06 % --inst_prop_sim_new false
% 0.76/1.06 % --inst_orphan_elimination true
% 0.76/1.06 % --inst_learning_loop_flag true
% 0.76/1.06 % --inst_learning_start 3000
% 0.76/1.06 % --inst_learning_factor 2
% 0.76/1.06 % --inst_start_prop_sim_after_learn 3
% 0.76/1.06 % --inst_sel_renew solver
% 0.76/1.06 % --inst_lit_activity_flag true
% 0.76/1.06 % --inst_out_proof true
% 0.76/1.06
% 0.76/1.06 % ------ Resolution Options
% 0.76/1.06
% 0.76/1.06 % --resolution_flag true
% 0.76/1.06 % --res_lit_sel kbo_max
% 0.76/1.06 % --res_to_prop_solver none
% 0.76/1.06 % --res_prop_simpl_new false
% 0.76/1.06 % --res_prop_simpl_given false
% 0.76/1.06 % --res_passive_queue_type priority_queues
% 0.76/1.06 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.76/1.06 % --res_passive_queues_freq [15;5]
% 0.76/1.06 % --res_forward_subs full
% 0.76/1.06 % --res_backward_subs full
% 0.76/1.06 % --res_forward_subs_resolution true
% 0.76/1.06 % --res_backward_subs_resolution true
% 0.76/1.06 % --res_orphan_elimination false
% 0.76/1.06 % --res_time_limit 1000.
% 0.76/1.06 % --res_out_proof true
% 0.76/1.06 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_789ad3.s
% 0.76/1.06 % --modulo true
% 0.76/1.06
% 0.76/1.06 % ------ Combination Options
% 0.76/1.06
% 0.76/1.06 % --comb_res_mult 1000
% 0.76/1.06 % --comb_inst_mult 300
% 0.76/1.06 % ------
% 0.76/1.06
% 0.76/1.06
% 0.76/1.06
% 0.76/1.06 % ------ Proving...
% 0.76/1.06 %
% 0.76/1.06
% 0.76/1.06
% 0.76/1.06 % Resolution empty clause
% 0.76/1.06
% 0.76/1.06 % ------ Statistics
% 0.76/1.06
% 0.76/1.06 % ------ General
% 0.76/1.06
% 0.76/1.06 % num_of_input_clauses: 104
% 0.76/1.06 % num_of_input_neg_conjectures: 3
% 0.76/1.06 % num_of_splits: 0
% 0.76/1.06 % num_of_split_atoms: 0
% 0.76/1.06 % num_of_sem_filtered_clauses: 0
% 0.76/1.06 % num_of_subtypes: 0
% 0.76/1.06 % monotx_restored_types: 0
% 0.76/1.06 % sat_num_of_epr_types: 0
% 0.76/1.06 % sat_num_of_non_cyclic_types: 0
% 0.76/1.06 % sat_guarded_non_collapsed_types: 0
% 0.76/1.06 % is_epr: 0
% 0.76/1.06 % is_horn: 0
% 0.76/1.06 % has_eq: 1
% 0.76/1.06 % num_pure_diseq_elim: 0
% 0.76/1.06 % simp_replaced_by: 0
% 0.76/1.06 % res_preprocessed: 7
% 0.76/1.06 % prep_upred: 0
% 0.76/1.06 % prep_unflattend: 0
% 0.76/1.06 % pred_elim_cands: 0
% 0.76/1.06 % pred_elim: 0
% 0.76/1.06 % pred_elim_cl: 0
% 0.76/1.06 % pred_elim_cycles: 0
% 0.76/1.06 % forced_gc_time: 0
% 0.76/1.06 % gc_basic_clause_elim: 0
% 0.76/1.06 % parsing_time: 0.005
% 0.76/1.06 % sem_filter_time: 0.
% 0.76/1.06 % pred_elim_time: 0.
% 0.76/1.06 % out_proof_time: 0.001
% 0.76/1.06 % monotx_time: 0.
% 0.76/1.06 % subtype_inf_time: 0.
% 0.76/1.06 % unif_index_cands_time: 0.
% 0.76/1.06 % unif_index_add_time: 0.
% 0.76/1.06 % total_time: 0.564
% 0.76/1.06 % num_of_symbols: 56
% 0.76/1.06 % num_of_terms: 404
% 0.76/1.06
% 0.76/1.06 % ------ Propositional Solver
% 0.76/1.06
% 0.76/1.06 % prop_solver_calls: 1
% 0.76/1.06 % prop_fast_solver_calls: 15
% 0.76/1.06 % prop_num_of_clauses: 128
% 0.76/1.06 % prop_preprocess_simplified: 314
% 0.76/1.06 % prop_fo_subsumed: 0
% 0.76/1.06 % prop_solver_time: 0.
% 0.76/1.06 % prop_fast_solver_time: 0.
% 0.76/1.06 % prop_unsat_core_time: 0.
% 0.76/1.06
% 0.76/1.06 % ------ QBF
% 0.76/1.06
% 0.76/1.06 % qbf_q_res: 0
% 0.76/1.06 % qbf_num_tautologies: 0
% 0.76/1.06 % qbf_prep_cycles: 0
% 0.76/1.06
% 0.76/1.06 % ------ BMC1
% 0.76/1.06
% 0.76/1.06 % bmc1_current_bound: -1
% 0.76/1.06 % bmc1_last_solved_bound: -1
% 0.76/1.06 % bmc1_unsat_core_size: -1
% 0.76/1.06 % bmc1_unsat_core_parents_size: -1
% 0.76/1.06 % bmc1_merge_next_fun: 0
% 0.76/1.06 % bmc1_unsat_core_clauses_time: 0.
% 0.76/1.06
% 0.76/1.06 % ------ Instantiation
% 0.76/1.06
% 0.76/1.06 % inst_num_of_clauses: 103
% 0.76/1.06 % inst_num_in_passive: 0
% 0.76/1.06 % inst_num_in_active: 0
% 0.76/1.06 % inst_num_in_unprocessed: 104
% 0.76/1.06 % inst_num_of_loops: 0
% 0.76/1.06 % inst_num_of_learning_restarts: 0
% 0.76/1.06 % inst_num_moves_active_passive: 0
% 0.76/1.06 % inst_lit_activity: 0
% 0.76/1.06 % inst_lit_activity_moves: 0
% 0.76/1.06 % inst_num_tautologies: 0
% 0.76/1.06 % inst_num_prop_implied: 0
% 0.76/1.06 % inst_num_existing_simplified: 0
% 0.76/1.06 % inst_num_eq_res_simplified: 0
% 0.76/1.06 % inst_num_child_elim: 0
% 0.76/1.06 % inst_num_of_dismatching_blockings: 0
% 0.76/1.06 % inst_num_of_non_proper_insts: 0
% 0.76/1.06 % inst_num_of_duplicates: 0
% 0.76/1.06 % inst_inst_num_from_inst_to_res: 0
% 0.76/1.06 % inst_dismatching_checking_time: 0.
% 0.76/1.06
% 0.76/1.06 % ------ Resolution
% 0.76/1.06
% 0.76/1.06 % res_num_of_clauses: 112
% 0.76/1.06 % res_num_in_passive: 0
% 0.76/1.06 % res_num_in_active: 50
% 0.76/1.06 % res_num_of_loops: 5
% 0.76/1.06 % res_forward_subset_subsumed: 46
% 0.76/1.06 % res_backward_subset_subsumed: 0
% 0.76/1.06 % res_forward_subsumed: 0
% 0.76/1.06 % res_backward_subsumed: 0
% 0.76/1.06 % res_forward_subsumption_resolution: 2
% 0.76/1.06 % res_backward_subsumption_resolution: 0
% 0.76/1.06 % res_clause_to_clause_subsumption: 2
% 0.76/1.06 % res_orphan_elimination: 0
% 0.76/1.06 % res_tautology_del: 0
% 0.76/1.06 % res_num_eq_res_simplified: 0
% 0.76/1.06 % res_num_sel_changes: 0
% 0.76/1.06 % res_moves_from_active_to_pass: 0
% 0.76/1.06
% 0.76/1.06 % Status Unsatisfiable
% 0.76/1.06 % SZS status Theorem
% 0.76/1.06 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------