TSTP Solution File: SYN578-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN578-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.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:05 EDT 2022
% Result : Unsatisfiable 0.51s 0.69s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 35
% Syntax : Number of formulae : 214 ( 82 unt; 0 def)
% Number of atoms : 471 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 520 ( 263 ~; 257 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 354 ( 0 sgn 126 !; 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,
! [X34,X35] :
( ~ p11(X34,c15)
| ~ p9(c12,X35)
| ~ p9(f8(X35,X34),X35)
| ~ p9(f8(X35,X34),f4(X34)) ),
file('<stdin>',not_p11_23) ).
fof(c_0_1,negated_conjecture,
! [X34,X35] :
( p9(f8(X35,X34),X35)
| p9(f8(X35,X34),f4(X34))
| ~ p11(X34,c15)
| ~ p9(c12,X35) ),
file('<stdin>',p9_22) ).
fof(c_0_2,negated_conjecture,
! [X30,X31,X32,X33] :
( p7(f8(X33,X32),f8(X31,X30))
| ~ p2(X32,X30)
| ~ p3(X33,X31) ),
file('<stdin>',p7_21) ).
fof(c_0_3,negated_conjecture,
! [X26,X27,X28,X29] :
( p9(X29,X28)
| ~ p7(X26,X29)
| ~ p9(X26,X27)
| ~ p3(X27,X28) ),
file('<stdin>',p9_20) ).
fof(c_0_4,negated_conjecture,
! [X22,X23,X24,X25] :
( p11(X25,X24)
| ~ p11(X22,X23)
| ~ p2(X22,X25)
| ~ p10(X23,X24) ),
file('<stdin>',p11_19) ).
fof(c_0_5,negated_conjecture,
! [X20,X21,X4] :
( p2(X21,X20)
| ~ p2(X4,X21)
| ~ p2(X4,X20) ),
file('<stdin>',p2_18) ).
fof(c_0_6,negated_conjecture,
! [X18,X19,X3] :
( p3(X19,X18)
| ~ p3(X3,X19)
| ~ p3(X3,X18) ),
file('<stdin>',p3_17) ).
fof(c_0_7,negated_conjecture,
! [X16,X17,X2] :
( p7(X17,X16)
| ~ p7(X2,X17)
| ~ p7(X2,X16) ),
file('<stdin>',p7_16) ).
fof(c_0_8,negated_conjecture,
! [X14,X15,X1] :
( p10(X15,X14)
| ~ p10(X1,X15)
| ~ p10(X1,X14) ),
file('<stdin>',p10_15) ).
fof(c_0_9,negated_conjecture,
! [X12,X13] :
( p3(f4(X13),f4(X12))
| ~ p2(X13,X12) ),
file('<stdin>',p3_14) ).
fof(c_0_10,negated_conjecture,
! [X10,X11] :
( p3(f6(X11),f6(X10))
| ~ p2(X11,X10) ),
file('<stdin>',p3_13) ).
fof(c_0_11,negated_conjecture,
! [X8,X9] :
( p2(f5(X9),f5(X8))
| ~ p2(X9,X8) ),
file('<stdin>',p2_12) ).
fof(c_0_12,negated_conjecture,
! [X7] :
( p9(X7,c13)
| ~ p9(X7,f4(c16)) ),
file('<stdin>',p9_10) ).
fof(c_0_13,negated_conjecture,
! [X6] : p3(f6(f5(X6)),f6(X6)),
file('<stdin>',p3_9) ).
fof(c_0_14,negated_conjecture,
! [X5] : p3(f4(f5(X5)),f4(X5)),
file('<stdin>',p3_8) ).
fof(c_0_15,negated_conjecture,
! [X7] :
( p9(X7,f4(c16))
| ~ p9(X7,c13) ),
file('<stdin>',p9_11) ).
fof(c_0_16,negated_conjecture,
p2(c16,f5(c14)),
file('<stdin>',p2_7) ).
fof(c_0_17,negated_conjecture,
! [X4] : p2(X4,X4),
file('<stdin>',p2_4) ).
fof(c_0_18,negated_conjecture,
! [X3] : p3(X3,X3),
file('<stdin>',p3_3) ).
fof(c_0_19,negated_conjecture,
! [X2] : p7(X2,X2),
file('<stdin>',p7_2) ).
fof(c_0_20,negated_conjecture,
! [X1] : p10(X1,X1),
file('<stdin>',p10_1) ).
fof(c_0_21,negated_conjecture,
p11(c14,c15),
file('<stdin>',p11_6) ).
fof(c_0_22,negated_conjecture,
p9(c12,c13),
file('<stdin>',p9_5) ).
fof(c_0_23,negated_conjecture,
! [X34,X35] :
( ~ p11(X34,c15)
| ~ p9(c12,X35)
| ~ p9(f8(X35,X34),X35)
| ~ p9(f8(X35,X34),f4(X34)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_24,negated_conjecture,
! [X34,X35] :
( p9(f8(X35,X34),X35)
| p9(f8(X35,X34),f4(X34))
| ~ p11(X34,c15)
| ~ p9(c12,X35) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_25,negated_conjecture,
! [X30,X31,X32,X33] :
( p7(f8(X33,X32),f8(X31,X30))
| ~ p2(X32,X30)
| ~ p3(X33,X31) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_26,negated_conjecture,
! [X26,X27,X28,X29] :
( p9(X29,X28)
| ~ p7(X26,X29)
| ~ p9(X26,X27)
| ~ p3(X27,X28) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_27,negated_conjecture,
! [X22,X23,X24,X25] :
( p11(X25,X24)
| ~ p11(X22,X23)
| ~ p2(X22,X25)
| ~ p10(X23,X24) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_28,negated_conjecture,
! [X20,X21,X4] :
( p2(X21,X20)
| ~ p2(X4,X21)
| ~ p2(X4,X20) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_29,negated_conjecture,
! [X18,X19,X3] :
( p3(X19,X18)
| ~ p3(X3,X19)
| ~ p3(X3,X18) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_30,negated_conjecture,
! [X16,X17,X2] :
( p7(X17,X16)
| ~ p7(X2,X17)
| ~ p7(X2,X16) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_31,negated_conjecture,
! [X14,X15,X1] :
( p10(X15,X14)
| ~ p10(X1,X15)
| ~ p10(X1,X14) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_32,negated_conjecture,
! [X12,X13] :
( p3(f4(X13),f4(X12))
| ~ p2(X13,X12) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_33,negated_conjecture,
! [X10,X11] :
( p3(f6(X11),f6(X10))
| ~ p2(X11,X10) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_34,negated_conjecture,
! [X8,X9] :
( p2(f5(X9),f5(X8))
| ~ p2(X9,X8) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_35,negated_conjecture,
! [X7] :
( p9(X7,c13)
| ~ p9(X7,f4(c16)) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_36,negated_conjecture,
! [X6] : p3(f6(f5(X6)),f6(X6)),
c_0_13 ).
fof(c_0_37,negated_conjecture,
! [X5] : p3(f4(f5(X5)),f4(X5)),
c_0_14 ).
fof(c_0_38,negated_conjecture,
! [X7] :
( p9(X7,f4(c16))
| ~ p9(X7,c13) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_39,negated_conjecture,
p2(c16,f5(c14)),
c_0_16 ).
fof(c_0_40,negated_conjecture,
! [X4] : p2(X4,X4),
c_0_17 ).
fof(c_0_41,negated_conjecture,
! [X3] : p3(X3,X3),
c_0_18 ).
fof(c_0_42,negated_conjecture,
! [X2] : p7(X2,X2),
c_0_19 ).
fof(c_0_43,negated_conjecture,
! [X1] : p10(X1,X1),
c_0_20 ).
fof(c_0_44,negated_conjecture,
p11(c14,c15),
c_0_21 ).
fof(c_0_45,negated_conjecture,
p9(c12,c13),
c_0_22 ).
fof(c_0_46,negated_conjecture,
! [X36,X37] :
( ~ p11(X36,c15)
| ~ p9(c12,X37)
| ~ p9(f8(X37,X36),X37)
| ~ p9(f8(X37,X36),f4(X36)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_23])])]) ).
fof(c_0_47,negated_conjecture,
! [X36,X37] :
( p9(f8(X37,X36),X37)
| p9(f8(X37,X36),f4(X36))
| ~ p11(X36,c15)
| ~ p9(c12,X37) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_48,negated_conjecture,
! [X34,X35,X36,X37] :
( p7(f8(X37,X36),f8(X35,X34))
| ~ p2(X36,X34)
| ~ p3(X37,X35) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_49,negated_conjecture,
! [X30,X31,X32,X33] :
( p9(X33,X32)
| ~ p7(X30,X33)
| ~ p9(X30,X31)
| ~ p3(X31,X32) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_50,negated_conjecture,
! [X26,X27,X28,X29] :
( p11(X29,X28)
| ~ p11(X26,X27)
| ~ p2(X26,X29)
| ~ p10(X27,X28) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_51,negated_conjecture,
! [X22,X23,X24] :
( p2(X23,X22)
| ~ p2(X24,X23)
| ~ p2(X24,X22) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_28])])]) ).
fof(c_0_52,negated_conjecture,
! [X20,X21,X22] :
( p3(X21,X20)
| ~ p3(X22,X21)
| ~ p3(X22,X20) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_29])])]) ).
fof(c_0_53,negated_conjecture,
! [X18,X19,X20] :
( p7(X19,X18)
| ~ p7(X20,X19)
| ~ p7(X20,X18) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_30])])]) ).
fof(c_0_54,negated_conjecture,
! [X16,X17,X18] :
( p10(X17,X16)
| ~ p10(X18,X17)
| ~ p10(X18,X16) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_31])])]) ).
fof(c_0_55,negated_conjecture,
! [X14,X15] :
( p3(f4(X15),f4(X14))
| ~ p2(X15,X14) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_56,negated_conjecture,
! [X12,X13] :
( p3(f6(X13),f6(X12))
| ~ p2(X13,X12) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_57,negated_conjecture,
! [X10,X11] :
( p2(f5(X11),f5(X10))
| ~ p2(X11,X10) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_58,negated_conjecture,
! [X8] :
( p9(X8,c13)
| ~ p9(X8,f4(c16)) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_59,negated_conjecture,
! [X7] : p3(f6(f5(X7)),f6(X7)),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_60,negated_conjecture,
! [X6] : p3(f4(f5(X6)),f4(X6)),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_61,negated_conjecture,
! [X8] :
( p9(X8,f4(c16))
| ~ p9(X8,c13) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_62,negated_conjecture,
p2(c16,f5(c14)),
c_0_39 ).
fof(c_0_63,negated_conjecture,
! [X5] : p2(X5,X5),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_64,negated_conjecture,
! [X4] : p3(X4,X4),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_65,negated_conjecture,
! [X3] : p7(X3,X3),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_66,negated_conjecture,
! [X2] : p10(X2,X2),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_67,negated_conjecture,
p11(c14,c15),
c_0_44 ).
fof(c_0_68,negated_conjecture,
p9(c12,c13),
c_0_45 ).
cnf(c_0_69,negated_conjecture,
( ~ p9(f8(X1,X2),f4(X2))
| ~ p9(f8(X1,X2),X1)
| ~ p9(c12,X1)
| ~ p11(X2,c15) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_70,negated_conjecture,
( p9(f8(X1,X2),f4(X2))
| p9(f8(X1,X2),X1)
| ~ p9(c12,X1)
| ~ p11(X2,c15) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_71,negated_conjecture,
( p7(f8(X1,X3),f8(X2,X4))
| ~ p3(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_72,negated_conjecture,
( p9(X4,X2)
| ~ p3(X1,X2)
| ~ p9(X3,X1)
| ~ p7(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_73,negated_conjecture,
( p11(X4,X2)
| ~ p10(X1,X2)
| ~ p2(X3,X4)
| ~ p11(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_74,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_75,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_76,negated_conjecture,
( p7(X3,X2)
| ~ p7(X1,X2)
| ~ p7(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_77,negated_conjecture,
( p10(X3,X2)
| ~ p10(X1,X2)
| ~ p10(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_78,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_79,negated_conjecture,
( p3(f6(X1),f6(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_80,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_81,negated_conjecture,
( p9(X1,c13)
| ~ p9(X1,f4(c16)) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_82,negated_conjecture,
p3(f6(f5(X1)),f6(X1)),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_83,negated_conjecture,
p3(f4(f5(X1)),f4(X1)),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_84,negated_conjecture,
( p9(X1,f4(c16))
| ~ p9(X1,c13) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_85,negated_conjecture,
p2(c16,f5(c14)),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_86,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_87,negated_conjecture,
p3(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_88,negated_conjecture,
p7(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_89,negated_conjecture,
p10(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_90,negated_conjecture,
p11(c14,c15),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_91,negated_conjecture,
p9(c12,c13),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_92,negated_conjecture,
( ~ p9(f8(X1,X2),f4(X2))
| ~ p9(f8(X1,X2),X1)
| ~ p9(c12,X1)
| ~ p11(X2,c15) ),
c_0_69,
[final] ).
cnf(c_0_93,negated_conjecture,
( p9(f8(X1,X2),f4(X2))
| p9(f8(X1,X2),X1)
| ~ p9(c12,X1)
| ~ p11(X2,c15) ),
c_0_70,
[final] ).
cnf(c_0_94,negated_conjecture,
( p7(f8(X1,X3),f8(X2,X4))
| ~ p3(X1,X2)
| ~ p2(X3,X4) ),
c_0_71,
[final] ).
cnf(c_0_95,negated_conjecture,
( p9(X4,X2)
| ~ p3(X1,X2)
| ~ p9(X3,X1)
| ~ p7(X3,X4) ),
c_0_72,
[final] ).
cnf(c_0_96,negated_conjecture,
( p11(X4,X2)
| ~ p10(X1,X2)
| ~ p2(X3,X4)
| ~ p11(X3,X1) ),
c_0_73,
[final] ).
cnf(c_0_97,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_74,
[final] ).
cnf(c_0_98,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
c_0_75,
[final] ).
cnf(c_0_99,negated_conjecture,
( p7(X3,X2)
| ~ p7(X1,X2)
| ~ p7(X1,X3) ),
c_0_76,
[final] ).
cnf(c_0_100,negated_conjecture,
( p10(X3,X2)
| ~ p10(X1,X2)
| ~ p10(X1,X3) ),
c_0_77,
[final] ).
cnf(c_0_101,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_78,
[final] ).
cnf(c_0_102,negated_conjecture,
( p3(f6(X1),f6(X2))
| ~ p2(X1,X2) ),
c_0_79,
[final] ).
cnf(c_0_103,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p2(X1,X2) ),
c_0_80,
[final] ).
cnf(c_0_104,negated_conjecture,
( p9(X1,c13)
| ~ p9(X1,f4(c16)) ),
c_0_81,
[final] ).
cnf(c_0_105,negated_conjecture,
p3(f6(f5(X1)),f6(X1)),
c_0_82,
[final] ).
cnf(c_0_106,negated_conjecture,
p3(f4(f5(X1)),f4(X1)),
c_0_83,
[final] ).
cnf(c_0_107,negated_conjecture,
( p9(X1,f4(c16))
| ~ p9(X1,c13) ),
c_0_84,
[final] ).
cnf(c_0_108,negated_conjecture,
p2(c16,f5(c14)),
c_0_85,
[final] ).
cnf(c_0_109,negated_conjecture,
p2(X1,X1),
c_0_86,
[final] ).
cnf(c_0_110,negated_conjecture,
p3(X1,X1),
c_0_87,
[final] ).
cnf(c_0_111,negated_conjecture,
p7(X1,X1),
c_0_88,
[final] ).
cnf(c_0_112,negated_conjecture,
p10(X1,X1),
c_0_89,
[final] ).
cnf(c_0_113,negated_conjecture,
p11(c14,c15),
c_0_90,
[final] ).
cnf(c_0_114,negated_conjecture,
p9(c12,c13),
c_0_91,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p7(X0,X2)
| ~ p3(X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_95) ).
cnf(c_42,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p7(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_131,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p7(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_170,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p7(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_131]) ).
cnf(c_177,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p7(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_170]) ).
cnf(c_226,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p7(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_177]) ).
cnf(c_9,negated_conjecture,
( p3(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_101) ).
cnf(c_54,negated_conjecture,
( p3(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_137,negated_conjecture,
( p3(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_164,negated_conjecture,
( p3(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_137]) ).
cnf(c_183,negated_conjecture,
( p3(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_164]) ).
cnf(c_238,negated_conjecture,
( p3(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_183]) ).
cnf(c_366,plain,
( ~ p9(X0,f4(X1))
| p9(X2,f4(X3))
| ~ p7(X0,X2)
| ~ p2(X1,X3) ),
inference(resolution,[status(thm)],[c_226,c_238]) ).
cnf(c_367,plain,
( ~ p9(X0,f4(X1))
| p9(X2,f4(X3))
| ~ p7(X0,X2)
| ~ p2(X1,X3) ),
inference(rewriting,[status(thm)],[c_366]) ).
cnf(c_5,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_97) ).
cnf(c_46,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_133,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_168,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_133]) ).
cnf(c_179,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_168]) ).
cnf(c_230,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_179]) ).
cnf(c_16,negated_conjecture,
p2(c16,f5(c14)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_108) ).
cnf(c_68,negated_conjecture,
p2(c16,f5(c14)),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_144,negated_conjecture,
p2(c16,f5(c14)),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_157,negated_conjecture,
p2(c16,f5(c14)),
inference(copy,[status(esa)],[c_144]) ).
cnf(c_190,negated_conjecture,
p2(c16,f5(c14)),
inference(copy,[status(esa)],[c_157]) ).
cnf(c_252,plain,
p2(c16,f5(c14)),
inference(copy,[status(esa)],[c_190]) ).
cnf(c_314,plain,
( ~ p2(c16,X0)
| p2(X0,f5(c14)) ),
inference(resolution,[status(thm)],[c_230,c_252]) ).
cnf(c_315,plain,
( ~ p2(c16,X0)
| p2(X0,f5(c14)) ),
inference(rewriting,[status(thm)],[c_314]) ).
cnf(c_836,plain,
( p9(X0,f4(f5(c14)))
| ~ p9(X1,f4(X2))
| ~ p7(X1,X0)
| ~ p2(c16,X2) ),
inference(resolution,[status(thm)],[c_367,c_315]) ).
cnf(c_837,plain,
( p9(X0,f4(f5(c14)))
| ~ p9(X1,f4(X2))
| ~ p7(X1,X0)
| ~ p2(c16,X2) ),
inference(rewriting,[status(thm)],[c_836]) ).
cnf(c_19,negated_conjecture,
p7(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_111) ).
cnf(c_74,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_147,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_154,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_147]) ).
cnf(c_193,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_154]) ).
cnf(c_258,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_193]) ).
cnf(c_2796,plain,
( p9(X0,f4(f5(c14)))
| ~ p9(X0,f4(X1))
| ~ p2(c16,X1) ),
inference(resolution,[status(thm)],[c_837,c_258]) ).
cnf(c_2797,plain,
( p9(X0,f4(f5(c14)))
| ~ p9(X0,f4(X1))
| ~ p2(c16,X1) ),
inference(rewriting,[status(thm)],[c_2796]) ).
cnf(c_13,negated_conjecture,
( p9(X0,f4(c16))
| ~ p9(X0,c13) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_107) ).
cnf(c_62,negated_conjecture,
( p9(X0,f4(c16))
| ~ p9(X0,c13) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_141,negated_conjecture,
( p9(X0,f4(c16))
| ~ p9(X0,c13) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_160,negated_conjecture,
( p9(X0,f4(c16))
| ~ p9(X0,c13) ),
inference(copy,[status(esa)],[c_141]) ).
cnf(c_187,negated_conjecture,
( p9(X0,f4(c16))
| ~ p9(X0,c13) ),
inference(copy,[status(esa)],[c_160]) ).
cnf(c_246,plain,
( p9(X0,f4(c16))
| ~ p9(X0,c13) ),
inference(copy,[status(esa)],[c_187]) ).
cnf(c_2856,plain,
( p9(X0,f4(f5(c14)))
| ~ p9(X0,c13)
| ~ p2(c16,c16) ),
inference(resolution,[status(thm)],[c_2797,c_246]) ).
cnf(c_2857,plain,
( p9(X0,f4(f5(c14)))
| ~ p9(X0,c13)
| ~ p2(c16,c16) ),
inference(rewriting,[status(thm)],[c_2856]) ).
cnf(c_17,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_109) ).
cnf(c_70,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_145,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_156,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_145]) ).
cnf(c_191,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_156]) ).
cnf(c_254,plain,
p2(X0,X0),
inference(copy,[status(esa)],[c_191]) ).
cnf(c_2869,plain,
( p9(X0,f4(f5(c14)))
| ~ p9(X0,c13) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2857,c_254]) ).
cnf(c_2870,plain,
( p9(X0,f4(f5(c14)))
| ~ p9(X0,c13) ),
inference(rewriting,[status(thm)],[c_2869]) ).
cnf(c_15,negated_conjecture,
p3(f4(f5(X0)),f4(X0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_106) ).
cnf(c_66,negated_conjecture,
p3(f4(f5(X0)),f4(X0)),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_143,negated_conjecture,
p3(f4(f5(X0)),f4(X0)),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_158,negated_conjecture,
p3(f4(f5(X0)),f4(X0)),
inference(copy,[status(esa)],[c_143]) ).
cnf(c_189,negated_conjecture,
p3(f4(f5(X0)),f4(X0)),
inference(copy,[status(esa)],[c_158]) ).
cnf(c_250,negated_conjecture,
p3(f4(f5(X0)),f4(X0)),
inference(copy,[status(esa)],[c_189]) ).
cnf(c_372,plain,
( ~ p9(X0,f4(f5(X1)))
| p9(X2,f4(X1))
| ~ p7(X0,X2) ),
inference(resolution,[status(thm)],[c_226,c_250]) ).
cnf(c_373,plain,
( ~ p9(X0,f4(f5(X1)))
| p9(X2,f4(X1))
| ~ p7(X0,X2) ),
inference(rewriting,[status(thm)],[c_372]) ).
cnf(c_808,plain,
( ~ p9(X0,f4(f5(X1)))
| p9(X0,f4(X1)) ),
inference(resolution,[status(thm)],[c_373,c_258]) ).
cnf(c_809,plain,
( ~ p9(X0,f4(f5(X1)))
| p9(X0,f4(X1)) ),
inference(rewriting,[status(thm)],[c_808]) ).
cnf(c_2877,plain,
( p9(X0,f4(c14))
| ~ p9(X0,c13) ),
inference(resolution,[status(thm)],[c_2870,c_809]) ).
cnf(c_2878,plain,
( p9(X0,f4(c14))
| ~ p9(X0,c13) ),
inference(rewriting,[status(thm)],[c_2877]) ).
cnf(c_1,negated_conjecture,
( p9(f8(X0,X1),f4(X1))
| p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_93) ).
cnf(c_38,negated_conjecture,
( p9(f8(X0,X1),f4(X1))
| p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_129,negated_conjecture,
( p9(f8(X0,X1),f4(X1))
| p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_172,negated_conjecture,
( p9(f8(X0,X1),f4(X1))
| p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_129]) ).
cnf(c_175,negated_conjecture,
( p9(f8(X0,X1),f4(X1))
| p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_172]) ).
cnf(c_222,negated_conjecture,
( p9(f8(X0,X1),f4(X1))
| p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_175]) ).
cnf(c_394,plain,
( p9(f8(f4(X0),X0),f4(X0))
| ~ p9(c12,f4(X0))
| ~ p11(X0,c15) ),
inference(factoring,[status(thm)],[c_222]) ).
cnf(c_395,plain,
( p9(f8(f4(X0),X0),f4(X0))
| ~ p9(c12,f4(X0))
| ~ p11(X0,c15) ),
inference(rewriting,[status(thm)],[c_394]) ).
cnf(c_0,negated_conjecture,
( ~ p9(f8(X0,X1),f4(X1))
| ~ p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_92) ).
cnf(c_36,negated_conjecture,
( ~ p9(f8(X0,X1),f4(X1))
| ~ p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_128,negated_conjecture,
( ~ p9(f8(X0,X1),f4(X1))
| ~ p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_173,negated_conjecture,
( ~ p9(f8(X0,X1),f4(X1))
| ~ p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_128]) ).
cnf(c_174,negated_conjecture,
( ~ p9(f8(X0,X1),f4(X1))
| ~ p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_173]) ).
cnf(c_220,negated_conjecture,
( ~ p9(f8(X0,X1),f4(X1))
| ~ p9(f8(X0,X1),X0)
| ~ p9(c12,X0)
| ~ p11(X1,c15) ),
inference(copy,[status(esa)],[c_174]) ).
cnf(c_816,plain,
( ~ p9(f8(f4(X0),X0),f4(X0))
| ~ p9(c12,f4(X0))
| ~ p11(X0,c15) ),
inference(resolution,[status(thm)],[c_395,c_220]) ).
cnf(c_817,plain,
( ~ p9(f8(f4(X0),X0),f4(X0))
| ~ p9(c12,f4(X0))
| ~ p11(X0,c15) ),
inference(rewriting,[status(thm)],[c_816]) ).
cnf(c_2772,plain,
( ~ p9(c12,f4(X0))
| ~ p11(X0,c15) ),
inference(forward_subsumption_resolution,[status(thm)],[c_817,c_395]) ).
cnf(c_2773,plain,
( ~ p9(c12,f4(X0))
| ~ p11(X0,c15) ),
inference(rewriting,[status(thm)],[c_2772]) ).
cnf(c_4275,plain,
( ~ p9(c12,c13)
| ~ p11(c14,c15) ),
inference(resolution,[status(thm)],[c_2878,c_2773]) ).
cnf(c_4276,plain,
( ~ p9(c12,c13)
| ~ p11(c14,c15) ),
inference(rewriting,[status(thm)],[c_4275]) ).
cnf(c_21,negated_conjecture,
p11(c14,c15),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_113) ).
cnf(c_78,negated_conjecture,
p11(c14,c15),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_149,negated_conjecture,
p11(c14,c15),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_152,negated_conjecture,
p11(c14,c15),
inference(copy,[status(esa)],[c_149]) ).
cnf(c_195,negated_conjecture,
p11(c14,c15),
inference(copy,[status(esa)],[c_152]) ).
cnf(c_262,negated_conjecture,
p11(c14,c15),
inference(copy,[status(esa)],[c_195]) ).
cnf(c_22,negated_conjecture,
p9(c12,c13),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p',c_0_114) ).
cnf(c_80,negated_conjecture,
p9(c12,c13),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_150,negated_conjecture,
p9(c12,c13),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_151,negated_conjecture,
p9(c12,c13),
inference(copy,[status(esa)],[c_150]) ).
cnf(c_196,negated_conjecture,
p9(c12,c13),
inference(copy,[status(esa)],[c_151]) ).
cnf(c_264,negated_conjecture,
p9(c12,c13),
inference(copy,[status(esa)],[c_196]) ).
cnf(c_15447,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4276,c_262,c_264]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN578-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n017.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 : Tue Jul 12 00:19:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/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.39 % 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_56bb4c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_1aa561.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_5fb14a | 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/sandbox2/tmp/iprover_proof_56bb4c.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
% 0.51/0.69 % --inst_prop_sim_new false
% 0.51/0.69 % --inst_orphan_elimination true
% 0.51/0.69 % --inst_learning_loop_flag true
% 0.51/0.69 % --inst_learning_start 3000
% 0.51/0.69 % --inst_learning_factor 2
% 0.51/0.69 % --inst_start_prop_sim_after_learn 3
% 0.51/0.69 % --inst_sel_renew solver
% 0.51/0.69 % --inst_lit_activity_flag true
% 0.51/0.69 % --inst_out_proof true
% 0.51/0.69
% 0.51/0.69 % ------ Resolution Options
% 0.51/0.69
% 0.51/0.69 % --resolution_flag true
% 0.51/0.69 % --res_lit_sel kbo_max
% 0.51/0.69 % --res_to_prop_solver none
% 0.51/0.69 % --res_prop_simpl_new false
% 0.51/0.69 % --res_prop_simpl_given false
% 0.51/0.69 % --res_passive_queue_type priority_queues
% 0.51/0.69 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.51/0.69 % --res_passive_queues_freq [15;5]
% 0.51/0.69 % --res_forward_subs full
% 0.51/0.69 % --res_backward_subs full
% 0.51/0.69 % --res_forward_subs_resolution true
% 0.51/0.69 % --res_backward_subs_resolution true
% 0.51/0.69 % --res_orphan_elimination false
% 0.51/0.69 % --res_time_limit 1000.
% 0.51/0.69 % --res_out_proof true
% 0.51/0.69 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_56bb4c.s
% 0.51/0.69 % --modulo true
% 0.51/0.69
% 0.51/0.69 % ------ Combination Options
% 0.51/0.69
% 0.51/0.69 % --comb_res_mult 1000
% 0.51/0.69 % --comb_inst_mult 300
% 0.51/0.69 % ------
% 0.51/0.69
% 0.51/0.69
% 0.51/0.69
% 0.51/0.69 % ------ Proving...
% 0.51/0.69 %
% 0.51/0.69
% 0.51/0.69
% 0.51/0.69 % Resolution empty clause
% 0.51/0.69
% 0.51/0.69 % ------ Statistics
% 0.51/0.69
% 0.51/0.69 % ------ General
% 0.51/0.69
% 0.51/0.69 % num_of_input_clauses: 23
% 0.51/0.69 % num_of_input_neg_conjectures: 23
% 0.51/0.69 % num_of_splits: 0
% 0.51/0.69 % num_of_split_atoms: 0
% 0.51/0.69 % num_of_sem_filtered_clauses: 0
% 0.51/0.69 % num_of_subtypes: 0
% 0.51/0.69 % monotx_restored_types: 0
% 0.51/0.69 % sat_num_of_epr_types: 0
% 0.51/0.69 % sat_num_of_non_cyclic_types: 0
% 0.51/0.69 % sat_guarded_non_collapsed_types: 0
% 0.51/0.69 % is_epr: 0
% 0.51/0.69 % is_horn: 0
% 0.51/0.69 % has_eq: 0
% 0.51/0.69 % num_pure_diseq_elim: 0
% 0.51/0.69 % simp_replaced_by: 0
% 0.51/0.69 % res_preprocessed: 46
% 0.51/0.69 % prep_upred: 0
% 0.51/0.69 % prep_unflattend: 0
% 0.51/0.69 % pred_elim_cands: 0
% 0.51/0.69 % pred_elim: 0
% 0.51/0.69 % pred_elim_cl: 0
% 0.51/0.69 % pred_elim_cycles: 0
% 0.51/0.69 % forced_gc_time: 0
% 0.51/0.69 % gc_basic_clause_elim: 0
% 0.51/0.69 % parsing_time: 0.
% 0.51/0.69 % sem_filter_time: 0.
% 0.51/0.69 % pred_elim_time: 0.
% 0.51/0.69 % out_proof_time: 0.002
% 0.51/0.69 % monotx_time: 0.
% 0.51/0.69 % subtype_inf_time: 0.
% 0.51/0.69 % unif_index_cands_time: 0.003
% 0.51/0.69 % unif_index_add_time: 0.
% 0.51/0.69 % total_time: 0.286
% 0.51/0.69 % num_of_symbols: 40
% 0.51/0.69 % num_of_terms: 3467
% 0.51/0.69
% 0.51/0.69 % ------ Propositional Solver
% 0.51/0.69
% 0.51/0.69 % prop_solver_calls: 1
% 0.51/0.69 % prop_fast_solver_calls: 150
% 0.51/0.69 % prop_num_of_clauses: 36
% 0.51/0.69 % prop_preprocess_simplified: 394
% 0.51/0.69 % prop_fo_subsumed: 0
% 0.51/0.69 % prop_solver_time: 0.
% 0.51/0.69 % prop_fast_solver_time: 0.
% 0.51/0.69 % prop_unsat_core_time: 0.
% 0.51/0.69
% 0.51/0.69 % ------ QBF
% 0.51/0.69
% 0.51/0.69 % qbf_q_res: 0
% 0.51/0.69 % qbf_num_tautologies: 0
% 0.51/0.69 % qbf_prep_cycles: 0
% 0.51/0.69
% 0.51/0.69 % ------ BMC1
% 0.51/0.69
% 0.51/0.69 % bmc1_current_bound: -1
% 0.51/0.69 % bmc1_last_solved_bound: -1
% 0.51/0.69 % bmc1_unsat_core_size: -1
% 0.51/0.69 % bmc1_unsat_core_parents_size: -1
% 0.51/0.69 % bmc1_merge_next_fun: 0
% 0.51/0.69 % bmc1_unsat_core_clauses_time: 0.
% 0.51/0.69
% 0.51/0.69 % ------ Instantiation
% 0.51/0.69
% 0.51/0.69 % inst_num_of_clauses: 23
% 0.51/0.69 % inst_num_in_passive: 0
% 0.51/0.69 % inst_num_in_active: 0
% 0.51/0.69 % inst_num_in_unprocessed: 23
% 0.51/0.69 % inst_num_of_loops: 0
% 0.51/0.69 % inst_num_of_learning_restarts: 0
% 0.51/0.69 % inst_num_moves_active_passive: 0
% 0.51/0.69 % inst_lit_activity: 0
% 0.51/0.69 % inst_lit_activity_moves: 0
% 0.51/0.69 % inst_num_tautologies: 0
% 0.51/0.69 % inst_num_prop_implied: 0
% 0.51/0.69 % inst_num_existing_simplified: 0
% 0.51/0.69 % inst_num_eq_res_simplified: 0
% 0.51/0.69 % inst_num_child_elim: 0
% 0.51/0.69 % inst_num_of_dismatching_blockings: 0
% 0.51/0.69 % inst_num_of_non_proper_insts: 0
% 0.51/0.69 % inst_num_of_duplicates: 0
% 0.51/0.69 % inst_inst_num_from_inst_to_res: 0
% 0.51/0.69 % inst_dismatching_checking_time: 0.
% 0.51/0.69
% 0.51/0.69 % ------ Resolution
% 0.51/0.69
% 0.51/0.69 % res_num_of_clauses: 5139
% 0.51/0.69 % res_num_in_passive: 4737
% 0.51/0.69 % res_num_in_active: 472
% 0.51/0.69 % res_num_of_loops: 501
% 0.51/0.69 % res_forward_subset_subsumed: 1020
% 0.51/0.69 % res_backward_subset_subsumed: 71
% 0.51/0.69 % res_forward_subsumed: 23
% 0.51/0.69 % res_backward_subsumed: 5
% 0.51/0.69 % res_forward_subsumption_resolution: 11
% 0.51/0.69 % res_backward_subsumption_resolution: 0
% 0.51/0.69 % res_clause_to_clause_subsumption: 7252
% 0.51/0.69 % res_orphan_elimination: 0
% 0.51/0.69 % res_tautology_del: 33
% 0.51/0.69 % res_num_eq_res_simplified: 0
% 0.51/0.69 % res_num_sel_changes: 0
% 0.51/0.69 % res_moves_from_active_to_pass: 0
% 0.51/0.69
% 0.51/0.69 % Status Unsatisfiable
% 0.51/0.69 % SZS status Unsatisfiable
% 0.51/0.69 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------