%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : DAT436-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 06:23:41 PM UTC 2026
% Result : Unsatisfiable 0.34s 0.59s
% Output : CNFRefutation 0.34s
% 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
cnf(rule20,axiom,
ifselsort(false,cons(N,L)) = cons(min(cons(N,L)),selsort(replace(min(cons(N,L)),N,L))),
input ).
fof(rule20_0,plain,
! [L,N] :
( ifselsort(false,cons(N,L)) = cons(min(cons(N,L)),selsort(replace(min(cons(N,L)),N,L)))
| $false ),
inference(orientation,[status(thm)],[rule20]) ).
cnf(rule19,axiom,
ifselsort(true,cons(N,L)) = cons(N,selsort(L)),
input ).
fof(rule19_0,plain,
! [L,N] :
( ifselsort(true,cons(N,L)) = cons(N,selsort(L))
| $false ),
inference(orientation,[status(thm)],[rule19]) ).
cnf(rule18,axiom,
selsort(cons(N,L)) = ifselsort(eq(N,min(cons(N,L))),cons(N,L)),
input ).
fof(rule18_0,plain,
! [L,N] :
( selsort(cons(N,L)) = ifselsort(eq(N,min(cons(N,L))),cons(N,L))
| $false ),
inference(orientation,[status(thm)],[rule18]) ).
cnf(rule17,axiom,
selsort(nil) = nil,
input ).
fof(rule17_0,plain,
( selsort(nil) = nil
| $false ),
inference(orientation,[status(thm)],[rule17]) ).
cnf(rule16,axiom,
ifrepl(false,N,M,cons(K,L)) = cons(K,replace(N,M,L)),
input ).
fof(rule16_0,plain,
! [K,L,M,N] :
( ifrepl(false,N,M,cons(K,L)) = cons(K,replace(N,M,L))
| $false ),
inference(orientation,[status(thm)],[rule16]) ).
cnf(rule15,axiom,
ifrepl(true,N,M,cons(K,L)) = cons(M,L),
input ).
fof(rule15_0,plain,
! [K,L,M,N] :
( ifrepl(true,N,M,cons(K,L)) = cons(M,L)
| $false ),
inference(orientation,[status(thm)],[rule15]) ).
cnf(rule14,axiom,
replace(N,M,cons(K,L)) = ifrepl(eq(N,K),N,M,cons(K,L)),
input ).
fof(rule14_0,plain,
! [K,L,M,N] :
( replace(N,M,cons(K,L)) = ifrepl(eq(N,K),N,M,cons(K,L))
| $false ),
inference(orientation,[status(thm)],[rule14]) ).
cnf(rule13,axiom,
replace(N,M,nil) = nil,
input ).
fof(rule13_0,plain,
! [M,N] :
( replace(N,M,nil) = nil
| $false ),
inference(orientation,[status(thm)],[rule13]) ).
cnf(rule12,axiom,
ifmin(false,cons(N,cons(M,L))) = min(cons(M,L)),
input ).
fof(rule12_0,plain,
! [L,M,N] :
( ifmin(false,cons(N,cons(M,L))) = min(cons(M,L))
| $false ),
inference(orientation,[status(thm)],[rule12]) ).
cnf(rule11,axiom,
ifmin(true,cons(N,cons(M,L))) = min(cons(N,L)),
input ).
fof(rule11_0,plain,
! [L,M,N] :
( ifmin(true,cons(N,cons(M,L))) = min(cons(N,L))
| $false ),
inference(orientation,[status(thm)],[rule11]) ).
cnf(rule10,axiom,
min(cons(N,cons(M,L))) = ifmin(le(N,M),cons(N,cons(M,L))),
input ).
fof(rule10_0,plain,
! [L,M,N] :
( min(cons(N,cons(M,L))) = ifmin(le(N,M),cons(N,cons(M,L)))
| $false ),
inference(orientation,[status(thm)],[rule10]) ).
cnf(rule9,axiom,
min(cons(s(N),nil)) = s(N),
input ).
fof(rule9_0,plain,
! [N] :
( min(cons(s(N),nil)) = s(N)
| $false ),
inference(orientation,[status(thm)],[rule9]) ).
cnf(rule8,axiom,
min(cons(zero,nil)) = zero,
input ).
fof(rule8_0,plain,
( min(cons(zero,nil)) = zero
| $false ),
inference(orientation,[status(thm)],[rule8]) ).
cnf(rule7,axiom,
le(s(X),s(Y)) = le(X,Y),
input ).
fof(rule7_0,plain,
! [X,Y] :
( le(s(X),s(Y)) = le(X,Y)
| $false ),
inference(orientation,[status(thm)],[rule7]) ).
cnf(rule6,axiom,
le(s(X),zero) = false,
input ).
fof(rule6_0,plain,
! [X] :
( le(s(X),zero) = false
| $false ),
inference(orientation,[status(thm)],[rule6]) ).
cnf(rule5,axiom,
le(zero,Y) = true,
input ).
fof(rule5_0,plain,
! [Y] :
( le(zero,Y) = true
| $false ),
inference(orientation,[status(thm)],[rule5]) ).
cnf(rule4,axiom,
eq(s(X),s(Y)) = eq(X,Y),
input ).
fof(rule4_0,plain,
! [X,Y] :
( eq(s(X),s(Y)) = eq(X,Y)
| $false ),
inference(orientation,[status(thm)],[rule4]) ).
cnf(rule3,axiom,
eq(s(X),zero) = false,
input ).
fof(rule3_0,plain,
! [X] :
( eq(s(X),zero) = false
| $false ),
inference(orientation,[status(thm)],[rule3]) ).
cnf(rule2,axiom,
eq(zero,s(Y)) = false,
input ).
fof(rule2_0,plain,
! [Y] :
( eq(zero,s(Y)) = false
| $false ),
inference(orientation,[status(thm)],[rule2]) ).
cnf(rule1,axiom,
eq(zero,zero) = true,
input ).
fof(rule1_0,plain,
( eq(zero,zero) = true
| $false ),
inference(orientation,[status(thm)],[rule1]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> eq(zero,zero) = true ),
inference(definition,[],[]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[rule1_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Y] :
( lhs_atom2(Y)
<=> eq(zero,s(Y)) = false ),
inference(definition,[],[]) ).
fof(to_be_clausified_1,plain,
! [Y] :
( lhs_atom2(Y)
| $false ),
inference(fold_definition,[status(thm)],[rule2_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [X] :
( lhs_atom3(X)
<=> eq(s(X),zero) = false ),
inference(definition,[],[]) ).
fof(to_be_clausified_2,plain,
! [X] :
( lhs_atom3(X)
| $false ),
inference(fold_definition,[status(thm)],[rule3_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [Y,X] :
( lhs_atom4(Y,X)
<=> eq(s(X),s(Y)) = eq(X,Y) ),
inference(definition,[],[]) ).
fof(to_be_clausified_3,plain,
! [X,Y] :
( lhs_atom4(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[rule4_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [Y] :
( lhs_atom5(Y)
<=> le(zero,Y) = true ),
inference(definition,[],[]) ).
fof(to_be_clausified_4,plain,
! [Y] :
( lhs_atom5(Y)
| $false ),
inference(fold_definition,[status(thm)],[rule5_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [X] :
( lhs_atom6(X)
<=> le(s(X),zero) = false ),
inference(definition,[],[]) ).
fof(to_be_clausified_5,plain,
! [X] :
( lhs_atom6(X)
| $false ),
inference(fold_definition,[status(thm)],[rule6_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [Y,X] :
( lhs_atom7(Y,X)
<=> le(s(X),s(Y)) = le(X,Y) ),
inference(definition,[],[]) ).
fof(to_be_clausified_6,plain,
! [X,Y] :
( lhs_atom7(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[rule7_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
( lhs_atom8
<=> min(cons(zero,nil)) = zero ),
inference(definition,[],[]) ).
fof(to_be_clausified_7,plain,
( lhs_atom8
| $false ),
inference(fold_definition,[status(thm)],[rule8_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [N] :
( lhs_atom9(N)
<=> min(cons(s(N),nil)) = s(N) ),
inference(definition,[],[]) ).
fof(to_be_clausified_8,plain,
! [N] :
( lhs_atom9(N)
| $false ),
inference(fold_definition,[status(thm)],[rule9_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [N,M,L] :
( lhs_atom10(N,M,L)
<=> min(cons(N,cons(M,L))) = ifmin(le(N,M),cons(N,cons(M,L))) ),
inference(definition,[],[]) ).
fof(to_be_clausified_9,plain,
! [L,M,N] :
( lhs_atom10(N,M,L)
| $false ),
inference(fold_definition,[status(thm)],[rule10_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [N,M,L] :
( lhs_atom11(N,M,L)
<=> ifmin(true,cons(N,cons(M,L))) = min(cons(N,L)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_10,plain,
! [L,M,N] :
( lhs_atom11(N,M,L)
| $false ),
inference(fold_definition,[status(thm)],[rule11_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
! [N,M,L] :
( lhs_atom12(N,M,L)
<=> ifmin(false,cons(N,cons(M,L))) = min(cons(M,L)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_11,plain,
! [L,M,N] :
( lhs_atom12(N,M,L)
| $false ),
inference(fold_definition,[status(thm)],[rule12_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
! [N,M] :
( lhs_atom13(N,M)
<=> replace(N,M,nil) = nil ),
inference(definition,[],[]) ).
fof(to_be_clausified_12,plain,
! [M,N] :
( lhs_atom13(N,M)
| $false ),
inference(fold_definition,[status(thm)],[rule13_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
! [N,M,L,K] :
( lhs_atom14(N,M,L,K)
<=> replace(N,M,cons(K,L)) = ifrepl(eq(N,K),N,M,cons(K,L)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_13,plain,
! [K,L,M,N] :
( lhs_atom14(N,M,L,K)
| $false ),
inference(fold_definition,[status(thm)],[rule14_0,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
! [N,M,L,K] :
( lhs_atom15(N,M,L,K)
<=> ifrepl(true,N,M,cons(K,L)) = cons(M,L) ),
inference(definition,[],[]) ).
fof(to_be_clausified_14,plain,
! [K,L,M,N] :
( lhs_atom15(N,M,L,K)
| $false ),
inference(fold_definition,[status(thm)],[rule15_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
! [N,M,L,K] :
( lhs_atom16(N,M,L,K)
<=> ifrepl(false,N,M,cons(K,L)) = cons(K,replace(N,M,L)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_15,plain,
! [K,L,M,N] :
( lhs_atom16(N,M,L,K)
| $false ),
inference(fold_definition,[status(thm)],[rule16_0,def_lhs_atom16]) ).
fof(def_lhs_atom17,axiom,
( lhs_atom17
<=> selsort(nil) = nil ),
inference(definition,[],[]) ).
fof(to_be_clausified_16,plain,
( lhs_atom17
| $false ),
inference(fold_definition,[status(thm)],[rule17_0,def_lhs_atom17]) ).
fof(def_lhs_atom18,axiom,
! [N,L] :
( lhs_atom18(N,L)
<=> selsort(cons(N,L)) = ifselsort(eq(N,min(cons(N,L))),cons(N,L)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_17,plain,
! [L,N] :
( lhs_atom18(N,L)
| $false ),
inference(fold_definition,[status(thm)],[rule18_0,def_lhs_atom18]) ).
fof(def_lhs_atom19,axiom,
! [N,L] :
( lhs_atom19(N,L)
<=> ifselsort(true,cons(N,L)) = cons(N,selsort(L)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_18,plain,
! [L,N] :
( lhs_atom19(N,L)
| $false ),
inference(fold_definition,[status(thm)],[rule19_0,def_lhs_atom19]) ).
fof(def_lhs_atom20,axiom,
! [N,L] :
( lhs_atom20(N,L)
<=> ifselsort(false,cons(N,L)) = cons(min(cons(N,L)),selsort(replace(min(cons(N,L)),N,L))) ),
inference(definition,[],[]) ).
fof(to_be_clausified_19,plain,
! [L,N] :
( lhs_atom20(N,L)
| $false ),
inference(fold_definition,[status(thm)],[rule20_0,def_lhs_atom20]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X4,X5,X6] :
( lhs_atom16(X3,X4,X5,X6)
| ~ $true ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_1,axiom,
! [X3,X4,X5,X6] :
( lhs_atom15(X3,X4,X5,X6)
| ~ $true ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_2,axiom,
! [X3,X4,X5,X6] :
( lhs_atom14(X3,X4,X5,X6)
| ~ $true ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_3,axiom,
! [X3,X4,X5] :
( lhs_atom12(X3,X4,X5)
| ~ $true ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_4,axiom,
! [X3,X4,X5] :
( lhs_atom11(X3,X4,X5)
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_5,axiom,
! [X3,X4,X5] :
( lhs_atom10(X3,X4,X5)
| ~ $true ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_6,axiom,
! [X3,X5] :
( lhs_atom20(X3,X5)
| ~ $true ),
file('<stdin>',to_be_clausified_19) ).
fof(c_0_7,axiom,
! [X3,X5] :
( lhs_atom19(X3,X5)
| ~ $true ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_8,axiom,
! [X3,X5] :
( lhs_atom18(X3,X5)
| ~ $true ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_9,axiom,
! [X3,X4] :
( lhs_atom13(X3,X4)
| ~ $true ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_10,axiom,
! [X1,X2] :
( lhs_atom7(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_11,axiom,
! [X1,X2] :
( lhs_atom4(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_12,axiom,
! [X3] :
( lhs_atom9(X3)
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_13,axiom,
! [X2] :
( lhs_atom6(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_14,axiom,
! [X1] :
( lhs_atom5(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_15,axiom,
! [X2] :
( lhs_atom3(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_16,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_17,axiom,
( lhs_atom17
| ~ $true ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_18,axiom,
( lhs_atom8
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_19,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_20,plain,
! [X3,X4,X5,X6] : lhs_atom16(X3,X4,X5,X6),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_21,plain,
! [X3,X4,X5,X6] : lhs_atom15(X3,X4,X5,X6),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_22,plain,
! [X3,X4,X5,X6] : lhs_atom14(X3,X4,X5,X6),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_23,plain,
! [X3,X4,X5] : lhs_atom12(X3,X4,X5),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_24,plain,
! [X3,X4,X5] : lhs_atom11(X3,X4,X5),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_25,plain,
! [X3,X4,X5] : lhs_atom10(X3,X4,X5),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_26,plain,
! [X3,X5] : lhs_atom20(X3,X5),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_27,plain,
! [X3,X5] : lhs_atom19(X3,X5),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_28,plain,
! [X3,X5] : lhs_atom18(X3,X5),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_29,plain,
! [X3,X4] : lhs_atom13(X3,X4),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_30,plain,
! [X1,X2] : lhs_atom7(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_31,plain,
! [X1,X2] : lhs_atom4(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_32,plain,
! [X3] : lhs_atom9(X3),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_33,plain,
! [X2] : lhs_atom6(X2),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_34,plain,
! [X1] : lhs_atom5(X1),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_35,plain,
! [X2] : lhs_atom3(X2),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_36,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_37,plain,
lhs_atom17,
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_38,plain,
lhs_atom8,
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_39,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_40,plain,
! [X7,X8,X9,X10] : lhs_atom16(X7,X8,X9,X10),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_41,plain,
! [X7,X8,X9,X10] : lhs_atom15(X7,X8,X9,X10),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_42,plain,
! [X7,X8,X9,X10] : lhs_atom14(X7,X8,X9,X10),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_43,plain,
! [X6,X7,X8] : lhs_atom12(X6,X7,X8),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_44,plain,
! [X6,X7,X8] : lhs_atom11(X6,X7,X8),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_45,plain,
! [X6,X7,X8] : lhs_atom10(X6,X7,X8),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_46,plain,
! [X6,X7] : lhs_atom20(X6,X7),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_47,plain,
! [X6,X7] : lhs_atom19(X6,X7),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_48,plain,
! [X6,X7] : lhs_atom18(X6,X7),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_49,plain,
! [X5,X6] : lhs_atom13(X5,X6),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_50,plain,
! [X3,X4] : lhs_atom7(X3,X4),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_51,plain,
! [X3,X4] : lhs_atom4(X3,X4),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_52,plain,
! [X4] : lhs_atom9(X4),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_53,plain,
! [X3] : lhs_atom6(X3),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_54,plain,
! [X2] : lhs_atom5(X2),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_55,plain,
! [X3] : lhs_atom3(X3),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_56,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_57,plain,
lhs_atom17,
c_0_37 ).
fof(c_0_58,plain,
lhs_atom8,
c_0_38 ).
fof(c_0_59,plain,
lhs_atom1,
c_0_39 ).
cnf(c_0_60,plain,
lhs_atom16(X1,X2,X3,X4),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_61,plain,
lhs_atom15(X1,X2,X3,X4),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_62,plain,
lhs_atom14(X1,X2,X3,X4),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_63,plain,
lhs_atom12(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_64,plain,
lhs_atom11(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_65,plain,
lhs_atom10(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_66,plain,
lhs_atom20(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_67,plain,
lhs_atom19(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_68,plain,
lhs_atom18(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_69,plain,
lhs_atom13(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_70,plain,
lhs_atom7(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_71,plain,
lhs_atom4(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_72,plain,
lhs_atom9(X1),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_73,plain,
lhs_atom6(X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_74,plain,
lhs_atom5(X1),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_75,plain,
lhs_atom3(X1),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_76,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_77,plain,
lhs_atom17,
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_78,plain,
lhs_atom8,
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_79,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_80,plain,
lhs_atom16(X1,X2,X3,X4),
c_0_60,
[final] ).
cnf(c_0_81,plain,
lhs_atom15(X1,X2,X3,X4),
c_0_61,
[final] ).
cnf(c_0_82,plain,
lhs_atom14(X1,X2,X3,X4),
c_0_62,
[final] ).
cnf(c_0_83,plain,
lhs_atom12(X1,X2,X3),
c_0_63,
[final] ).
cnf(c_0_84,plain,
lhs_atom11(X1,X2,X3),
c_0_64,
[final] ).
cnf(c_0_85,plain,
lhs_atom10(X1,X2,X3),
c_0_65,
[final] ).
cnf(c_0_86,plain,
lhs_atom20(X1,X2),
c_0_66,
[final] ).
cnf(c_0_87,plain,
lhs_atom19(X1,X2),
c_0_67,
[final] ).
cnf(c_0_88,plain,
lhs_atom18(X1,X2),
c_0_68,
[final] ).
cnf(c_0_89,plain,
lhs_atom13(X1,X2),
c_0_69,
[final] ).
cnf(c_0_90,plain,
lhs_atom7(X1,X2),
c_0_70,
[final] ).
cnf(c_0_91,plain,
lhs_atom4(X1,X2),
c_0_71,
[final] ).
cnf(c_0_92,plain,
lhs_atom9(X1),
c_0_72,
[final] ).
cnf(c_0_93,plain,
lhs_atom6(X1),
c_0_73,
[final] ).
cnf(c_0_94,plain,
lhs_atom5(X1),
c_0_74,
[final] ).
cnf(c_0_95,plain,
lhs_atom3(X1),
c_0_75,
[final] ).
cnf(c_0_96,plain,
lhs_atom2(X1),
c_0_76,
[final] ).
cnf(c_0_97,plain,
lhs_atom17,
c_0_77,
[final] ).
cnf(c_0_98,plain,
lhs_atom8,
c_0_78,
[final] ).
cnf(c_0_99,plain,
lhs_atom1,
c_0_79,
[final] ).
% End CNF derivation
cnf(c_0_80_0,axiom,
ifrepl(false,X1,X2,cons(X4,X3)) = cons(X4,replace(X1,X2,X3)),
inference(unfold_definition,[status(thm)],[c_0_80,def_lhs_atom16]) ).
cnf(c_0_81_0,axiom,
ifrepl(true,X1,X2,cons(X4,X3)) = cons(X2,X3),
inference(unfold_definition,[status(thm)],[c_0_81,def_lhs_atom15]) ).
cnf(c_0_82_0,axiom,
replace(X1,X2,cons(X4,X3)) = ifrepl(eq(X1,X4),X1,X2,cons(X4,X3)),
inference(unfold_definition,[status(thm)],[c_0_82,def_lhs_atom14]) ).
cnf(c_0_83_0,axiom,
ifmin(false,cons(X1,cons(X2,X3))) = min(cons(X2,X3)),
inference(unfold_definition,[status(thm)],[c_0_83,def_lhs_atom12]) ).
cnf(c_0_84_0,axiom,
ifmin(true,cons(X1,cons(X2,X3))) = min(cons(X1,X3)),
inference(unfold_definition,[status(thm)],[c_0_84,def_lhs_atom11]) ).
cnf(c_0_85_0,axiom,
min(cons(X1,cons(X2,X3))) = ifmin(le(X1,X2),cons(X1,cons(X2,X3))),
inference(unfold_definition,[status(thm)],[c_0_85,def_lhs_atom10]) ).
cnf(c_0_86_0,axiom,
ifselsort(false,cons(X1,X2)) = cons(min(cons(X1,X2)),selsort(replace(min(cons(X1,X2)),X1,X2))),
inference(unfold_definition,[status(thm)],[c_0_86,def_lhs_atom20]) ).
cnf(c_0_87_0,axiom,
ifselsort(true,cons(X1,X2)) = cons(X1,selsort(X2)),
inference(unfold_definition,[status(thm)],[c_0_87,def_lhs_atom19]) ).
cnf(c_0_88_0,axiom,
selsort(cons(X1,X2)) = ifselsort(eq(X1,min(cons(X1,X2))),cons(X1,X2)),
inference(unfold_definition,[status(thm)],[c_0_88,def_lhs_atom18]) ).
cnf(c_0_89_0,axiom,
replace(X1,X2,nil) = nil,
inference(unfold_definition,[status(thm)],[c_0_89,def_lhs_atom13]) ).
cnf(c_0_90_0,axiom,
le(s(X2),s(X1)) = le(X2,X1),
inference(unfold_definition,[status(thm)],[c_0_90,def_lhs_atom7]) ).
cnf(c_0_91_0,axiom,
eq(s(X2),s(X1)) = eq(X2,X1),
inference(unfold_definition,[status(thm)],[c_0_91,def_lhs_atom4]) ).
cnf(c_0_92_0,axiom,
min(cons(s(X1),nil)) = s(X1),
inference(unfold_definition,[status(thm)],[c_0_92,def_lhs_atom9]) ).
cnf(c_0_93_0,axiom,
le(s(X1),zero) = false,
inference(unfold_definition,[status(thm)],[c_0_93,def_lhs_atom6]) ).
cnf(c_0_94_0,axiom,
le(zero,X1) = true,
inference(unfold_definition,[status(thm)],[c_0_94,def_lhs_atom5]) ).
cnf(c_0_95_0,axiom,
eq(s(X1),zero) = false,
inference(unfold_definition,[status(thm)],[c_0_95,def_lhs_atom3]) ).
cnf(c_0_96_0,axiom,
eq(zero,s(X1)) = false,
inference(unfold_definition,[status(thm)],[c_0_96,def_lhs_atom2]) ).
cnf(c_0_97_0,axiom,
selsort(nil) = nil,
inference(unfold_definition,[status(thm)],[c_0_97,def_lhs_atom17]) ).
cnf(c_0_98_0,axiom,
min(cons(zero,nil)) = zero,
inference(unfold_definition,[status(thm)],[c_0_98,def_lhs_atom8]) ).
cnf(c_0_99_0,axiom,
eq(zero,zero) = true,
inference(unfold_definition,[status(thm)],[c_0_99,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
file('<stdin>',goal) ).
fof(c_0_1_002,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
c_0_0 ).
fof(c_0_2_003,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
c_0_1 ).
cnf(c_0_3_004,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_20,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_0873e5.p',c_0_4) ).
cnf(c_38,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_42,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_43,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_44,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_86,negated_conjecture,
selsort(cons(s(s(s(zero))),cons(s(zero),cons(s(s(zero)),cons(s(s(s(s(zero)))),cons(zero,nil)))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_87,plain,
cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))) != cons(zero,cons(s(zero),cons(s(s(zero)),cons(s(s(s(zero))),cons(s(s(s(s(zero)))),nil))))),
inference(rewriting,[status(thm)],[c_86]) ).
cnf(c_88,plain,
$false,
inference(equality_resolution_simp,[status(esa)],[c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT436-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : iprover_modulo %s %d
% 0.16/0.33 % Computer : n022.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 20:57:06 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % Running in mono-core mode
% 0.20/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.39 % Orientation found
% 0.20/0.40 % 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/sandbox2/tmp/iprover_proof_1c3168.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_0873e5.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_78dd3c | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.34/0.58 % --bmc1_dump_unsat_core_tptp false
% 0.34/0.58 % --bmc1_dump_file -
% 0.34/0.58 % --bmc1_ucm_expand_uc_limit 128
% 0.34/0.58 % --bmc1_ucm_n_expand_iterations 6
% 0.34/0.58 % --bmc1_ucm_extend_mode 1
% 0.34/0.58 % --bmc1_ucm_init_mode 2
% 0.34/0.58 % --bmc1_ucm_cone_mode none
% 0.34/0.58 % --bmc1_ucm_reduced_relation_type 0
% 0.34/0.58 % --bmc1_ucm_relax_model 4
% 0.34/0.58 % --bmc1_ucm_full_tr_after_sat true
% 0.34/0.58 % --bmc1_ucm_expand_neg_assumptions false
% 0.34/0.58 % --bmc1_ucm_layered_model none
% 0.34/0.58 % --bmc1_ucm_max_lemma_size 10
% 0.34/0.58
% 0.34/0.58 % ------ AIG Options
% 0.34/0.58
% 0.34/0.58 % --aig_mode false
% 0.34/0.58
% 0.34/0.58 % ------ Instantiation Options
% 0.34/0.58
% 0.34/0.58 % --instantiation_flag true
% 0.34/0.58 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.34/0.58 % --inst_solver_per_active 750
% 0.34/0.58 % --inst_solver_calls_frac 0.5
% 0.34/0.58 % --inst_passive_queue_type priority_queues
% 0.34/0.58 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.34/0.58 % --inst_passive_queues_freq [25;2]
% 0.34/0.58 % --inst_dismatching true
% 0.34/0.58 % --inst_eager_unprocessed_to_passive true
% 0.34/0.58 % --inst_prop_sim_given true
% 0.34/0.58 % --inst_prop_sim_new false
% 0.34/0.58 % --inst_orphan_elimination true
% 0.34/0.58 % --inst_learning_loop_flag true
% 0.34/0.58 % --inst_learning_start 3000
% 0.34/0.58 % --inst_learning_factor 2
% 0.34/0.58 % --inst_start_prop_sim_after_learn 3
% 0.34/0.58 % --inst_sel_renew solver
% 0.34/0.58 % --inst_lit_activity_flag true
% 0.34/0.58 % --inst_out_proof true
% 0.34/0.58
% 0.34/0.58 % ------ Resolution Options
% 0.34/0.58
% 0.34/0.58 % --resolution_flag true
% 0.34/0.58 % --res_lit_sel kbo_max
% 0.34/0.58 % --res_to_prop_solver none
% 0.34/0.58 % --res_prop_simpl_new false
% 0.34/0.58 % --res_prop_simpl_given false
% 0.34/0.58 % --res_passive_queue_type priority_queues
% 0.34/0.58 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.34/0.58 % --res_passive_queues_freq [15;5]
% 0.34/0.58 % --res_forward_subs full
% 0.34/0.58 % --res_backward_subs full
% 0.34/0.58 % --res_forward_subs_resolution true
% 0.34/0.58 % --res_backward_subs_resolution true
% 0.34/0.58 % --res_orphan_elimination false
% 0.34/0.58 % --res_time_limit 1000.
% 0.34/0.58 % --res_out_proof true
% 0.34/0.58 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_1c3168.s
% 0.34/0.58 % --modulo true
% 0.34/0.58
% 0.34/0.58 % ------ Combination Options
% 0.34/0.58
% 0.34/0.58 % --comb_res_mult 1000
% 0.34/0.58 % --comb_inst_mult 300
% 0.34/0.58 % ------
% 0.34/0.58
% 0.34/0.58 % ------ Parsing...% successful
% 0.34/0.58
% 0.34/0.58 % ------ 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.34/0.58
% 0.34/0.58 % ------ Proving...
% 0.34/0.58 % ------ Problem Properties
% 0.34/0.58
% 0.34/0.58 %
% 0.34/0.58 % EPR false
% 0.34/0.58 % Horn true
% 0.34/0.58 % Has equality true
% 0.34/0.58
% 0.34/0.58 % % ------ Input Options Time Limit: Unbounded
% 0.34/0.59
% 0.34/0.59
% 0.34/0.59 Compiling...
% 0.34/0.59 Loading plugin: done.
% 0.34/0.59 %
% 0.34/0.59
% 0.34/0.59
% 0.34/0.59 % Resolution empty clause
% 0.34/0.59
% 0.34/0.59 % ------ Statistics
% 0.34/0.59
% 0.34/0.59 % ------ General
% 0.34/0.59
% 0.34/0.59 % num_of_input_clauses: 21
% 0.34/0.59 % num_of_input_neg_conjectures: 1
% 0.34/0.59 % num_of_splits: 0
% 0.34/0.59 % num_of_split_atoms: 0
% 0.34/0.59 % num_of_sem_filtered_clauses: 0
% 0.34/0.59 % num_of_subtypes: 0
% 0.34/0.59 % monotx_restored_types: 0
% 0.34/0.59 % sat_num_of_epr_types: 0
% 0.34/0.59 % sat_num_of_non_cyclic_types: 0
% 0.34/0.59 % sat_guarded_non_collapsed_types: 0
% 0.34/0.59 % is_epr: 0
% 0.34/0.59 % is_horn: 1
% 0.34/0.59 % has_eq: 1
% 0.34/0.59 % num_pure_diseq_elim: 0
% 0.34/0.59 % simp_replaced_by: 0
% 0.34/0.59 % res_preprocessed: 2
% 0.34/0.59 % prep_upred: 0
% 0.34/0.59 % prep_unflattend: 0
% 0.34/0.59 % pred_elim_cands: 0
% 0.34/0.59 % pred_elim: 0
% 0.34/0.59 % pred_elim_cl: 0
% 0.34/0.59 % pred_elim_cycles: 0
% 0.34/0.59 % forced_gc_time: 0
% 0.34/0.59 % gc_basic_clause_elim: 0
% 0.34/0.59 % parsing_time: 0.001
% 0.34/0.59 % sem_filter_time: 0.
% 0.34/0.59 % pred_elim_time: 0.
% 0.34/0.59 % out_proof_time: 0.001
% 0.34/0.59 % monotx_time: 0.
% 0.34/0.59 % subtype_inf_time: 0.
% 0.34/0.59 % unif_index_cands_time: 0.
% 0.34/0.59 % unif_index_add_time: 0.
% 0.34/0.59 % total_time: 0.183
% 0.34/0.59 % num_of_symbols: 39
% 0.34/0.59 % num_of_terms: 167
% 0.34/0.59
% 0.34/0.59 % ------ Propositional Solver
% 0.34/0.59
% 0.34/0.59 % prop_solver_calls: 1
% 0.34/0.59 % prop_fast_solver_calls: 3
% 0.34/0.59 % prop_num_of_clauses: 38
% 0.34/0.59 % prop_preprocess_simplified: 46
% 0.34/0.59 % prop_fo_subsumed: 0
% 0.34/0.59 % prop_solver_time: 0.
% 0.34/0.59 % prop_fast_solver_time: 0.
% 0.34/0.59 % prop_unsat_core_time: 0.
% 0.34/0.59
% 0.34/0.59 % ------ QBF
% 0.34/0.59
% 0.34/0.59 % qbf_q_res: 0
% 0.34/0.59 % qbf_num_tautologies: 0
% 0.34/0.59 % qbf_prep_cycles: 0
% 0.34/0.59
% 0.34/0.59 % ------ BMC1
% 0.34/0.59
% 0.34/0.59 % bmc1_current_bound: -1
% 0.34/0.59 % bmc1_last_solved_bound: -1
% 0.34/0.59 % bmc1_unsat_core_size: -1
% 0.34/0.59 % bmc1_unsat_core_parents_size: -1
% 0.34/0.59 % bmc1_merge_next_fun: 0
% 0.34/0.59 % bmc1_unsat_core_clauses_time: 0.
% 0.34/0.59
% 0.34/0.59 % ------ Instantiation
% 0.34/0.59
% 0.34/0.59 % inst_num_of_clauses: 21
% 0.34/0.59 % inst_num_in_passive: 0
% 0.34/0.59 % inst_num_in_active: 0
% 0.34/0.59 % inst_num_in_unprocessed: 21
% 0.34/0.59 % inst_num_of_loops: 0
% 0.34/0.59 % inst_num_of_learning_restarts: 0
% 0.34/0.59 % inst_num_moves_active_passive: 0
% 0.34/0.59 % inst_lit_activity: 0
% 0.34/0.59 % inst_lit_activity_moves: 0
% 0.34/0.59 % inst_num_tautologies: 0
% 0.34/0.59 % inst_num_prop_implied: 0
% 0.34/0.59 % inst_num_existing_simplified: 0
% 0.34/0.59 % inst_num_eq_res_simplified: 0
% 0.34/0.59 % inst_num_child_elim: 0
% 0.34/0.59 % inst_num_of_dismatching_blockings: 0
% 0.34/0.59 % inst_num_of_non_proper_insts: 0
% 0.34/0.59 % inst_num_of_duplicates: 0
% 0.34/0.59 % inst_inst_num_from_inst_to_res: 0
% 0.34/0.59 % inst_dismatching_checking_time: 0.
% 0.34/0.59
% 0.34/0.59 % ------ Resolution
% 0.34/0.59
% 0.34/0.59 % res_num_of_clauses: 21
% 0.34/0.59 % res_num_in_passive: 0
% 0.34/0.59 % res_num_in_active: 0
% 0.34/0.59 % res_num_of_loops: 0
% 0.34/0.59 % res_forward_subset_subsumed: 0
% 0.34/0.59 % res_backward_subset_subsumed: 0
% 0.34/0.59 % res_forward_subsumed: 0
% 0.34/0.59 % res_backward_subsumed: 0
% 0.34/0.59 % res_forward_subsumption_resolution: 0
% 0.34/0.59 % res_backward_subsumption_resolution: 0
% 0.34/0.59 % res_clause_to_clause_subsumption: 0
% 0.34/0.59 % res_orphan_elimination: 0
% 0.34/0.59 % res_tautology_del: 0
% 0.34/0.59 % res_num_eq_res_simplified: 0
% 0.34/0.59 % res_num_sel_changes: 0
% 0.34/0.59 % res_moves_from_active_to_pass: 0
% 0.34/0.59
% 0.34/0.59 % Status Unsatisfiable
% 0.34/0.59 % SZS status Unsatisfiable
% 0.34/0.59 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------