%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN585-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n013.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 : Thu Jul 21 07:30:08 EDT 2022
% Result : Unsatisfiable 2.67s 2.87s
% Output : CNFRefutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 33
% Syntax : Number of formulae : 158 ( 66 unt; 0 def)
% Number of atoms : 330 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 349 ( 177 ~; 172 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 301 ( 8 sgn 147 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% 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,negated_conjecture,
! [X43,X44,X45] :
( p11(X45,X44)
| p2(X43,f3(c13))
| ~ p11(f9(X43,X45),f9(X43,X44)) ),
file('<stdin>',p11_25) ).
fof(c_0_1,negated_conjecture,
~ p11(c18,f9(c12,f8(c16,c14))),
file('<stdin>',not_p11_12) ).
fof(c_0_2,negated_conjecture,
! [X39,X40,X41,X42] :
( p2(f8(X42,X41),f8(X40,X39))
| ~ p2(X42,X40)
| ~ p2(X41,X39) ),
file('<stdin>',p2_24) ).
fof(c_0_3,negated_conjecture,
! [X35,X36,X37,X38] :
( p2(f7(X38,X37),f7(X36,X35))
| ~ p2(X38,X36)
| ~ p2(X37,X35) ),
file('<stdin>',p2_23) ).
fof(c_0_4,negated_conjecture,
! [X31,X32,X33,X34] :
( p2(f6(X34,X33),f6(X32,X31))
| ~ p2(X33,X31)
| ~ p2(X34,X32) ),
file('<stdin>',p2_22) ).
fof(c_0_5,negated_conjecture,
! [X27,X28,X29,X30] :
( p2(f5(X30,X29),f5(X28,X27))
| ~ p2(X30,X28)
| ~ p2(X29,X27) ),
file('<stdin>',p2_21) ).
fof(c_0_6,negated_conjecture,
! [X23,X24,X25,X26] :
( p2(f9(X26,X25),f9(X24,X23))
| ~ p2(X26,X24)
| ~ p2(X25,X23) ),
file('<stdin>',p2_20) ).
fof(c_0_7,negated_conjecture,
! [X43,X44,X45] :
( p2(X43,f3(c13))
| p11(f9(X43,X45),f9(X43,X44))
| ~ p11(X45,X44) ),
file('<stdin>',p2_26) ).
fof(c_0_8,negated_conjecture,
! [X19,X20,X21,X22] :
( p11(X22,X21)
| ~ p2(X20,X22)
| ~ p2(X19,X21)
| ~ p11(X20,X19) ),
file('<stdin>',p11_19) ).
fof(c_0_9,negated_conjecture,
! [X15,X16,X17,X18] :
( p10(X18,X17)
| ~ p2(X16,X18)
| ~ p2(X15,X17)
| ~ p10(X16,X15) ),
file('<stdin>',p10_18) ).
fof(c_0_10,negated_conjecture,
p2(f7(f8(c16,c14),c17),c15),
file('<stdin>',p2_11) ).
fof(c_0_11,negated_conjecture,
! [X3,X4,X5] :
( p11(X3,f8(X5,X4))
| ~ p11(X3,X4) ),
file('<stdin>',p11_13) ).
fof(c_0_12,negated_conjecture,
! [X13,X14,X1] :
( p2(X14,X13)
| ~ p2(X1,X14)
| ~ p2(X1,X13) ),
file('<stdin>',p2_17) ).
fof(c_0_13,negated_conjecture,
! [X10,X11,X12] :
( p11(X12,X11)
| ~ p11(X12,X10)
| ~ p11(X10,X11) ),
file('<stdin>',p11_16) ).
fof(c_0_14,negated_conjecture,
! [X8,X9] :
( p2(f3(X9),f3(X8))
| ~ p2(X9,X8) ),
file('<stdin>',p2_15) ).
fof(c_0_15,negated_conjecture,
! [X6,X7] :
( p2(f4(X7),f4(X6))
| ~ p2(X7,X6) ),
file('<stdin>',p2_14) ).
fof(c_0_16,negated_conjecture,
~ p2(c12,f3(f4(c13))),
file('<stdin>',not_p2_10) ).
fof(c_0_17,negated_conjecture,
p2(f5(c15,c14),c16),
file('<stdin>',p2_9) ).
fof(c_0_18,negated_conjecture,
p2(f6(c15,c14),c17),
file('<stdin>',p2_8) ).
fof(c_0_19,negated_conjecture,
p11(c18,f9(c12,c14)),
file('<stdin>',p11_7) ).
fof(c_0_20,negated_conjecture,
~ p2(c12,f3(c13)),
file('<stdin>',not_p2_6) ).
fof(c_0_21,negated_conjecture,
~ p2(c14,f3(c13)),
file('<stdin>',not_p2_5) ).
fof(c_0_22,negated_conjecture,
! [X2] : p11(X2,X2),
file('<stdin>',p11_2) ).
fof(c_0_23,negated_conjecture,
! [X1] : p2(X1,X1),
file('<stdin>',p2_1) ).
fof(c_0_24,negated_conjecture,
p10(c17,c14),
file('<stdin>',p10_4) ).
fof(c_0_25,negated_conjecture,
p10(c14,c15),
file('<stdin>',p10_3) ).
fof(c_0_26,negated_conjecture,
! [X43,X44,X45] :
( p11(X45,X44)
| p2(X43,f3(c13))
| ~ p11(f9(X43,X45),f9(X43,X44)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_27,negated_conjecture,
~ p11(c18,f9(c12,f8(c16,c14))),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_28,negated_conjecture,
! [X39,X40,X41,X42] :
( p2(f8(X42,X41),f8(X40,X39))
| ~ p2(X42,X40)
| ~ p2(X41,X39) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_29,negated_conjecture,
! [X35,X36,X37,X38] :
( p2(f7(X38,X37),f7(X36,X35))
| ~ p2(X38,X36)
| ~ p2(X37,X35) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_30,negated_conjecture,
! [X31,X32,X33,X34] :
( p2(f6(X34,X33),f6(X32,X31))
| ~ p2(X33,X31)
| ~ p2(X34,X32) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_31,negated_conjecture,
! [X27,X28,X29,X30] :
( p2(f5(X30,X29),f5(X28,X27))
| ~ p2(X30,X28)
| ~ p2(X29,X27) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_32,negated_conjecture,
! [X23,X24,X25,X26] :
( p2(f9(X26,X25),f9(X24,X23))
| ~ p2(X26,X24)
| ~ p2(X25,X23) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_33,negated_conjecture,
! [X43,X44,X45] :
( p2(X43,f3(c13))
| p11(f9(X43,X45),f9(X43,X44))
| ~ p11(X45,X44) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_34,negated_conjecture,
! [X19,X20,X21,X22] :
( p11(X22,X21)
| ~ p2(X20,X22)
| ~ p2(X19,X21)
| ~ p11(X20,X19) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_35,negated_conjecture,
! [X15,X16,X17,X18] :
( p10(X18,X17)
| ~ p2(X16,X18)
| ~ p2(X15,X17)
| ~ p10(X16,X15) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_36,negated_conjecture,
p2(f7(f8(c16,c14),c17),c15),
c_0_10 ).
fof(c_0_37,negated_conjecture,
! [X3,X4,X5] :
( p11(X3,f8(X5,X4))
| ~ p11(X3,X4) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_38,negated_conjecture,
! [X13,X14,X1] :
( p2(X14,X13)
| ~ p2(X1,X14)
| ~ p2(X1,X13) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_39,negated_conjecture,
! [X10,X11,X12] :
( p11(X12,X11)
| ~ p11(X12,X10)
| ~ p11(X10,X11) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_40,negated_conjecture,
! [X8,X9] :
( p2(f3(X9),f3(X8))
| ~ p2(X9,X8) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_41,negated_conjecture,
! [X6,X7] :
( p2(f4(X7),f4(X6))
| ~ p2(X7,X6) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_42,negated_conjecture,
~ p2(c12,f3(f4(c13))),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_43,negated_conjecture,
p2(f5(c15,c14),c16),
c_0_17 ).
fof(c_0_44,negated_conjecture,
p2(f6(c15,c14),c17),
c_0_18 ).
fof(c_0_45,negated_conjecture,
p11(c18,f9(c12,c14)),
c_0_19 ).
fof(c_0_46,negated_conjecture,
~ p2(c12,f3(c13)),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_47,negated_conjecture,
~ p2(c14,f3(c13)),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_48,negated_conjecture,
! [X2] : p11(X2,X2),
c_0_22 ).
fof(c_0_49,negated_conjecture,
! [X1] : p2(X1,X1),
c_0_23 ).
fof(c_0_50,negated_conjecture,
p10(c17,c14),
c_0_24 ).
fof(c_0_51,negated_conjecture,
p10(c14,c15),
c_0_25 ).
fof(c_0_52,negated_conjecture,
! [X46,X47,X48] :
( p11(X48,X47)
| p2(X46,f3(c13))
| ~ p11(f9(X46,X48),f9(X46,X47)) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_53,negated_conjecture,
~ p11(c18,f9(c12,f8(c16,c14))),
c_0_27 ).
fof(c_0_54,negated_conjecture,
! [X43,X44,X45,X46] :
( p2(f8(X46,X45),f8(X44,X43))
| ~ p2(X46,X44)
| ~ p2(X45,X43) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_55,negated_conjecture,
! [X39,X40,X41,X42] :
( p2(f7(X42,X41),f7(X40,X39))
| ~ p2(X42,X40)
| ~ p2(X41,X39) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_56,negated_conjecture,
! [X35,X36,X37,X38] :
( p2(f6(X38,X37),f6(X36,X35))
| ~ p2(X37,X35)
| ~ p2(X38,X36) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_57,negated_conjecture,
! [X31,X32,X33,X34] :
( p2(f5(X34,X33),f5(X32,X31))
| ~ p2(X34,X32)
| ~ p2(X33,X31) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_58,negated_conjecture,
! [X27,X28,X29,X30] :
( p2(f9(X30,X29),f9(X28,X27))
| ~ p2(X30,X28)
| ~ p2(X29,X27) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_59,negated_conjecture,
! [X46,X47,X48] :
( p2(X46,f3(c13))
| p11(f9(X46,X48),f9(X46,X47))
| ~ p11(X48,X47) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_33])])]) ).
fof(c_0_60,negated_conjecture,
! [X23,X24,X25,X26] :
( p11(X26,X25)
| ~ p2(X24,X26)
| ~ p2(X23,X25)
| ~ p11(X24,X23) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_61,negated_conjecture,
! [X19,X20,X21,X22] :
( p10(X22,X21)
| ~ p2(X20,X22)
| ~ p2(X19,X21)
| ~ p10(X20,X19) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_62,negated_conjecture,
p2(f7(f8(c16,c14),c17),c15),
c_0_36 ).
fof(c_0_63,negated_conjecture,
! [X6,X7,X8] :
( p11(X6,f8(X8,X7))
| ~ p11(X6,X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_37])])]) ).
fof(c_0_64,negated_conjecture,
! [X15,X16,X17] :
( p2(X16,X15)
| ~ p2(X17,X16)
| ~ p2(X17,X15) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_38])])]) ).
fof(c_0_65,negated_conjecture,
! [X13,X14,X15] :
( p11(X15,X14)
| ~ p11(X15,X13)
| ~ p11(X13,X14) ),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_66,negated_conjecture,
! [X10,X11] :
( p2(f3(X11),f3(X10))
| ~ p2(X11,X10) ),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_67,negated_conjecture,
! [X8,X9] :
( p2(f4(X9),f4(X8))
| ~ p2(X9,X8) ),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_68,negated_conjecture,
~ p2(c12,f3(f4(c13))),
c_0_42 ).
fof(c_0_69,negated_conjecture,
p2(f5(c15,c14),c16),
c_0_43 ).
fof(c_0_70,negated_conjecture,
p2(f6(c15,c14),c17),
c_0_44 ).
fof(c_0_71,negated_conjecture,
p11(c18,f9(c12,c14)),
c_0_45 ).
fof(c_0_72,negated_conjecture,
~ p2(c12,f3(c13)),
c_0_46 ).
fof(c_0_73,negated_conjecture,
~ p2(c14,f3(c13)),
c_0_47 ).
fof(c_0_74,negated_conjecture,
! [X3] : p11(X3,X3),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_75,negated_conjecture,
! [X2] : p2(X2,X2),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_76,negated_conjecture,
p10(c17,c14),
c_0_50 ).
fof(c_0_77,negated_conjecture,
p10(c14,c15),
c_0_51 ).
cnf(c_0_78,negated_conjecture,
( p2(X1,f3(c13))
| p11(X2,X3)
| ~ p11(f9(X1,X2),f9(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_79,negated_conjecture,
~ p11(c18,f9(c12,f8(c16,c14))),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_80,negated_conjecture,
( p2(f8(X3,X1),f8(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_81,negated_conjecture,
( p2(f7(X3,X1),f7(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_82,negated_conjecture,
( p2(f6(X1,X3),f6(X2,X4))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_83,negated_conjecture,
( p2(f5(X3,X1),f5(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_84,negated_conjecture,
( p2(f9(X3,X1),f9(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_85,negated_conjecture,
( p11(f9(X3,X1),f9(X3,X2))
| p2(X3,f3(c13))
| ~ p11(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_86,negated_conjecture,
( p11(X4,X3)
| ~ p11(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_87,negated_conjecture,
( p10(X4,X3)
| ~ p10(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_88,negated_conjecture,
p2(f7(f8(c16,c14),c17),c15),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_89,negated_conjecture,
( p11(X1,f8(X3,X2))
| ~ p11(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_90,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_91,negated_conjecture,
( p11(X3,X2)
| ~ p11(X1,X2)
| ~ p11(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_92,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_93,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_94,negated_conjecture,
~ p2(c12,f3(f4(c13))),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_95,negated_conjecture,
p2(f5(c15,c14),c16),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_96,negated_conjecture,
p2(f6(c15,c14),c17),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_97,negated_conjecture,
p11(c18,f9(c12,c14)),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_98,negated_conjecture,
~ p2(c12,f3(c13)),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_99,negated_conjecture,
~ p2(c14,f3(c13)),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_100,negated_conjecture,
p11(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_101,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_102,negated_conjecture,
p10(c17,c14),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_103,negated_conjecture,
p10(c14,c15),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_104,negated_conjecture,
( p2(X1,f3(c13))
| p11(X2,X3)
| ~ p11(f9(X1,X2),f9(X1,X3)) ),
c_0_78,
[final] ).
cnf(c_0_105,negated_conjecture,
~ p11(c18,f9(c12,f8(c16,c14))),
c_0_79,
[final] ).
cnf(c_0_106,negated_conjecture,
( p2(f8(X3,X1),f8(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_80,
[final] ).
cnf(c_0_107,negated_conjecture,
( p2(f7(X3,X1),f7(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_81,
[final] ).
cnf(c_0_108,negated_conjecture,
( p2(f6(X1,X3),f6(X2,X4))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_82,
[final] ).
cnf(c_0_109,negated_conjecture,
( p2(f5(X3,X1),f5(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_83,
[final] ).
cnf(c_0_110,negated_conjecture,
( p2(f9(X3,X1),f9(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_84,
[final] ).
cnf(c_0_111,negated_conjecture,
( p11(f9(X3,X1),f9(X3,X2))
| p2(X3,f3(c13))
| ~ p11(X1,X2) ),
c_0_85,
[final] ).
cnf(c_0_112,negated_conjecture,
( p11(X4,X3)
| ~ p11(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
c_0_86,
[final] ).
cnf(c_0_113,negated_conjecture,
( p10(X4,X3)
| ~ p10(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
c_0_87,
[final] ).
cnf(c_0_114,negated_conjecture,
p2(f7(f8(c16,c14),c17),c15),
c_0_88,
[final] ).
cnf(c_0_115,negated_conjecture,
( p11(X1,f8(X3,X2))
| ~ p11(X1,X2) ),
c_0_89,
[final] ).
cnf(c_0_116,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_90,
[final] ).
cnf(c_0_117,negated_conjecture,
( p11(X3,X2)
| ~ p11(X1,X2)
| ~ p11(X3,X1) ),
c_0_91,
[final] ).
cnf(c_0_118,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
c_0_92,
[final] ).
cnf(c_0_119,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_93,
[final] ).
cnf(c_0_120,negated_conjecture,
~ p2(c12,f3(f4(c13))),
c_0_94,
[final] ).
cnf(c_0_121,negated_conjecture,
p2(f5(c15,c14),c16),
c_0_95,
[final] ).
cnf(c_0_122,negated_conjecture,
p2(f6(c15,c14),c17),
c_0_96,
[final] ).
cnf(c_0_123,negated_conjecture,
p11(c18,f9(c12,c14)),
c_0_97,
[final] ).
cnf(c_0_124,negated_conjecture,
~ p2(c12,f3(c13)),
c_0_98,
[final] ).
cnf(c_0_125,negated_conjecture,
~ p2(c14,f3(c13)),
c_0_99,
[final] ).
cnf(c_0_126,negated_conjecture,
p11(X1,X1),
c_0_100,
[final] ).
cnf(c_0_127,negated_conjecture,
p2(X1,X1),
c_0_101,
[final] ).
cnf(c_0_128,negated_conjecture,
p10(c17,c14),
c_0_102,
[final] ).
cnf(c_0_129,negated_conjecture,
p10(c14,c15),
c_0_103,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_9,negated_conjecture,
( p11(X0,f8(X1,X2))
| ~ p11(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_f226d2.p',c_0_115) ).
cnf(c_55,negated_conjecture,
( p11(X0,f8(X1,X2))
| ~ p11(X0,X2) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_150,negated_conjecture,
( p11(X0,f8(X1,X2))
| ~ p11(X0,X2) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_183,negated_conjecture,
( p11(X0,f8(X1,X2))
| ~ p11(X0,X2) ),
inference(copy,[status(esa)],[c_150]) ).
cnf(c_202,negated_conjecture,
( p11(X0,f8(X1,X2))
| ~ p11(X0,X2) ),
inference(copy,[status(esa)],[c_183]) ).
cnf(c_228,negated_conjecture,
( p11(X0,f8(X1,X2))
| ~ p11(X0,X2) ),
inference(copy,[status(esa)],[c_202]) ).
cnf(c_150088,plain,
( p11(c14,f8(c16,c14))
| ~ p11(c14,c14) ),
inference(instantiation,[status(thm)],[c_228]) ).
cnf(c_6,negated_conjecture,
( p2(X0,f3(c13))
| p11(f9(X0,X1),f9(X0,X2))
| ~ p11(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_f226d2.p',c_0_111) ).
cnf(c_49,negated_conjecture,
( p2(X0,f3(c13))
| p11(f9(X0,X1),f9(X0,X2))
| ~ p11(X1,X2) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_147,negated_conjecture,
( p2(X0,f3(c13))
| p11(f9(X0,X1),f9(X0,X2))
| ~ p11(X1,X2) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_186,negated_conjecture,
( p2(X0,f3(c13))
| p11(f9(X0,X1),f9(X0,X2))
| ~ p11(X1,X2) ),
inference(copy,[status(esa)],[c_147]) ).
cnf(c_199,negated_conjecture,
( p2(X0,f3(c13))
| p11(f9(X0,X1),f9(X0,X2))
| ~ p11(X1,X2) ),
inference(copy,[status(esa)],[c_186]) ).
cnf(c_225,negated_conjecture,
( p2(X0,f3(c13))
| p11(f9(X0,X1),f9(X0,X2))
| ~ p11(X1,X2) ),
inference(copy,[status(esa)],[c_199]) ).
cnf(c_149985,plain,
( p2(c12,f3(c13))
| p11(f9(c12,c14),f9(c12,f8(c16,c14)))
| ~ p11(c14,f8(c16,c14)) ),
inference(instantiation,[status(thm)],[c_225]) ).
cnf(c_11,negated_conjecture,
( ~ p11(X0,X1)
| ~ p11(X1,X2)
| p11(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_f226d2.p',c_0_117) ).
cnf(c_59,negated_conjecture,
( ~ p11(X0,X1)
| ~ p11(X1,X2)
| p11(X0,X2) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_152,negated_conjecture,
( ~ p11(X0,X1)
| ~ p11(X1,X2)
| p11(X0,X2) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_181,negated_conjecture,
( ~ p11(X0,X1)
| ~ p11(X1,X2)
| p11(X0,X2) ),
inference(copy,[status(esa)],[c_152]) ).
cnf(c_204,negated_conjecture,
( ~ p11(X0,X1)
| ~ p11(X1,X2)
| p11(X0,X2) ),
inference(copy,[status(esa)],[c_181]) ).
cnf(c_230,negated_conjecture,
( ~ p11(X0,X1)
| ~ p11(X1,X2)
| p11(X0,X2) ),
inference(copy,[status(esa)],[c_204]) ).
cnf(c_149927,plain,
( p11(c18,f9(c12,f8(c16,c14)))
| ~ p11(c18,X0)
| ~ p11(X0,f9(c12,f8(c16,c14))) ),
inference(instantiation,[status(thm)],[c_230]) ).
cnf(c_149956,plain,
( ~ p11(f9(c12,c14),f9(c12,f8(c16,c14)))
| p11(c18,f9(c12,f8(c16,c14)))
| ~ p11(c18,f9(c12,c14)) ),
inference(instantiation,[status(thm)],[c_149927]) ).
cnf(c_14,negated_conjecture,
~ p11(c18,f9(c12,f8(c16,c14))),
file('/export/starexec/sandbox/tmp/iprover_modulo_f226d2.p',c_0_105) ).
cnf(c_16,negated_conjecture,
~ p2(c12,f3(c13)),
file('/export/starexec/sandbox/tmp/iprover_modulo_f226d2.p',c_0_124) ).
cnf(c_21,negated_conjecture,
p11(c18,f9(c12,c14)),
file('/export/starexec/sandbox/tmp/iprover_modulo_f226d2.p',c_0_123) ).
cnf(c_22,negated_conjecture,
p11(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_f226d2.p',c_0_126) ).
cnf(c_27,plain,
p11(c14,c14),
inference(instantiation,[status(thm)],[c_22]) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_150088,c_149985,c_149956,c_14,c_16,c_21,c_27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN585-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 17:12:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % 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/sandbox/tmp/iprover_proof_fd35be.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_f226d2.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_570356 | 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.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fd35be.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ 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.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn false
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 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.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 2.67/2.87 % --inst_prop_sim_new false
% 2.67/2.87 % --inst_orphan_elimination true
% 2.67/2.87 % --inst_learning_loop_flag true
% 2.67/2.87 % --inst_learning_start 3000
% 2.67/2.87 % --inst_learning_factor 2
% 2.67/2.87 % --inst_start_prop_sim_after_learn 3
% 2.67/2.87 % --inst_sel_renew solver
% 2.67/2.87 % --inst_lit_activity_flag true
% 2.67/2.87 % --inst_out_proof true
% 2.67/2.87
% 2.67/2.87 % ------ Resolution Options
% 2.67/2.87
% 2.67/2.87 % --resolution_flag true
% 2.67/2.87 % --res_lit_sel kbo_max
% 2.67/2.87 % --res_to_prop_solver none
% 2.67/2.87 % --res_prop_simpl_new false
% 2.67/2.87 % --res_prop_simpl_given false
% 2.67/2.87 % --res_passive_queue_type priority_queues
% 2.67/2.87 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.67/2.87 % --res_passive_queues_freq [15;5]
% 2.67/2.87 % --res_forward_subs full
% 2.67/2.87 % --res_backward_subs full
% 2.67/2.87 % --res_forward_subs_resolution true
% 2.67/2.87 % --res_backward_subs_resolution true
% 2.67/2.87 % --res_orphan_elimination false
% 2.67/2.87 % --res_time_limit 1000.
% 2.67/2.87 % --res_out_proof true
% 2.67/2.87 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fd35be.s
% 2.67/2.87 % --modulo true
% 2.67/2.87
% 2.67/2.87 % ------ Combination Options
% 2.67/2.87
% 2.67/2.87 % --comb_res_mult 1000
% 2.67/2.87 % --comb_inst_mult 300
% 2.67/2.87 % ------
% 2.67/2.87
% 2.67/2.87
% 2.67/2.87
% 2.67/2.87 % ------ Proving...
% 2.67/2.87 %
% 2.67/2.87
% 2.67/2.87
% 2.67/2.87 % ------ Statistics
% 2.67/2.87
% 2.67/2.87 % ------ General
% 2.67/2.87
% 2.67/2.87 % num_of_input_clauses: 26
% 2.67/2.87 % num_of_input_neg_conjectures: 26
% 2.67/2.87 % num_of_splits: 0
% 2.67/2.87 % num_of_split_atoms: 0
% 2.67/2.87 % num_of_sem_filtered_clauses: 0
% 2.67/2.87 % num_of_subtypes: 0
% 2.67/2.87 % monotx_restored_types: 0
% 2.67/2.87 % sat_num_of_epr_types: 0
% 2.67/2.87 % sat_num_of_non_cyclic_types: 0
% 2.67/2.87 % sat_guarded_non_collapsed_types: 0
% 2.67/2.87 % is_epr: 0
% 2.67/2.87 % is_horn: 0
% 2.67/2.87 % has_eq: 0
% 2.67/2.87 % num_pure_diseq_elim: 0
% 2.67/2.87 % simp_replaced_by: 0
% 2.67/2.87 % res_preprocessed: 52
% 2.67/2.87 % prep_upred: 0
% 2.67/2.87 % prep_unflattend: 0
% 2.67/2.87 % pred_elim_cands: 0
% 2.67/2.87 % pred_elim: 0
% 2.67/2.87 % pred_elim_cl: 0
% 2.67/2.87 % pred_elim_cycles: 0
% 2.67/2.87 % forced_gc_time: 0
% 2.67/2.87 % gc_basic_clause_elim: 0
% 2.67/2.87 % parsing_time: 0.
% 2.67/2.87 % sem_filter_time: 0.
% 2.67/2.87 % pred_elim_time: 0.
% 2.67/2.87 % out_proof_time: 0.
% 2.67/2.87 % monotx_time: 0.
% 2.67/2.87 % subtype_inf_time: 0.
% 2.67/2.87 % unif_index_cands_time: 0.01
% 2.67/2.87 % unif_index_add_time: 0.001
% 2.67/2.87 % total_time: 2.464
% 2.67/2.87 % num_of_symbols: 42
% 2.67/2.87 % num_of_terms: 120049
% 2.67/2.87
% 2.67/2.87 % ------ Propositional Solver
% 2.67/2.87
% 2.67/2.87 % prop_solver_calls: 5
% 2.67/2.87 % prop_fast_solver_calls: 159
% 2.67/2.87 % prop_num_of_clauses: 157
% 2.67/2.87 % prop_preprocess_simplified: 587
% 2.67/2.87 % prop_fo_subsumed: 0
% 2.67/2.87 % prop_solver_time: 0.
% 2.67/2.87 % prop_fast_solver_time: 0.
% 2.67/2.87 % prop_unsat_core_time: 0.
% 2.67/2.87
% 2.67/2.87 % ------ QBF
% 2.67/2.87
% 2.67/2.87 % qbf_q_res: 0
% 2.67/2.87 % qbf_num_tautologies: 0
% 2.67/2.87 % qbf_prep_cycles: 0
% 2.67/2.87
% 2.67/2.87 % ------ BMC1
% 2.67/2.87
% 2.67/2.87 % bmc1_current_bound: -1
% 2.67/2.87 % bmc1_last_solved_bound: -1
% 2.67/2.87 % bmc1_unsat_core_size: -1
% 2.67/2.87 % bmc1_unsat_core_parents_size: -1
% 2.67/2.87 % bmc1_merge_next_fun: 0
% 2.67/2.87 % bmc1_unsat_core_clauses_time: 0.
% 2.67/2.87
% 2.67/2.87 % ------ Instantiation
% 2.67/2.87
% 2.67/2.87 % inst_num_of_clauses: 108
% 2.67/2.87 % inst_num_in_passive: 36
% 2.67/2.87 % inst_num_in_active: 60
% 2.67/2.87 % inst_num_in_unprocessed: 7
% 2.67/2.87 % inst_num_of_loops: 66
% 2.67/2.87 % inst_num_of_learning_restarts: 0
% 2.67/2.87 % inst_num_moves_active_passive: 0
% 2.67/2.87 % inst_lit_activity: 31
% 2.67/2.87 % inst_lit_activity_moves: 0
% 2.67/2.87 % inst_num_tautologies: 3
% 2.67/2.87 % inst_num_prop_implied: 0
% 2.67/2.87 % inst_num_existing_simplified: 0
% 2.67/2.87 % inst_num_eq_res_simplified: 0
% 2.67/2.87 % inst_num_child_elim: 0
% 2.67/2.87 % inst_num_of_dismatching_blockings: 9
% 2.67/2.87 % inst_num_of_non_proper_insts: 105
% 2.67/2.87 % inst_num_of_duplicates: 23
% 2.67/2.87 % inst_inst_num_from_inst_to_res: 0
% 2.67/2.87 % inst_dismatching_checking_time: 0.
% 2.67/2.87
% 2.67/2.87 % ------ Resolution
% 2.67/2.87
% 2.67/2.87 % res_num_of_clauses: 68155
% 2.67/2.87 % res_num_in_passive: 67188
% 2.67/2.87 % res_num_in_active: 971
% 2.67/2.87 % res_num_of_loops: 1000
% 2.67/2.87 % res_forward_subset_subsumed: 3674
% 2.67/2.87 % res_backward_subset_subsumed: 4
% 2.67/2.87 % res_forward_subsumed: 28
% 2.67/2.87 % res_backward_subsumed: 0
% 2.67/2.87 % res_forward_subsumption_resolution: 4
% 2.67/2.87 % res_backward_subsumption_resolution: 0
% 2.67/2.87 % res_clause_to_clause_subsumption: 14924
% 2.67/2.87 % res_orphan_elimination: 0
% 2.67/2.87 % res_tautology_del: 19
% 2.67/2.87 % res_num_eq_res_simplified: 0
% 2.67/2.87 % res_num_sel_changes: 0
% 2.67/2.87 % res_moves_from_active_to_pass: 0
% 2.67/2.87
% 2.67/2.87 % Status Unsatisfiable
% 2.67/2.87 % SZS status Unsatisfiable
% 2.67/2.87 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------