TSTP Solution File: SWV409+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWV409+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.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:03 EDT 2022
% Result : Theorem 0.39s 0.68s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
fof(ax30,axiom,
! [U,V,W,X] :
( less_than(W,X)
=> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,X)) ),
input ).
fof(ax30_0,plain,
! [U,V,W,X] :
( ~ less_than(W,X)
| update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,X)) ),
inference(orientation,[status(thm)],[ax30]) ).
fof(ax29,axiom,
! [U,V,W,X] :
( strictly_less_than(X,W)
=> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,W)) ),
input ).
fof(ax29_0,plain,
! [U,V,W,X] :
( ~ strictly_less_than(X,W)
| update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,W)) ),
inference(orientation,[status(thm)],[ax29]) ).
fof(ax28,axiom,
! [U] : update_slb(create_slb,U) = create_slb,
input ).
fof(ax28_0,plain,
! [U] :
( update_slb(create_slb,U) = create_slb
| $false ),
inference(orientation,[status(thm)],[ax28]) ).
fof(ax27,axiom,
! [U,V,W,X] :
( ( V != W
& contains_slb(U,W) )
=> lookup_slb(insert_slb(U,pair(V,X)),W) = lookup_slb(U,W) ),
input ).
fof(ax27_0,plain,
! [U,V,W,X] :
( lookup_slb(insert_slb(U,pair(V,X)),W) = lookup_slb(U,W)
| ~ ( V != W
& contains_slb(U,W) ) ),
inference(orientation,[status(thm)],[ax27]) ).
fof(ax26,axiom,
! [U,V,W] : lookup_slb(insert_slb(U,pair(V,W)),V) = W,
input ).
fof(ax26_0,plain,
! [U,V,W] :
( lookup_slb(insert_slb(U,pair(V,W)),V) = W
| $false ),
inference(orientation,[status(thm)],[ax26]) ).
fof(ax25,axiom,
! [U,V,W,X] :
( ( V != W
& contains_slb(U,W) )
=> remove_slb(insert_slb(U,pair(V,X)),W) = insert_slb(remove_slb(U,W),pair(V,X)) ),
input ).
fof(ax25_0,plain,
! [U,V,W,X] :
( remove_slb(insert_slb(U,pair(V,X)),W) = insert_slb(remove_slb(U,W),pair(V,X))
| ~ ( V != W
& contains_slb(U,W) ) ),
inference(orientation,[status(thm)],[ax25]) ).
fof(ax24,axiom,
! [U,V,W] : remove_slb(insert_slb(U,pair(V,W)),V) = U,
input ).
fof(ax24_0,plain,
! [U,V,W] :
( remove_slb(insert_slb(U,pair(V,W)),V) = U
| $false ),
inference(orientation,[status(thm)],[ax24]) ).
fof(ax23,axiom,
! [U,V,W,X,Y] :
( pair_in_list(insert_slb(U,pair(V,X)),W,Y)
<=> ( pair_in_list(U,W,Y)
| ( V = W
& X = Y ) ) ),
input ).
fof(ax23_0,plain,
! [U,V,W,X,Y] :
( pair_in_list(insert_slb(U,pair(V,X)),W,Y)
| ~ ( pair_in_list(U,W,Y)
| ( V = W
& X = Y ) ) ),
inference(orientation,[status(thm)],[ax23]) ).
fof(ax23_1,plain,
! [U,V,W,X,Y] :
( ~ pair_in_list(insert_slb(U,pair(V,X)),W,Y)
| pair_in_list(U,W,Y)
| ( V = W
& X = Y ) ),
inference(orientation,[status(thm)],[ax23]) ).
fof(ax22,axiom,
! [U,V] : ~ pair_in_list(create_slb,U,V),
input ).
fof(ax22_0,plain,
! [U,V] :
( ~ pair_in_list(create_slb,U,V)
| $false ),
inference(orientation,[status(thm)],[ax22]) ).
fof(ax21,axiom,
! [U,V,W,X] :
( contains_slb(insert_slb(U,pair(V,X)),W)
<=> ( contains_slb(U,W)
| V = W ) ),
input ).
fof(ax21_0,plain,
! [U,V,W,X] :
( contains_slb(insert_slb(U,pair(V,X)),W)
| ~ ( contains_slb(U,W)
| V = W ) ),
inference(orientation,[status(thm)],[ax21]) ).
fof(ax21_1,plain,
! [U,V,W,X] :
( ~ contains_slb(insert_slb(U,pair(V,X)),W)
| contains_slb(U,W)
| V = W ),
inference(orientation,[status(thm)],[ax21]) ).
fof(ax20,axiom,
! [U] : ~ contains_slb(create_slb,U),
input ).
fof(ax20_0,plain,
! [U] :
( ~ contains_slb(create_slb,U)
| $false ),
inference(orientation,[status(thm)],[ax20]) ).
fof(ax19,axiom,
! [U,V,W] : isnonempty_slb(insert_slb(U,pair(V,W))),
input ).
fof(ax19_0,plain,
! [U,V,W] :
( isnonempty_slb(insert_slb(U,pair(V,W)))
| $false ),
inference(orientation,[status(thm)],[ax19]) ).
fof(ax18,axiom,
~ isnonempty_slb(create_slb),
input ).
fof(ax18_0,plain,
( ~ isnonempty_slb(create_slb)
| $false ),
inference(orientation,[status(thm)],[ax18]) ).
fof(bottom_smallest,axiom,
! [U] : less_than(bottom,U),
input ).
fof(bottom_smallest_0,plain,
! [U] :
( less_than(bottom,U)
| $false ),
inference(orientation,[status(thm)],[bottom_smallest]) ).
fof(stricly_smaller_definition,axiom,
! [U,V] :
( strictly_less_than(U,V)
<=> ( less_than(U,V)
& ~ less_than(V,U) ) ),
input ).
fof(stricly_smaller_definition_0,plain,
! [U,V] :
( strictly_less_than(U,V)
| ~ ( less_than(U,V)
& ~ less_than(V,U) ) ),
inference(orientation,[status(thm)],[stricly_smaller_definition]) ).
fof(stricly_smaller_definition_1,plain,
! [U,V] :
( ~ strictly_less_than(U,V)
| ( less_than(U,V)
& ~ less_than(V,U) ) ),
inference(orientation,[status(thm)],[stricly_smaller_definition]) ).
fof(reflexivity,axiom,
! [U] : less_than(U,U),
input ).
fof(reflexivity_0,plain,
! [U] :
( less_than(U,U)
| $false ),
inference(orientation,[status(thm)],[reflexivity]) ).
fof(transitivity,axiom,
! [U,V,W] :
( ( less_than(U,V)
& less_than(V,W) )
=> less_than(U,W) ),
input ).
fof(transitivity_0,plain,
! [U,V,W] :
( less_than(U,W)
| ~ ( less_than(U,V)
& less_than(V,W) ) ),
inference(orientation,[status(thm)],[transitivity]) ).
fof(def_lhs_atom1,axiom,
! [W,U] :
( lhs_atom1(W,U)
<=> less_than(U,W) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [U,V,W] :
( lhs_atom1(W,U)
| ~ ( less_than(U,V)
& less_than(V,W) ) ),
inference(fold_definition,[status(thm)],[transitivity_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [U] :
( lhs_atom2(U)
<=> less_than(U,U) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [U] :
( lhs_atom2(U)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [V,U] :
( lhs_atom3(V,U)
<=> ~ strictly_less_than(U,V) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [U,V] :
( lhs_atom3(V,U)
| ( less_than(U,V)
& ~ less_than(V,U) ) ),
inference(fold_definition,[status(thm)],[stricly_smaller_definition_1,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [V,U] :
( lhs_atom4(V,U)
<=> strictly_less_than(U,V) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [U,V] :
( lhs_atom4(V,U)
| ~ ( less_than(U,V)
& ~ less_than(V,U) ) ),
inference(fold_definition,[status(thm)],[stricly_smaller_definition_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [U] :
( lhs_atom5(U)
<=> less_than(bottom,U) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [U] :
( lhs_atom5(U)
| $false ),
inference(fold_definition,[status(thm)],[bottom_smallest_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
( lhs_atom6
<=> ~ isnonempty_slb(create_slb) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
( lhs_atom6
| $false ),
inference(fold_definition,[status(thm)],[ax18_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [W,V,U] :
( lhs_atom7(W,V,U)
<=> isnonempty_slb(insert_slb(U,pair(V,W))) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [U,V,W] :
( lhs_atom7(W,V,U)
| $false ),
inference(fold_definition,[status(thm)],[ax19_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [U] :
( lhs_atom8(U)
<=> ~ contains_slb(create_slb,U) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
! [U] :
( lhs_atom8(U)
| $false ),
inference(fold_definition,[status(thm)],[ax20_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [X,W,V,U] :
( lhs_atom9(X,W,V,U)
<=> ~ contains_slb(insert_slb(U,pair(V,X)),W) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
! [U,V,W,X] :
( lhs_atom9(X,W,V,U)
| contains_slb(U,W)
| V = W ),
inference(fold_definition,[status(thm)],[ax21_1,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [X,W,V,U] :
( lhs_atom10(X,W,V,U)
<=> contains_slb(insert_slb(U,pair(V,X)),W) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
! [U,V,W,X] :
( lhs_atom10(X,W,V,U)
| ~ ( contains_slb(U,W)
| V = W ) ),
inference(fold_definition,[status(thm)],[ax21_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [V,U] :
( lhs_atom11(V,U)
<=> ~ pair_in_list(create_slb,U,V) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
! [U,V] :
( lhs_atom11(V,U)
| $false ),
inference(fold_definition,[status(thm)],[ax22_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
! [Y,X,W,V,U] :
( lhs_atom12(Y,X,W,V,U)
<=> ~ pair_in_list(insert_slb(U,pair(V,X)),W,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
! [U,V,W,X,Y] :
( lhs_atom12(Y,X,W,V,U)
| pair_in_list(U,W,Y)
| ( V = W
& X = Y ) ),
inference(fold_definition,[status(thm)],[ax23_1,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
! [Y,X,W,V,U] :
( lhs_atom13(Y,X,W,V,U)
<=> pair_in_list(insert_slb(U,pair(V,X)),W,Y) ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
! [U,V,W,X,Y] :
( lhs_atom13(Y,X,W,V,U)
| ~ ( pair_in_list(U,W,Y)
| ( V = W
& X = Y ) ) ),
inference(fold_definition,[status(thm)],[ax23_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
! [W,V,U] :
( lhs_atom14(W,V,U)
<=> remove_slb(insert_slb(U,pair(V,W)),V) = U ),
inference(definition,[],]) ).
fof(to_be_clausified_13,plain,
! [U,V,W] :
( lhs_atom14(W,V,U)
| $false ),
inference(fold_definition,[status(thm)],[ax24_0,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
! [X,W,V,U] :
( lhs_atom15(X,W,V,U)
<=> remove_slb(insert_slb(U,pair(V,X)),W) = insert_slb(remove_slb(U,W),pair(V,X)) ),
inference(definition,[],]) ).
fof(to_be_clausified_14,plain,
! [U,V,W,X] :
( lhs_atom15(X,W,V,U)
| ~ ( V != W
& contains_slb(U,W) ) ),
inference(fold_definition,[status(thm)],[ax25_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
! [W,V,U] :
( lhs_atom16(W,V,U)
<=> lookup_slb(insert_slb(U,pair(V,W)),V) = W ),
inference(definition,[],]) ).
fof(to_be_clausified_15,plain,
! [U,V,W] :
( lhs_atom16(W,V,U)
| $false ),
inference(fold_definition,[status(thm)],[ax26_0,def_lhs_atom16]) ).
fof(def_lhs_atom17,axiom,
! [X,W,V,U] :
( lhs_atom17(X,W,V,U)
<=> lookup_slb(insert_slb(U,pair(V,X)),W) = lookup_slb(U,W) ),
inference(definition,[],]) ).
fof(to_be_clausified_16,plain,
! [U,V,W,X] :
( lhs_atom17(X,W,V,U)
| ~ ( V != W
& contains_slb(U,W) ) ),
inference(fold_definition,[status(thm)],[ax27_0,def_lhs_atom17]) ).
fof(def_lhs_atom18,axiom,
! [U] :
( lhs_atom18(U)
<=> update_slb(create_slb,U) = create_slb ),
inference(definition,[],]) ).
fof(to_be_clausified_17,plain,
! [U] :
( lhs_atom18(U)
| $false ),
inference(fold_definition,[status(thm)],[ax28_0,def_lhs_atom18]) ).
fof(def_lhs_atom19,axiom,
! [X,W] :
( lhs_atom19(X,W)
<=> ~ strictly_less_than(X,W) ),
inference(definition,[],]) ).
fof(to_be_clausified_18,plain,
! [U,V,W,X] :
( lhs_atom19(X,W)
| update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,W)) ),
inference(fold_definition,[status(thm)],[ax29_0,def_lhs_atom19]) ).
fof(def_lhs_atom20,axiom,
! [X,W] :
( lhs_atom20(X,W)
<=> ~ less_than(W,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_19,plain,
! [U,V,W,X] :
( lhs_atom20(X,W)
| update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,X)) ),
inference(fold_definition,[status(thm)],[ax30_0,def_lhs_atom20]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X5,X4,X1,X2,X3] :
( lhs_atom13(X5,X4,X1,X2,X3)
| ~ ( pair_in_list(X3,X1,X5)
| ( X2 = X1
& X4 = X5 ) ) ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_1,axiom,
! [X5,X4,X1,X2,X3] :
( lhs_atom12(X5,X4,X1,X2,X3)
| pair_in_list(X3,X1,X5)
| ( X2 = X1
& X4 = X5 ) ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_2,axiom,
! [X4,X1,X2,X3] :
( lhs_atom17(X4,X1,X2,X3)
| ~ ( X2 != X1
& contains_slb(X3,X1) ) ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_3,axiom,
! [X4,X1,X2,X3] :
( lhs_atom15(X4,X1,X2,X3)
| ~ ( X2 != X1
& contains_slb(X3,X1) ) ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_4,axiom,
! [X4,X1,X2,X3] :
( lhs_atom10(X4,X1,X2,X3)
| ~ ( contains_slb(X3,X1)
| X2 = X1 ) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_5,axiom,
! [X4,X1,X2,X3] :
( lhs_atom9(X4,X1,X2,X3)
| contains_slb(X3,X1)
| X2 = X1 ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_6,axiom,
! [X4,X1,X2,X3] :
( lhs_atom20(X4,X1)
| update_slb(insert_slb(X3,pair(X2,X4)),X1) = insert_slb(update_slb(X3,X1),pair(X2,X4)) ),
file('<stdin>',to_be_clausified_19) ).
fof(c_0_7,axiom,
! [X4,X1,X2,X3] :
( lhs_atom19(X4,X1)
| update_slb(insert_slb(X3,pair(X2,X4)),X1) = insert_slb(update_slb(X3,X1),pair(X2,X1)) ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_8,axiom,
! [X1,X2,X3] :
( lhs_atom1(X1,X3)
| ~ ( less_than(X3,X2)
& less_than(X2,X1) ) ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_9,axiom,
! [X1,X2,X3] :
( lhs_atom16(X1,X2,X3)
| ~ $true ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_10,axiom,
! [X1,X2,X3] :
( lhs_atom14(X1,X2,X3)
| ~ $true ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_11,axiom,
! [X1,X2,X3] :
( lhs_atom7(X1,X2,X3)
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_12,axiom,
! [X2,X3] :
( lhs_atom4(X2,X3)
| ~ ( less_than(X3,X2)
& ~ less_than(X2,X3) ) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_13,axiom,
! [X2,X3] :
( lhs_atom3(X2,X3)
| ( less_than(X3,X2)
& ~ less_than(X2,X3) ) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_14,axiom,
! [X2,X3] :
( lhs_atom11(X2,X3)
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_15,axiom,
! [X3] :
( lhs_atom18(X3)
| ~ $true ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_16,axiom,
! [X3] :
( lhs_atom8(X3)
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_17,axiom,
! [X3] :
( lhs_atom5(X3)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_18,axiom,
! [X3] :
( lhs_atom2(X3)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_19,axiom,
( lhs_atom6
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_20,axiom,
! [X5,X4,X1,X2,X3] :
( lhs_atom13(X5,X4,X1,X2,X3)
| ~ ( pair_in_list(X3,X1,X5)
| ( X2 = X1
& X4 = X5 ) ) ),
c_0_0 ).
fof(c_0_21,axiom,
! [X5,X4,X1,X2,X3] :
( lhs_atom12(X5,X4,X1,X2,X3)
| pair_in_list(X3,X1,X5)
| ( X2 = X1
& X4 = X5 ) ),
c_0_1 ).
fof(c_0_22,axiom,
! [X4,X1,X2,X3] :
( lhs_atom17(X4,X1,X2,X3)
| ~ ( X2 != X1
& contains_slb(X3,X1) ) ),
c_0_2 ).
fof(c_0_23,axiom,
! [X4,X1,X2,X3] :
( lhs_atom15(X4,X1,X2,X3)
| ~ ( X2 != X1
& contains_slb(X3,X1) ) ),
c_0_3 ).
fof(c_0_24,axiom,
! [X4,X1,X2,X3] :
( lhs_atom10(X4,X1,X2,X3)
| ~ ( contains_slb(X3,X1)
| X2 = X1 ) ),
c_0_4 ).
fof(c_0_25,axiom,
! [X4,X1,X2,X3] :
( lhs_atom9(X4,X1,X2,X3)
| contains_slb(X3,X1)
| X2 = X1 ),
c_0_5 ).
fof(c_0_26,axiom,
! [X4,X1,X2,X3] :
( lhs_atom20(X4,X1)
| update_slb(insert_slb(X3,pair(X2,X4)),X1) = insert_slb(update_slb(X3,X1),pair(X2,X4)) ),
c_0_6 ).
fof(c_0_27,axiom,
! [X4,X1,X2,X3] :
( lhs_atom19(X4,X1)
| update_slb(insert_slb(X3,pair(X2,X4)),X1) = insert_slb(update_slb(X3,X1),pair(X2,X1)) ),
c_0_7 ).
fof(c_0_28,axiom,
! [X1,X2,X3] :
( lhs_atom1(X1,X3)
| ~ ( less_than(X3,X2)
& less_than(X2,X1) ) ),
c_0_8 ).
fof(c_0_29,plain,
! [X1,X2,X3] : lhs_atom16(X1,X2,X3),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_30,plain,
! [X1,X2,X3] : lhs_atom14(X1,X2,X3),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_31,plain,
! [X1,X2,X3] : lhs_atom7(X1,X2,X3),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_32,plain,
! [X2,X3] :
( lhs_atom4(X2,X3)
| ~ ( less_than(X3,X2)
& ~ less_than(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_33,plain,
! [X2,X3] :
( lhs_atom3(X2,X3)
| ( less_than(X3,X2)
& ~ less_than(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_34,plain,
! [X2,X3] : lhs_atom11(X2,X3),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_35,plain,
! [X3] : lhs_atom18(X3),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_36,plain,
! [X3] : lhs_atom8(X3),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_37,plain,
! [X3] : lhs_atom5(X3),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_38,plain,
! [X3] : lhs_atom2(X3),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_39,plain,
lhs_atom6,
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_40,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ pair_in_list(X10,X8,X6)
| lhs_atom13(X6,X7,X8,X9,X10) )
& ( X9 != X8
| X7 != X6
| lhs_atom13(X6,X7,X8,X9,X10) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
fof(c_0_41,plain,
! [X6,X7,X8,X9,X10] :
( ( X9 = X8
| pair_in_list(X10,X8,X6)
| lhs_atom12(X6,X7,X8,X9,X10) )
& ( X7 = X6
| pair_in_list(X10,X8,X6)
| lhs_atom12(X6,X7,X8,X9,X10) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_21])]) ).
fof(c_0_42,plain,
! [X5,X6,X7,X8] :
( lhs_atom17(X5,X6,X7,X8)
| X7 = X6
| ~ contains_slb(X8,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
fof(c_0_43,plain,
! [X5,X6,X7,X8] :
( lhs_atom15(X5,X6,X7,X8)
| X7 = X6
| ~ contains_slb(X8,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])]) ).
fof(c_0_44,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_slb(X8,X6)
| lhs_atom10(X5,X6,X7,X8) )
& ( X7 != X6
| lhs_atom10(X5,X6,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
fof(c_0_45,plain,
! [X5,X6,X7,X8] :
( lhs_atom9(X5,X6,X7,X8)
| contains_slb(X8,X6)
| X7 = X6 ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_46,plain,
! [X5,X6,X7,X8] :
( lhs_atom20(X5,X6)
| update_slb(insert_slb(X8,pair(X7,X5)),X6) = insert_slb(update_slb(X8,X6),pair(X7,X5)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_26])])]) ).
fof(c_0_47,plain,
! [X5,X6,X7,X8] :
( lhs_atom19(X5,X6)
| update_slb(insert_slb(X8,pair(X7,X5)),X6) = insert_slb(update_slb(X8,X6),pair(X7,X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_27])])]) ).
fof(c_0_48,plain,
! [X4,X5,X6] :
( lhs_atom1(X4,X6)
| ~ less_than(X6,X5)
| ~ less_than(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
fof(c_0_49,plain,
! [X4,X5,X6] : lhs_atom16(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_50,plain,
! [X4,X5,X6] : lhs_atom14(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_51,plain,
! [X4,X5,X6] : lhs_atom7(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_52,plain,
! [X4,X5] :
( lhs_atom4(X4,X5)
| ~ less_than(X5,X4)
| less_than(X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])]) ).
fof(c_0_53,plain,
! [X4,X5] :
( ( less_than(X5,X4)
| lhs_atom3(X4,X5) )
& ( ~ less_than(X4,X5)
| lhs_atom3(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_33])]) ).
fof(c_0_54,plain,
! [X4,X5] : lhs_atom11(X4,X5),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_55,plain,
! [X4] : lhs_atom18(X4),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_56,plain,
! [X4] : lhs_atom8(X4),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_57,plain,
! [X4] : lhs_atom5(X4),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_58,plain,
! [X4] : lhs_atom2(X4),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_59,plain,
lhs_atom6,
c_0_39 ).
cnf(c_0_60,plain,
( lhs_atom13(X1,X2,X3,X4,X5)
| ~ pair_in_list(X5,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_61,plain,
( lhs_atom12(X1,X2,X3,X4,X5)
| pair_in_list(X5,X3,X1)
| X4 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_62,plain,
( lhs_atom12(X1,X2,X3,X4,X5)
| pair_in_list(X5,X3,X1)
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_63,plain,
( lhs_atom13(X1,X2,X3,X4,X5)
| X2 != X1
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_64,plain,
( X3 = X2
| lhs_atom17(X4,X2,X3,X1)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_65,plain,
( X3 = X2
| lhs_atom15(X4,X2,X3,X1)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_66,plain,
( lhs_atom10(X1,X2,X3,X4)
| ~ contains_slb(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_67,plain,
( X1 = X2
| contains_slb(X3,X2)
| lhs_atom9(X4,X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_68,plain,
( lhs_atom10(X1,X2,X3,X4)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_69,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3))
| lhs_atom20(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_70,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| lhs_atom19(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_71,plain,
( lhs_atom1(X2,X3)
| ~ less_than(X1,X2)
| ~ less_than(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_72,plain,
lhs_atom16(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_73,plain,
lhs_atom14(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_74,plain,
lhs_atom7(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_75,plain,
( less_than(X1,X2)
| lhs_atom4(X1,X2)
| ~ less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_76,plain,
( lhs_atom3(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_77,plain,
( lhs_atom3(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_78,plain,
lhs_atom11(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_79,plain,
lhs_atom18(X1),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_80,plain,
lhs_atom8(X1),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_81,plain,
lhs_atom5(X1),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_82,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_83,plain,
lhs_atom6,
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_84,plain,
( lhs_atom13(X1,X2,X3,X4,X5)
| ~ pair_in_list(X5,X3,X1) ),
c_0_60,
[final] ).
cnf(c_0_85,plain,
( lhs_atom12(X1,X2,X3,X4,X5)
| pair_in_list(X5,X3,X1)
| X4 = X3 ),
c_0_61,
[final] ).
cnf(c_0_86,plain,
( lhs_atom12(X1,X2,X3,X4,X5)
| pair_in_list(X5,X3,X1)
| X2 = X1 ),
c_0_62,
[final] ).
cnf(c_0_87,plain,
( lhs_atom13(X1,X2,X3,X4,X5)
| X2 != X1
| X4 != X3 ),
c_0_63,
[final] ).
cnf(c_0_88,plain,
( X3 = X2
| lhs_atom17(X4,X2,X3,X1)
| ~ contains_slb(X1,X2) ),
c_0_64,
[final] ).
cnf(c_0_89,plain,
( X3 = X2
| lhs_atom15(X4,X2,X3,X1)
| ~ contains_slb(X1,X2) ),
c_0_65,
[final] ).
cnf(c_0_90,plain,
( lhs_atom10(X1,X2,X3,X4)
| ~ contains_slb(X4,X2) ),
c_0_66,
[final] ).
cnf(c_0_91,plain,
( X1 = X2
| contains_slb(X3,X2)
| lhs_atom9(X4,X2,X1,X3) ),
c_0_67,
[final] ).
cnf(c_0_92,plain,
( lhs_atom10(X1,X2,X3,X4)
| X3 != X2 ),
c_0_68,
[final] ).
cnf(c_0_93,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3))
| lhs_atom20(X3,X4) ),
c_0_69,
[final] ).
cnf(c_0_94,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| lhs_atom19(X3,X4) ),
c_0_70,
[final] ).
cnf(c_0_95,plain,
( lhs_atom1(X2,X3)
| ~ less_than(X1,X2)
| ~ less_than(X3,X1) ),
c_0_71,
[final] ).
cnf(c_0_96,plain,
lhs_atom16(X1,X2,X3),
c_0_72,
[final] ).
cnf(c_0_97,plain,
lhs_atom14(X1,X2,X3),
c_0_73,
[final] ).
cnf(c_0_98,plain,
lhs_atom7(X1,X2,X3),
c_0_74,
[final] ).
cnf(c_0_99,plain,
( less_than(X1,X2)
| lhs_atom4(X1,X2)
| ~ less_than(X2,X1) ),
c_0_75,
[final] ).
cnf(c_0_100,plain,
( lhs_atom3(X1,X2)
| ~ less_than(X1,X2) ),
c_0_76,
[final] ).
cnf(c_0_101,plain,
( lhs_atom3(X1,X2)
| less_than(X2,X1) ),
c_0_77,
[final] ).
cnf(c_0_102,plain,
lhs_atom11(X1,X2),
c_0_78,
[final] ).
cnf(c_0_103,plain,
lhs_atom18(X1),
c_0_79,
[final] ).
cnf(c_0_104,plain,
lhs_atom8(X1),
c_0_80,
[final] ).
cnf(c_0_105,plain,
lhs_atom5(X1),
c_0_81,
[final] ).
cnf(c_0_106,plain,
lhs_atom2(X1),
c_0_82,
[final] ).
cnf(c_0_107,plain,
lhs_atom6,
c_0_83,
[final] ).
% End CNF derivation
cnf(c_0_84_0,axiom,
( pair_in_list(insert_slb(X5,pair(X4,X2)),X3,X1)
| ~ pair_in_list(X5,X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_84,def_lhs_atom13]) ).
cnf(c_0_85_0,axiom,
( ~ pair_in_list(insert_slb(X5,pair(X4,X2)),X3,X1)
| pair_in_list(X5,X3,X1)
| X4 = X3 ),
inference(unfold_definition,[status(thm)],[c_0_85,def_lhs_atom12]) ).
cnf(c_0_86_0,axiom,
( ~ pair_in_list(insert_slb(X5,pair(X4,X2)),X3,X1)
| pair_in_list(X5,X3,X1)
| X2 = X1 ),
inference(unfold_definition,[status(thm)],[c_0_86,def_lhs_atom12]) ).
cnf(c_0_87_0,axiom,
( pair_in_list(insert_slb(X5,pair(X4,X2)),X3,X1)
| X2 != X1
| X4 != X3 ),
inference(unfold_definition,[status(thm)],[c_0_87,def_lhs_atom13]) ).
cnf(c_0_88_0,axiom,
( lookup_slb(insert_slb(X1,pair(X3,X4)),X2) = lookup_slb(X1,X2)
| X3 = X2
| ~ contains_slb(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_88,def_lhs_atom17]) ).
cnf(c_0_89_0,axiom,
( remove_slb(insert_slb(X1,pair(X3,X4)),X2) = insert_slb(remove_slb(X1,X2),pair(X3,X4))
| X3 = X2
| ~ contains_slb(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_89,def_lhs_atom15]) ).
cnf(c_0_90_0,axiom,
( contains_slb(insert_slb(X4,pair(X3,X1)),X2)
| ~ contains_slb(X4,X2) ),
inference(unfold_definition,[status(thm)],[c_0_90,def_lhs_atom10]) ).
cnf(c_0_91_0,axiom,
( ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2)
| X1 = X2
| contains_slb(X3,X2) ),
inference(unfold_definition,[status(thm)],[c_0_91,def_lhs_atom9]) ).
cnf(c_0_92_0,axiom,
( contains_slb(insert_slb(X4,pair(X3,X1)),X2)
| X3 != X2 ),
inference(unfold_definition,[status(thm)],[c_0_92,def_lhs_atom10]) ).
cnf(c_0_93_0,axiom,
( ~ less_than(X4,X3)
| update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3)) ),
inference(unfold_definition,[status(thm)],[c_0_93,def_lhs_atom20]) ).
cnf(c_0_94_0,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(unfold_definition,[status(thm)],[c_0_94,def_lhs_atom19]) ).
cnf(c_0_95_0,axiom,
( less_than(X3,X2)
| ~ less_than(X1,X2)
| ~ less_than(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_95,def_lhs_atom1]) ).
cnf(c_0_99_0,axiom,
( strictly_less_than(X2,X1)
| less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_99,def_lhs_atom4]) ).
cnf(c_0_100_0,axiom,
( ~ strictly_less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_100,def_lhs_atom3]) ).
cnf(c_0_101_0,axiom,
( ~ strictly_less_than(X2,X1)
| less_than(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_101,def_lhs_atom3]) ).
cnf(c_0_96_0,axiom,
lookup_slb(insert_slb(X3,pair(X2,X1)),X2) = X1,
inference(unfold_definition,[status(thm)],[c_0_96,def_lhs_atom16]) ).
cnf(c_0_97_0,axiom,
remove_slb(insert_slb(X3,pair(X2,X1)),X2) = X3,
inference(unfold_definition,[status(thm)],[c_0_97,def_lhs_atom14]) ).
cnf(c_0_98_0,axiom,
isnonempty_slb(insert_slb(X3,pair(X2,X1))),
inference(unfold_definition,[status(thm)],[c_0_98,def_lhs_atom7]) ).
cnf(c_0_102_0,axiom,
~ pair_in_list(create_slb,X2,X1),
inference(unfold_definition,[status(thm)],[c_0_102,def_lhs_atom11]) ).
cnf(c_0_103_0,axiom,
update_slb(create_slb,X1) = create_slb,
inference(unfold_definition,[status(thm)],[c_0_103,def_lhs_atom18]) ).
cnf(c_0_104_0,axiom,
~ contains_slb(create_slb,X1),
inference(unfold_definition,[status(thm)],[c_0_104,def_lhs_atom8]) ).
cnf(c_0_105_0,axiom,
less_than(bottom,X1),
inference(unfold_definition,[status(thm)],[c_0_105,def_lhs_atom5]) ).
cnf(c_0_106_0,axiom,
less_than(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_106,def_lhs_atom2]) ).
cnf(c_0_107_0,axiom,
~ isnonempty_slb(create_slb),
inference(unfold_definition,[status(thm)],[c_0_107,def_lhs_atom6]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('<stdin>',totality) ).
fof(c_0_1_002,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
c_0_0 ).
fof(c_0_2_003,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3_004,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
c_0_3,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_4_0,axiom,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_1,axiom,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_006,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& less_than(X4,X3) )
=> ? [X5] :
( pair_in_list(update_slb(X1,X4),X2,X5)
& less_than(X4,X5) ) ),
file('<stdin>',l45_l49) ).
fof(c_0_1_007,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) ),
file('<stdin>',l45_l48) ).
fof(c_0_2_008,conjecture,
! [X1,X2,X3] :
( ( contains_slb(X1,X2)
& strictly_less_than(X2,X3) )
=> ( pair_in_list(update_slb(X1,X3),X2,X3)
| ? [X4] :
( pair_in_list(update_slb(X1,X3),X2,X4)
& less_than(X3,X4) ) ) ),
file('<stdin>',l45_co) ).
fof(c_0_3_009,lemma,
! [X1,X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) ),
file('<stdin>',l45_li4647) ).
fof(c_0_4_010,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& less_than(X4,X3) )
=> ? [X5] :
( pair_in_list(update_slb(X1,X4),X2,X5)
& less_than(X4,X5) ) ),
c_0_0 ).
fof(c_0_5_011,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) ),
c_0_1 ).
fof(c_0_6_012,negated_conjecture,
~ ! [X1,X2,X3] :
( ( contains_slb(X1,X2)
& strictly_less_than(X2,X3) )
=> ( pair_in_list(update_slb(X1,X3),X2,X3)
| ? [X4] :
( pair_in_list(update_slb(X1,X3),X2,X4)
& less_than(X3,X4) ) ) ),
inference(assume_negation,[status(cth)],[c_0_2]) ).
fof(c_0_7_013,lemma,
! [X1,X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) ),
c_0_3 ).
fof(c_0_8_014,lemma,
! [X6,X7,X8,X9] :
( ( pair_in_list(update_slb(X6,X9),X7,esk2_4(X6,X7,X8,X9))
| ~ pair_in_list(X6,X7,X8)
| ~ strictly_less_than(X7,X9)
| ~ less_than(X9,X8) )
& ( less_than(X9,esk2_4(X6,X7,X8,X9))
| ~ pair_in_list(X6,X7,X8)
| ~ strictly_less_than(X7,X9)
| ~ less_than(X9,X8) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_9_015,lemma,
! [X5,X6,X7,X8] :
( ~ pair_in_list(X5,X6,X7)
| ~ strictly_less_than(X6,X8)
| ~ strictly_less_than(X7,X8)
| pair_in_list(update_slb(X5,X8),X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_10_016,negated_conjecture,
! [X8] :
( contains_slb(esk3_0,esk4_0)
& strictly_less_than(esk4_0,esk5_0)
& ~ pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,esk5_0)
& ( ~ pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,X8)
| ~ less_than(esk5_0,X8) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11_017,lemma,
! [X4,X5] :
( ~ contains_slb(X4,X5)
| pair_in_list(X4,X5,esk1_2(X4,X5)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12_018,lemma,
( pair_in_list(update_slb(X4,X1),X3,esk2_4(X4,X3,X2,X1))
| ~ less_than(X1,X2)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_019,lemma,
( less_than(X1,esk2_4(X4,X3,X2,X1))
| ~ less_than(X1,X2)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14_020,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ strictly_less_than(X3,X2)
| ~ pair_in_list(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15_021,negated_conjecture,
( ~ less_than(esk5_0,X1)
| ~ pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16_022,negated_conjecture,
~ pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17_023,lemma,
( pair_in_list(X1,X2,esk1_2(X1,X2))
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18_024,negated_conjecture,
contains_slb(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19_025,negated_conjecture,
strictly_less_than(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20_026,lemma,
( pair_in_list(update_slb(X4,X1),X3,esk2_4(X4,X3,X2,X1))
| ~ less_than(X1,X2)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(X4,X3,X2) ),
c_0_12,
[final] ).
cnf(c_0_21_027,lemma,
( less_than(X1,esk2_4(X4,X3,X2,X1))
| ~ less_than(X1,X2)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(X4,X3,X2) ),
c_0_13,
[final] ).
cnf(c_0_22_028,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ strictly_less_than(X3,X2)
| ~ pair_in_list(X1,X3,X4) ),
c_0_14,
[final] ).
cnf(c_0_23_029,negated_conjecture,
( ~ less_than(esk5_0,X1)
| ~ pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,X1) ),
c_0_15,
[final] ).
cnf(c_0_24_030,negated_conjecture,
~ pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,esk5_0),
c_0_16,
[final] ).
cnf(c_0_25_031,lemma,
( pair_in_list(X1,X2,esk1_2(X1,X2))
| ~ contains_slb(X1,X2) ),
c_0_17,
[final] ).
cnf(c_0_26_032,negated_conjecture,
contains_slb(esk3_0,esk4_0),
c_0_18,
[final] ).
cnf(c_0_27_033,negated_conjecture,
strictly_less_than(esk4_0,esk5_0),
c_0_19,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_28,plain,
( pair_in_list(update_slb(X0,X1),X2,X1)
| ~ pair_in_list(X0,X2,X3)
| ~ strictly_less_than(X2,X1)
| ~ strictly_less_than(X3,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_22) ).
cnf(c_63,plain,
( pair_in_list(update_slb(X0,X1),X2,X1)
| ~ pair_in_list(X0,X2,X3)
| ~ strictly_less_than(X2,X1)
| ~ strictly_less_than(X3,X1) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_85,plain,
( pair_in_list(update_slb(X0,X1),X2,X1)
| ~ pair_in_list(X0,X2,X3)
| ~ strictly_less_than(X2,X1)
| ~ strictly_less_than(X3,X1) ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_96,plain,
( pair_in_list(update_slb(X0,X1),X2,X1)
| ~ pair_in_list(X0,X2,X3)
| ~ strictly_less_than(X2,X1)
| ~ strictly_less_than(X3,X1) ),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_102,plain,
( pair_in_list(update_slb(X0,X1),X2,X1)
| ~ pair_in_list(X0,X2,X3)
| ~ strictly_less_than(X2,X1)
| ~ strictly_less_than(X3,X1) ),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_196,plain,
( pair_in_list(update_slb(X0,X1),X2,X1)
| ~ pair_in_list(X0,X2,X3)
| ~ strictly_less_than(X2,X1)
| ~ strictly_less_than(X3,X1) ),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_13,plain,
( ~ less_than(X0,X1)
| less_than(X1,X0)
| strictly_less_than(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_99_0) ).
cnf(c_164,plain,
( ~ less_than(X0,X1)
| less_than(X1,X0)
| strictly_less_than(X0,X1) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_310,plain,
( ~ less_than(X0,X1)
| less_than(X1,X0)
| pair_in_list(update_slb(X2,X1),X3,X1)
| ~ pair_in_list(X2,X3,X0)
| ~ strictly_less_than(X3,X1) ),
inference(resolution,[status(thm)],[c_196,c_164]) ).
cnf(c_311,plain,
( ~ less_than(X0,X1)
| less_than(X1,X0)
| pair_in_list(update_slb(X2,X1),X3,X1)
| ~ pair_in_list(X2,X3,X0)
| ~ strictly_less_than(X3,X1) ),
inference(rewriting,[status(thm)],[c_310]) ).
cnf(c_0,plain,
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_4_0) ).
cnf(c_141,plain,
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_487,plain,
( less_than(X0,X1)
| pair_in_list(update_slb(X2,X0),X3,X0)
| ~ pair_in_list(X2,X3,X1)
| ~ strictly_less_than(X3,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_311,c_141]) ).
cnf(c_488,plain,
( less_than(X0,X1)
| pair_in_list(update_slb(X2,X0),X3,X0)
| ~ pair_in_list(X2,X3,X1)
| ~ strictly_less_than(X3,X0) ),
inference(rewriting,[status(thm)],[c_487]) ).
cnf(c_30,plain,
( ~ contains_slb(X0,X1)
| pair_in_list(X0,X1,sk3_esk1_2(X0,X1)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_25) ).
cnf(c_65,plain,
( ~ contains_slb(X0,X1)
| pair_in_list(X0,X1,sk3_esk1_2(X0,X1)) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_87,plain,
( ~ contains_slb(X0,X1)
| pair_in_list(X0,X1,sk3_esk1_2(X0,X1)) ),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_94,plain,
( ~ contains_slb(X0,X1)
| pair_in_list(X0,X1,sk3_esk1_2(X0,X1)) ),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_104,plain,
( ~ contains_slb(X0,X1)
| pair_in_list(X0,X1,sk3_esk1_2(X0,X1)) ),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_200,plain,
( ~ contains_slb(X0,X1)
| pair_in_list(X0,X1,sk3_esk1_2(X0,X1)) ),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_499,plain,
( less_than(X0,sk3_esk1_2(X1,X2))
| ~ contains_slb(X1,X2)
| pair_in_list(update_slb(X1,X0),X2,X0)
| ~ strictly_less_than(X2,X0) ),
inference(resolution,[status(thm)],[c_488,c_200]) ).
cnf(c_500,plain,
( less_than(X0,sk3_esk1_2(X1,X2))
| ~ contains_slb(X1,X2)
| pair_in_list(update_slb(X1,X0),X2,X0)
| ~ strictly_less_than(X2,X0) ),
inference(rewriting,[status(thm)],[c_499]) ).
cnf(c_31,negated_conjecture,
~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,sk3_esk5_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_24) ).
cnf(c_69,negated_conjecture,
~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_88,negated_conjecture,
~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_93,negated_conjecture,
~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_105,negated_conjecture,
~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_202,negated_conjecture,
~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_105]) ).
cnf(c_515,plain,
( less_than(sk3_esk5_0,sk3_esk1_2(sk3_esk3_0,sk3_esk4_0))
| ~ contains_slb(sk3_esk3_0,sk3_esk4_0)
| ~ strictly_less_than(sk3_esk4_0,sk3_esk5_0) ),
inference(resolution,[status(thm)],[c_500,c_202]) ).
cnf(c_516,plain,
( less_than(sk3_esk5_0,sk3_esk1_2(sk3_esk3_0,sk3_esk4_0))
| ~ contains_slb(sk3_esk3_0,sk3_esk4_0)
| ~ strictly_less_than(sk3_esk4_0,sk3_esk5_0) ),
inference(rewriting,[status(thm)],[c_515]) ).
cnf(c_33,negated_conjecture,
strictly_less_than(sk3_esk4_0,sk3_esk5_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_27) ).
cnf(c_73,negated_conjecture,
strictly_less_than(sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_90,negated_conjecture,
strictly_less_than(sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_91,negated_conjecture,
strictly_less_than(sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_99,negated_conjecture,
strictly_less_than(sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_190,negated_conjecture,
strictly_less_than(sk3_esk4_0,sk3_esk5_0),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_32,negated_conjecture,
contains_slb(sk3_esk3_0,sk3_esk4_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_26) ).
cnf(c_71,negated_conjecture,
contains_slb(sk3_esk3_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_89,negated_conjecture,
contains_slb(sk3_esk3_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_92,negated_conjecture,
contains_slb(sk3_esk3_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_106,negated_conjecture,
contains_slb(sk3_esk3_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_92]) ).
cnf(c_204,negated_conjecture,
contains_slb(sk3_esk3_0,sk3_esk4_0),
inference(copy,[status(esa)],[c_106]) ).
cnf(c_26,plain,
( ~ less_than(X0,X1)
| pair_in_list(update_slb(X2,X0),X3,sk3_esk2_4(X2,X3,X1,X0))
| ~ pair_in_list(X2,X3,X1)
| ~ strictly_less_than(X3,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_20) ).
cnf(c_59,plain,
( ~ less_than(X0,X1)
| pair_in_list(update_slb(X2,X0),X3,sk3_esk2_4(X2,X3,X1,X0))
| ~ pair_in_list(X2,X3,X1)
| ~ strictly_less_than(X3,X0) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_83,plain,
( ~ less_than(X0,X1)
| pair_in_list(update_slb(X2,X0),X3,sk3_esk2_4(X2,X3,X1,X0))
| ~ pair_in_list(X2,X3,X1)
| ~ strictly_less_than(X3,X0) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_98,plain,
( ~ less_than(X0,X1)
| pair_in_list(update_slb(X2,X0),X3,sk3_esk2_4(X2,X3,X1,X0))
| ~ pair_in_list(X2,X3,X1)
| ~ strictly_less_than(X3,X0) ),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_100,plain,
( ~ less_than(X0,X1)
| pair_in_list(update_slb(X2,X0),X3,sk3_esk2_4(X2,X3,X1,X0))
| ~ pair_in_list(X2,X3,X1)
| ~ strictly_less_than(X3,X0) ),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_192,plain,
( ~ less_than(X0,X1)
| pair_in_list(update_slb(X2,X0),X3,sk3_esk2_4(X2,X3,X1,X0))
| ~ pair_in_list(X2,X3,X1)
| ~ strictly_less_than(X3,X0) ),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_29,negated_conjecture,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_23) ).
cnf(c_67,negated_conjecture,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,X0) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_86,negated_conjecture,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,X0) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_95,negated_conjecture,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,X0) ),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_103,negated_conjecture,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,X0) ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_198,negated_conjecture,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(update_slb(sk3_esk3_0,sk3_esk5_0),sk3_esk4_0,X0) ),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_334,plain,
( ~ less_than(sk3_esk5_0,sk3_esk2_4(sk3_esk3_0,sk3_esk4_0,X0,sk3_esk5_0))
| ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(sk3_esk3_0,sk3_esk4_0,X0)
| ~ strictly_less_than(sk3_esk4_0,sk3_esk5_0) ),
inference(resolution,[status(thm)],[c_192,c_198]) ).
cnf(c_335,plain,
( ~ less_than(sk3_esk5_0,sk3_esk2_4(sk3_esk3_0,sk3_esk4_0,X0,sk3_esk5_0))
| ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(sk3_esk3_0,sk3_esk4_0,X0)
| ~ strictly_less_than(sk3_esk4_0,sk3_esk5_0) ),
inference(rewriting,[status(thm)],[c_334]) ).
cnf(c_363,plain,
( ~ less_than(sk3_esk5_0,sk3_esk2_4(sk3_esk3_0,sk3_esk4_0,X0,sk3_esk5_0))
| ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(sk3_esk3_0,sk3_esk4_0,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_335,c_190]) ).
cnf(c_364,plain,
( ~ less_than(sk3_esk5_0,sk3_esk2_4(sk3_esk3_0,sk3_esk4_0,X0,sk3_esk5_0))
| ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(sk3_esk3_0,sk3_esk4_0,X0) ),
inference(rewriting,[status(thm)],[c_363]) ).
cnf(c_27,plain,
( less_than(X0,sk3_esk2_4(X1,X2,X3,X0))
| ~ less_than(X0,X3)
| ~ pair_in_list(X1,X2,X3)
| ~ strictly_less_than(X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_5e5488.p',c_0_21) ).
cnf(c_61,plain,
( less_than(X0,sk3_esk2_4(X1,X2,X3,X0))
| ~ less_than(X0,X3)
| ~ pair_in_list(X1,X2,X3)
| ~ strictly_less_than(X2,X0) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_84,plain,
( less_than(X0,sk3_esk2_4(X1,X2,X3,X0))
| ~ less_than(X0,X3)
| ~ pair_in_list(X1,X2,X3)
| ~ strictly_less_than(X2,X0) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_97,plain,
( less_than(X0,sk3_esk2_4(X1,X2,X3,X0))
| ~ less_than(X0,X3)
| ~ pair_in_list(X1,X2,X3)
| ~ strictly_less_than(X2,X0) ),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_101,plain,
( less_than(X0,sk3_esk2_4(X1,X2,X3,X0))
| ~ less_than(X0,X3)
| ~ pair_in_list(X1,X2,X3)
| ~ strictly_less_than(X2,X0) ),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_194,plain,
( less_than(X0,sk3_esk2_4(X1,X2,X3,X0))
| ~ less_than(X0,X3)
| ~ pair_in_list(X1,X2,X3)
| ~ strictly_less_than(X2,X0) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_372,plain,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(sk3_esk3_0,sk3_esk4_0,X0)
| ~ strictly_less_than(sk3_esk4_0,sk3_esk5_0) ),
inference(resolution,[status(thm)],[c_364,c_194]) ).
cnf(c_373,plain,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(sk3_esk3_0,sk3_esk4_0,X0)
| ~ strictly_less_than(sk3_esk4_0,sk3_esk5_0) ),
inference(rewriting,[status(thm)],[c_372]) ).
cnf(c_401,plain,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(sk3_esk3_0,sk3_esk4_0,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_373,c_190]) ).
cnf(c_402,plain,
( ~ less_than(sk3_esk5_0,X0)
| ~ pair_in_list(sk3_esk3_0,sk3_esk4_0,X0) ),
inference(rewriting,[status(thm)],[c_401]) ).
cnf(c_405,plain,
( ~ less_than(sk3_esk5_0,sk3_esk1_2(sk3_esk3_0,sk3_esk4_0))
| ~ contains_slb(sk3_esk3_0,sk3_esk4_0) ),
inference(resolution,[status(thm)],[c_402,c_200]) ).
cnf(c_406,plain,
( ~ less_than(sk3_esk5_0,sk3_esk1_2(sk3_esk3_0,sk3_esk4_0))
| ~ contains_slb(sk3_esk3_0,sk3_esk4_0) ),
inference(rewriting,[status(thm)],[c_405]) ).
cnf(c_409,plain,
~ less_than(sk3_esk5_0,sk3_esk1_2(sk3_esk3_0,sk3_esk4_0)),
inference(forward_subsumption_resolution,[status(thm)],[c_406,c_204]) ).
cnf(c_410,plain,
~ less_than(sk3_esk5_0,sk3_esk1_2(sk3_esk3_0,sk3_esk4_0)),
inference(rewriting,[status(thm)],[c_409]) ).
cnf(c_520,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_516,c_190,c_204,c_410]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV409+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n015.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 17:21:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % FOF problem with conjecture
% 0.20/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_64482a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_5e5488.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e174b0 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.39/0.67 % --bmc1_dump_unsat_core_tptp false
% 0.39/0.67 % --bmc1_dump_file -
% 0.39/0.67 % --bmc1_ucm_expand_uc_limit 128
% 0.39/0.67 % --bmc1_ucm_n_expand_iterations 6
% 0.39/0.67 % --bmc1_ucm_extend_mode 1
% 0.39/0.67 % --bmc1_ucm_init_mode 2
% 0.39/0.67 % --bmc1_ucm_cone_mode none
% 0.39/0.67 % --bmc1_ucm_reduced_relation_type 0
% 0.39/0.67 % --bmc1_ucm_relax_model 4
% 0.39/0.67 % --bmc1_ucm_full_tr_after_sat true
% 0.39/0.67 % --bmc1_ucm_expand_neg_assumptions false
% 0.39/0.67 % --bmc1_ucm_layered_model none
% 0.39/0.67 % --bmc1_ucm_max_lemma_size 10
% 0.39/0.67
% 0.39/0.67 % ------ AIG Options
% 0.39/0.67
% 0.39/0.67 % --aig_mode false
% 0.39/0.67
% 0.39/0.67 % ------ Instantiation Options
% 0.39/0.67
% 0.39/0.67 % --instantiation_flag true
% 0.39/0.67 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.39/0.67 % --inst_solver_per_active 750
% 0.39/0.67 % --inst_solver_calls_frac 0.5
% 0.39/0.67 % --inst_passive_queue_type priority_queues
% 0.39/0.67 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.39/0.67 % --inst_passive_queues_freq [25;2]
% 0.39/0.67 % --inst_dismatching true
% 0.39/0.67 % --inst_eager_unprocessed_to_passive true
% 0.39/0.67 % --inst_prop_sim_given true
% 0.39/0.67 % --inst_prop_sim_new false
% 0.39/0.67 % --inst_orphan_elimination true
% 0.39/0.67 % --inst_learning_loop_flag true
% 0.39/0.67 % --inst_learning_start 3000
% 0.39/0.67 % --inst_learning_factor 2
% 0.39/0.67 % --inst_start_prop_sim_after_learn 3
% 0.39/0.67 % --inst_sel_renew solver
% 0.39/0.67 % --inst_lit_activity_flag true
% 0.39/0.67 % --inst_out_proof true
% 0.39/0.67
% 0.39/0.67 % ------ Resolution Options
% 0.39/0.67
% 0.39/0.67 % --resolution_flag true
% 0.39/0.67 % --res_lit_sel kbo_max
% 0.39/0.67 % --res_to_prop_solver none
% 0.39/0.67 % --res_prop_simpl_new false
% 0.39/0.67 % --res_prop_simpl_given false
% 0.39/0.67 % --res_passive_queue_type priority_queues
% 0.39/0.67 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.39/0.67 % --res_passive_queues_freq [15;5]
% 0.39/0.67 % --res_forward_subs full
% 0.39/0.67 % --res_backward_subs full
% 0.39/0.67 % --res_forward_subs_resolution true
% 0.39/0.67 % --res_backward_subs_resolution true
% 0.39/0.67 % --res_orphan_elimination false
% 0.39/0.67 % --res_time_limit 1000.
% 0.39/0.67 % --res_out_proof true
% 0.39/0.67 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_64482a.s
% 0.39/0.67 % --modulo true
% 0.39/0.67
% 0.39/0.67 % ------ Combination Options
% 0.39/0.67
% 0.39/0.67 % --comb_res_mult 1000
% 0.39/0.67 % --comb_inst_mult 300
% 0.39/0.67 % ------
% 0.39/0.67
% 0.39/0.67 % ------ Parsing...% successful
% 0.39/0.67
% 0.39/0.67 % ------ 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.39/0.67
% 0.39/0.67 % ------ Proving...
% 0.39/0.67 % ------ Problem Properties
% 0.39/0.67
% 0.39/0.67 %
% 0.39/0.67 % EPR false
% 0.39/0.67 % Horn false
% 0.39/0.67 % Has equality true
% 0.39/0.67
% 0.39/0.67 % % ------ Input Options Time Limit: Unbounded
% 0.39/0.67
% 0.39/0.67
% 0.39/0.67 Compiling...
% 0.39/0.67 Loading plugin: done.
% 0.39/0.67 Compiling...
% 0.39/0.67 Loading plugin: done.
% 0.39/0.67 % % ------ Current options:
% 0.39/0.67
% 0.39/0.67 % ------ Input Options
% 0.39/0.67
% 0.39/0.67 % --out_options all
% 0.39/0.67 % --tptp_safe_out true
% 0.39/0.67 % --problem_path ""
% 0.39/0.67 % --include_path ""
% 0.39/0.67 % --clausifier .//eprover
% 0.39/0.67 % --clausifier_options --tstp-format
% 0.39/0.67 % --stdin false
% 0.39/0.67 % --dbg_backtrace false
% 0.39/0.67 % --dbg_dump_prop_clauses false
% 0.39/0.67 % --dbg_dump_prop_clauses_file -
% 0.39/0.67 % --dbg_out_stat false
% 0.39/0.67
% 0.39/0.67 % ------ General Options
% 0.39/0.67
% 0.39/0.67 % --fof false
% 0.39/0.67 % --time_out_real 150.
% 0.39/0.67 % --time_out_prep_mult 0.2
% 0.39/0.67 % --time_out_virtual -1.
% 0.39/0.67 % --schedule none
% 0.39/0.67 % --ground_splitting input
% 0.39/0.67 % --splitting_nvd 16
% 0.39/0.67 % --non_eq_to_eq false
% 0.39/0.67 % --prep_gs_sim true
% 0.39/0.67 % --prep_unflatten false
% 0.39/0.67 % --prep_res_sim true
% 0.39/0.67 % --prep_upred true
% 0.39/0.67 % --res_sim_input true
% 0.39/0.67 % --clause_weak_htbl true
% 0.39/0.67 % --gc_record_bc_elim false
% 0.39/0.67 % --symbol_type_check false
% 0.39/0.67 % --clausify_out false
% 0.39/0.67 % --large_theory_mode false
% 0.39/0.67 % --prep_sem_filter none
% 0.39/0.67 % --prep_sem_filter_out false
% 0.39/0.67 % --preprocessed_out false
% 0.39/0.67 % --sub_typing false
% 0.39/0.67 % --brand_transform false
% 0.39/0.67 % --pure_diseq_elim true
% 0.39/0.67 % --min_unsat_core false
% 0.39/0.67 % --pred_elim true
% 0.39/0.67 % --add_important_lit false
% 0.39/0.67 % --soft_assumptions false
% 0.39/0.67 % --reset_solvers false
% 0.39/0.67 % --bc_imp_inh []
% 0.39/0.67 % --conj_cone_tolerance 1.5
% 0.39/0.67 % --prolific_symb_bound 500
% 0.39/0.67 % --lt_threshold 2000
% 0.39/0.67
% 0.39/0.67 % ------ SAT Options
% 0.39/0.67
% 0.39/0.67 % --sat_mode false
% 0.39/0.67 % --sat_fm_restart_options ""
% 0.39/0.67 % --sat_gr_def false
% 0.39/0.67 % --sat_epr_types true
% 0.39/0.67 % --sat_non_cyclic_types false
% 0.39/0.67 % --sat_finite_models false
% 0.39/0.67 % --sat_fm_lemmas false
% 0.39/0.67 % --sat_fm_prep false
% 0.39/0.67 % --sat_fm_uc_incr true
% 0.39/0.67 % --sat_out_model small
% 0.39/0.67 % --sat_out_clauses false
% 0.39/0.67
% 0.39/0.67 % ------ QBF Options
% 0.39/0.67
% 0.39/0.67 % --qbf_mode false
% 0.39/0.67 % --qbf_elim_univ true
% 0.39/0.67 % --qbf_sk_in true
% 0.39/0.67 % --qbf_pred_elim true
% 0.39/0.67 % --qbf_split 32
% 0.39/0.67
% 0.39/0.67 % ------ BMC1 Options
% 0.39/0.67
% 0.39/0.67 % --bmc1_incremental false
% 0.39/0.67 % --bmc1_axioms reachable_all
% 0.39/0.67 % --bmc1_min_bound 0
% 0.39/0.67 % --bmc1_max_bound -1
% 0.39/0.67 % --bmc1_max_bound_default -1
% 0.39/0.67 % --bmc1_symbol_reachability true
% 0.39/0.67 % --bmc1_property_lemmas false
% 0.39/0.67 % --bmc1_k_induction false
% 0.39/0.67 % --bmc1_non_equiv_states false
% 0.39/0.67 % --bmc1_deadlock false
% 0.39/0.67 % --bmc1_ucm false
% 0.39/0.67 % --bmc1_add_unsat_core none
% 0.39/0.67 % --bmc1_unsat_core_children false
% 0.39/0.67 % --bmc1_unsat_core_extrapolate_axioms false
% 0.39/0.67 % --bmc1_out_stat full
% 0.39/0.67 % --bmc1_ground_init false
% 0.39/0.67 % --bmc1_pre_inst_next_state false
% 0.39/0.67 % --bmc1_pre_inst_state false
% 0.39/0.67 % --bmc1_pre_inst_reach_state false
% 0.39/0.67 % --bmc1_out_unsat_core false
% 0.39/0.67 % --bmc1_aig_witness_out false
% 0.39/0.67 % --bmc1_verbose false
% 0.39/0.67 % --bmc1_dump_clauses_tptp false
% 0.39/0.67 % --bmc1_dump_unsat_core_tptp false
% 0.39/0.67 % --bmc1_dump_file -
% 0.39/0.67 % --bmc1_ucm_expand_uc_limit 128
% 0.39/0.67 % --bmc1_ucm_n_expand_iterations 6
% 0.39/0.67 % --bmc1_ucm_extend_mode 1
% 0.39/0.67 % --bmc1_ucm_init_mode 2
% 0.39/0.67 % --bmc1_ucm_cone_mode none
% 0.39/0.67 % --bmc1_ucm_reduced_relation_type 0
% 0.39/0.67 % --bmc1_ucm_relax_model 4
% 0.39/0.67 % --bmc1_ucm_full_tr_after_sat true
% 0.39/0.67 % --bmc1_ucm_expand_neg_assumptions false
% 0.39/0.67 % --bmc1_ucm_layered_model none
% 0.39/0.67 % --bmc1_ucm_max_lemma_size 10
% 0.39/0.67
% 0.39/0.67 % ------ AIG Options
% 0.39/0.67
% 0.39/0.67 % --aig_mode false
% 0.39/0.67
% 0.39/0.67 % ------ Instantiation Options
% 0.39/0.67
% 0.39/0.67 % --instantiation_flag true
% 0.39/0.67 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.39/0.67 % --inst_solver_per_active 750
% 0.39/0.67 % --inst_solver_calls_frac 0.5
% 0.39/0.67 % --inst_passive_queue_type priority_queues
% 0.39/0.67 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.39/0.67 % --inst_passive_queues_freq [25;2]
% 0.39/0.67 % --inst_dismatching true
% 0.39/0.68 % --inst_eager_unprocessed_to_passive true
% 0.39/0.68 % --inst_prop_sim_given true
% 0.39/0.68 % --inst_prop_sim_new false
% 0.39/0.68 % --inst_orphan_elimination true
% 0.39/0.68 % --inst_learning_loop_flag true
% 0.39/0.68 % --inst_learning_start 3000
% 0.39/0.68 % --inst_learning_factor 2
% 0.39/0.68 % --inst_start_prop_sim_after_learn 3
% 0.39/0.68 % --inst_sel_renew solver
% 0.39/0.68 % --inst_lit_activity_flag true
% 0.39/0.68 % --inst_out_proof true
% 0.39/0.68
% 0.39/0.68 % ------ Resolution Options
% 0.39/0.68
% 0.39/0.68 % --resolution_flag true
% 0.39/0.68 % --res_lit_sel kbo_max
% 0.39/0.68 % --res_to_prop_solver none
% 0.39/0.68 % --res_prop_simpl_new false
% 0.39/0.68 % --res_prop_simpl_given false
% 0.39/0.68 % --res_passive_queue_type priority_queues
% 0.39/0.68 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.39/0.68 % --res_passive_queues_freq [15;5]
% 0.39/0.68 % --res_forward_subs full
% 0.39/0.68 % --res_backward_subs full
% 0.39/0.68 % --res_forward_subs_resolution true
% 0.39/0.68 % --res_backward_subs_resolution true
% 0.39/0.68 % --res_orphan_elimination false
% 0.39/0.68 % --res_time_limit 1000.
% 0.39/0.68 % --res_out_proof true
% 0.39/0.68 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_64482a.s
% 0.39/0.68 % --modulo true
% 0.39/0.68
% 0.39/0.68 % ------ Combination Options
% 0.39/0.68
% 0.39/0.68 % --comb_res_mult 1000
% 0.39/0.68 % --comb_inst_mult 300
% 0.39/0.68 % ------
% 0.39/0.68
% 0.39/0.68
% 0.39/0.68
% 0.39/0.68 % ------ Proving...
% 0.39/0.68 %
% 0.39/0.68
% 0.39/0.68
% 0.39/0.68 % Resolution empty clause
% 0.39/0.68
% 0.39/0.68 % ------ Statistics
% 0.39/0.68
% 0.39/0.68 % ------ General
% 0.39/0.68
% 0.39/0.68 % num_of_input_clauses: 34
% 0.39/0.68 % num_of_input_neg_conjectures: 4
% 0.39/0.68 % num_of_splits: 0
% 0.39/0.68 % num_of_split_atoms: 0
% 0.39/0.68 % num_of_sem_filtered_clauses: 0
% 0.39/0.68 % num_of_subtypes: 0
% 0.39/0.68 % monotx_restored_types: 0
% 0.39/0.68 % sat_num_of_epr_types: 0
% 0.39/0.68 % sat_num_of_non_cyclic_types: 0
% 0.39/0.68 % sat_guarded_non_collapsed_types: 0
% 0.39/0.68 % is_epr: 0
% 0.39/0.68 % is_horn: 0
% 0.39/0.68 % has_eq: 1
% 0.39/0.68 % num_pure_diseq_elim: 0
% 0.39/0.68 % simp_replaced_by: 0
% 0.39/0.68 % res_preprocessed: 12
% 0.39/0.68 % prep_upred: 0
% 0.39/0.68 % prep_unflattend: 0
% 0.39/0.68 % pred_elim_cands: 0
% 0.39/0.68 % pred_elim: 0
% 0.39/0.68 % pred_elim_cl: 0
% 0.39/0.68 % pred_elim_cycles: 0
% 0.39/0.68 % forced_gc_time: 0
% 0.39/0.68 % gc_basic_clause_elim: 0
% 0.39/0.68 % parsing_time: 0.001
% 0.39/0.68 % sem_filter_time: 0.
% 0.39/0.68 % pred_elim_time: 0.
% 0.39/0.68 % out_proof_time: 0.003
% 0.39/0.68 % monotx_time: 0.
% 0.39/0.68 % subtype_inf_time: 0.
% 0.39/0.68 % unif_index_cands_time: 0.
% 0.39/0.68 % unif_index_add_time: 0.
% 0.39/0.68 % total_time: 0.264
% 0.39/0.68 % num_of_symbols: 42
% 0.39/0.68 % num_of_terms: 403
% 0.39/0.68
% 0.39/0.68 % ------ Propositional Solver
% 0.39/0.68
% 0.39/0.68 % prop_solver_calls: 1
% 0.39/0.68 % prop_fast_solver_calls: 43
% 0.39/0.68 % prop_num_of_clauses: 58
% 0.39/0.68 % prop_preprocess_simplified: 150
% 0.39/0.68 % prop_fo_subsumed: 0
% 0.39/0.68 % prop_solver_time: 0.
% 0.39/0.68 % prop_fast_solver_time: 0.
% 0.39/0.68 % prop_unsat_core_time: 0.
% 0.39/0.68
% 0.39/0.68 % ------ QBF
% 0.39/0.68
% 0.39/0.68 % qbf_q_res: 0
% 0.39/0.68 % qbf_num_tautologies: 0
% 0.39/0.68 % qbf_prep_cycles: 0
% 0.39/0.68
% 0.39/0.68 % ------ BMC1
% 0.39/0.68
% 0.39/0.68 % bmc1_current_bound: -1
% 0.39/0.68 % bmc1_last_solved_bound: -1
% 0.39/0.68 % bmc1_unsat_core_size: -1
% 0.39/0.68 % bmc1_unsat_core_parents_size: -1
% 0.39/0.68 % bmc1_merge_next_fun: 0
% 0.39/0.68 % bmc1_unsat_core_clauses_time: 0.
% 0.39/0.68
% 0.39/0.68 % ------ Instantiation
% 0.39/0.68
% 0.39/0.68 % inst_num_of_clauses: 33
% 0.39/0.68 % inst_num_in_passive: 0
% 0.39/0.68 % inst_num_in_active: 0
% 0.39/0.68 % inst_num_in_unprocessed: 34
% 0.39/0.68 % inst_num_of_loops: 0
% 0.39/0.68 % inst_num_of_learning_restarts: 0
% 0.39/0.68 % inst_num_moves_active_passive: 0
% 0.39/0.68 % inst_lit_activity: 0
% 0.39/0.68 % inst_lit_activity_moves: 0
% 0.39/0.68 % inst_num_tautologies: 0
% 0.39/0.68 % inst_num_prop_implied: 0
% 0.39/0.68 % inst_num_existing_simplified: 0
% 0.39/0.68 % inst_num_eq_res_simplified: 0
% 0.39/0.68 % inst_num_child_elim: 0
% 0.39/0.68 % inst_num_of_dismatching_blockings: 0
% 0.39/0.68 % inst_num_of_non_proper_insts: 0
% 0.39/0.68 % inst_num_of_duplicates: 0
% 0.39/0.68 % inst_inst_num_from_inst_to_res: 0
% 0.39/0.68 % inst_dismatching_checking_time: 0.
% 0.39/0.68
% 0.39/0.68 % ------ Resolution
% 0.39/0.68
% 0.39/0.68 % res_num_of_clauses: 82
% 0.39/0.68 % res_num_in_passive: 17
% 0.39/0.68 % res_num_in_active: 50
% 0.39/0.68 % res_num_of_loops: 41
% 0.39/0.68 % res_forward_subset_subsumed: 33
% 0.39/0.68 % res_backward_subset_subsumed: 0
% 0.39/0.68 % res_forward_subsumed: 11
% 0.39/0.68 % res_backward_subsumed: 1
% 0.39/0.68 % res_forward_subsumption_resolution: 8
% 0.39/0.68 % res_backward_subsumption_resolution: 0
% 0.39/0.68 % res_clause_to_clause_subsumption: 193
% 0.39/0.68 % res_orphan_elimination: 0
% 0.39/0.68 % res_tautology_del: 0
% 0.39/0.68 % res_num_eq_res_simplified: 0
% 0.39/0.68 % res_num_sel_changes: 0
% 0.39/0.68 % res_moves_from_active_to_pass: 0
% 0.39/0.68
% 0.39/0.68 % Status Unsatisfiable
% 0.39/0.68 % SZS status Theorem
% 0.39/0.68 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------