TSTP Solution File: SYN590-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN590-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n014.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:11 EDT 2022
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 37
% Syntax : Number of formulae : 222 ( 61 unt; 0 def)
% Number of atoms : 466 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 509 ( 265 ~; 244 |; 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 : 11 ( 11 usr; 6 con; 0-1 aty)
% Number of variables : 333 ( 0 sgn 129 !; 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,
! [X33,X34,X35,X36] :
( p12(X36,X35)
| ~ p5(X34,X36)
| ~ p5(X33,X35)
| ~ p12(X34,X33) ),
file('<stdin>',p12_27) ).
fof(c_0_1,negated_conjecture,
! [X29,X30,X31,X32] :
( p10(X32,X31)
| ~ p3(X30,X32)
| ~ p3(X29,X31)
| ~ p10(X30,X29) ),
file('<stdin>',p10_26) ).
fof(c_0_2,negated_conjecture,
! [X27,X28] :
( ~ p11(X28)
| ~ p12(X27,c15)
| ~ p3(f4(X28),f6(X27)) ),
file('<stdin>',not_p11_25) ).
fof(c_0_3,negated_conjecture,
! [X25,X26,X3] :
( p3(X26,X25)
| ~ p3(X3,X26)
| ~ p3(X3,X25) ),
file('<stdin>',p3_24) ).
fof(c_0_4,negated_conjecture,
! [X23,X24,X2] :
( p2(X24,X23)
| ~ p2(X2,X24)
| ~ p2(X2,X23) ),
file('<stdin>',p2_23) ).
fof(c_0_5,negated_conjecture,
! [X21,X22,X1] :
( p5(X22,X21)
| ~ p5(X1,X22)
| ~ p5(X1,X21) ),
file('<stdin>',p5_22) ).
fof(c_0_6,negated_conjecture,
! [X7,X8] :
( p12(X8,X7)
| ~ p10(f6(X8),f6(X7)) ),
file('<stdin>',p12_11) ).
fof(c_0_7,negated_conjecture,
! [X17,X18] :
( p5(f7(X18),f7(X17))
| ~ p5(X18,X17) ),
file('<stdin>',p5_17) ).
fof(c_0_8,negated_conjecture,
! [X15,X16] :
( p3(f6(X16),f6(X15))
| ~ p5(X16,X15) ),
file('<stdin>',p3_16) ).
fof(c_0_9,negated_conjecture,
! [X13,X14] :
( p3(f4(X14),f4(X13))
| ~ p2(X14,X13) ),
file('<stdin>',p3_15) ).
fof(c_0_10,negated_conjecture,
! [X11,X12] :
( p2(f9(X12),f9(X11))
| ~ p2(X12,X11) ),
file('<stdin>',p2_14) ).
fof(c_0_11,negated_conjecture,
! [X7,X8] :
( p10(f6(X8),f6(X7))
| ~ p12(X8,X7) ),
file('<stdin>',p10_13) ).
fof(c_0_12,negated_conjecture,
! [X9,X10] :
( p5(f8(X10),f8(X9))
| ~ p2(X10,X9) ),
file('<stdin>',p5_12) ).
fof(c_0_13,negated_conjecture,
! [X4] :
( p10(f4(f9(X4)),f4(X4))
| ~ p11(X4) ),
file('<stdin>',p10_19) ).
fof(c_0_14,negated_conjecture,
! [X19] :
( p3(f4(X19),f6(f8(X19)))
| ~ p11(X19) ),
file('<stdin>',p3_18) ).
fof(c_0_15,negated_conjecture,
! [X4] :
( p10(f6(f7(c13)),f4(X4))
| ~ p11(X4) ),
file('<stdin>',p10_21) ).
fof(c_0_16,negated_conjecture,
! [X20] :
( p10(f6(f7(c13)),f4(X20))
| ~ p11(X20) ),
file('<stdin>',p10_20) ).
fof(c_0_17,negated_conjecture,
! [X5,X6] :
( p11(X6)
| ~ p11(X5)
| ~ p2(X5,X6) ),
file('<stdin>',p11_10) ).
fof(c_0_18,negated_conjecture,
p3(f4(c16),f6(c15)),
file('<stdin>',p3_8) ).
fof(c_0_19,negated_conjecture,
p3(f4(c17),f6(c18)),
file('<stdin>',p3_7) ).
fof(c_0_20,negated_conjecture,
! [X4] :
( p11(f9(X4))
| ~ p11(X4) ),
file('<stdin>',p11_9) ).
fof(c_0_21,negated_conjecture,
! [X3] : p3(X3,X3),
file('<stdin>',p3_6) ).
fof(c_0_22,negated_conjecture,
! [X2] : p2(X2,X2),
file('<stdin>',p2_5) ).
fof(c_0_23,negated_conjecture,
! [X1] : p5(X1,X1),
file('<stdin>',p5_4) ).
fof(c_0_24,negated_conjecture,
p11(c16),
file('<stdin>',c16_is_p11_3) ).
fof(c_0_25,negated_conjecture,
p11(c17),
file('<stdin>',c17_is_p11_2) ).
fof(c_0_26,negated_conjecture,
p11(c14),
file('<stdin>',c14_is_p11_1) ).
fof(c_0_27,negated_conjecture,
! [X33,X34,X35,X36] :
( p12(X36,X35)
| ~ p5(X34,X36)
| ~ p5(X33,X35)
| ~ p12(X34,X33) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_28,negated_conjecture,
! [X29,X30,X31,X32] :
( p10(X32,X31)
| ~ p3(X30,X32)
| ~ p3(X29,X31)
| ~ p10(X30,X29) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_29,negated_conjecture,
! [X27,X28] :
( ~ p11(X28)
| ~ p12(X27,c15)
| ~ p3(f4(X28),f6(X27)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_30,negated_conjecture,
! [X25,X26,X3] :
( p3(X26,X25)
| ~ p3(X3,X26)
| ~ p3(X3,X25) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_31,negated_conjecture,
! [X23,X24,X2] :
( p2(X24,X23)
| ~ p2(X2,X24)
| ~ p2(X2,X23) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_32,negated_conjecture,
! [X21,X22,X1] :
( p5(X22,X21)
| ~ p5(X1,X22)
| ~ p5(X1,X21) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_33,negated_conjecture,
! [X7,X8] :
( p12(X8,X7)
| ~ p10(f6(X8),f6(X7)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_34,negated_conjecture,
! [X17,X18] :
( p5(f7(X18),f7(X17))
| ~ p5(X18,X17) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_35,negated_conjecture,
! [X15,X16] :
( p3(f6(X16),f6(X15))
| ~ p5(X16,X15) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_36,negated_conjecture,
! [X13,X14] :
( p3(f4(X14),f4(X13))
| ~ p2(X14,X13) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_37,negated_conjecture,
! [X11,X12] :
( p2(f9(X12),f9(X11))
| ~ p2(X12,X11) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_38,negated_conjecture,
! [X7,X8] :
( p10(f6(X8),f6(X7))
| ~ p12(X8,X7) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_39,negated_conjecture,
! [X9,X10] :
( p5(f8(X10),f8(X9))
| ~ p2(X10,X9) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_40,negated_conjecture,
! [X4] :
( p10(f4(f9(X4)),f4(X4))
| ~ p11(X4) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_41,negated_conjecture,
! [X19] :
( p3(f4(X19),f6(f8(X19)))
| ~ p11(X19) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_42,negated_conjecture,
! [X4] :
( p10(f6(f7(c13)),f4(X4))
| ~ p11(X4) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_43,negated_conjecture,
! [X20] :
( p10(f6(f7(c13)),f4(X20))
| ~ p11(X20) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_44,negated_conjecture,
! [X5,X6] :
( p11(X6)
| ~ p11(X5)
| ~ p2(X5,X6) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_45,negated_conjecture,
p3(f4(c16),f6(c15)),
c_0_18 ).
fof(c_0_46,negated_conjecture,
p3(f4(c17),f6(c18)),
c_0_19 ).
fof(c_0_47,negated_conjecture,
! [X4] :
( p11(f9(X4))
| ~ p11(X4) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_48,negated_conjecture,
! [X3] : p3(X3,X3),
c_0_21 ).
fof(c_0_49,negated_conjecture,
! [X2] : p2(X2,X2),
c_0_22 ).
fof(c_0_50,negated_conjecture,
! [X1] : p5(X1,X1),
c_0_23 ).
fof(c_0_51,negated_conjecture,
p11(c16),
c_0_24 ).
fof(c_0_52,negated_conjecture,
p11(c17),
c_0_25 ).
fof(c_0_53,negated_conjecture,
p11(c14),
c_0_26 ).
fof(c_0_54,negated_conjecture,
! [X37,X38,X39,X40] :
( p12(X40,X39)
| ~ p5(X38,X40)
| ~ p5(X37,X39)
| ~ p12(X38,X37) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_55,negated_conjecture,
! [X33,X34,X35,X36] :
( p10(X36,X35)
| ~ p3(X34,X36)
| ~ p3(X33,X35)
| ~ p10(X34,X33) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_56,negated_conjecture,
! [X29,X30] :
( ~ p11(X30)
| ~ p12(X29,c15)
| ~ p3(f4(X30),f6(X29)) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_57,negated_conjecture,
! [X27,X28,X29] :
( p3(X28,X27)
| ~ p3(X29,X28)
| ~ p3(X29,X27) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_30])])]) ).
fof(c_0_58,negated_conjecture,
! [X25,X26,X27] :
( p2(X26,X25)
| ~ p2(X27,X26)
| ~ p2(X27,X25) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_31])])]) ).
fof(c_0_59,negated_conjecture,
! [X23,X24,X25] :
( p5(X24,X23)
| ~ p5(X25,X24)
| ~ p5(X25,X23) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_32])])]) ).
fof(c_0_60,negated_conjecture,
! [X9,X10] :
( p12(X10,X9)
| ~ p10(f6(X10),f6(X9)) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_61,negated_conjecture,
! [X19,X20] :
( p5(f7(X20),f7(X19))
| ~ p5(X20,X19) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_62,negated_conjecture,
! [X17,X18] :
( p3(f6(X18),f6(X17))
| ~ p5(X18,X17) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_63,negated_conjecture,
! [X15,X16] :
( p3(f4(X16),f4(X15))
| ~ p2(X16,X15) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_64,negated_conjecture,
! [X13,X14] :
( p2(f9(X14),f9(X13))
| ~ p2(X14,X13) ),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_65,negated_conjecture,
! [X9,X10] :
( p10(f6(X10),f6(X9))
| ~ p12(X10,X9) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_66,negated_conjecture,
! [X11,X12] :
( p5(f8(X12),f8(X11))
| ~ p2(X12,X11) ),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_67,negated_conjecture,
! [X5] :
( p10(f4(f9(X5)),f4(X5))
| ~ p11(X5) ),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_68,negated_conjecture,
! [X20] :
( p3(f4(X20),f6(f8(X20)))
| ~ p11(X20) ),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_69,negated_conjecture,
! [X5] :
( p10(f6(f7(c13)),f4(X5))
| ~ p11(X5) ),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_70,negated_conjecture,
! [X21] :
( p10(f6(f7(c13)),f4(X21))
| ~ p11(X21) ),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_71,negated_conjecture,
! [X7,X8] :
( p11(X8)
| ~ p11(X7)
| ~ p2(X7,X8) ),
inference(variable_rename,[status(thm)],[c_0_44]) ).
fof(c_0_72,negated_conjecture,
p3(f4(c16),f6(c15)),
c_0_45 ).
fof(c_0_73,negated_conjecture,
p3(f4(c17),f6(c18)),
c_0_46 ).
fof(c_0_74,negated_conjecture,
! [X5] :
( p11(f9(X5))
| ~ p11(X5) ),
inference(variable_rename,[status(thm)],[c_0_47]) ).
fof(c_0_75,negated_conjecture,
! [X4] : p3(X4,X4),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_76,negated_conjecture,
! [X3] : p2(X3,X3),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_77,negated_conjecture,
! [X2] : p5(X2,X2),
inference(variable_rename,[status(thm)],[c_0_50]) ).
fof(c_0_78,negated_conjecture,
p11(c16),
c_0_51 ).
fof(c_0_79,negated_conjecture,
p11(c17),
c_0_52 ).
fof(c_0_80,negated_conjecture,
p11(c14),
c_0_53 ).
cnf(c_0_81,negated_conjecture,
( p12(X4,X3)
| ~ p12(X1,X2)
| ~ p5(X2,X3)
| ~ p5(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_82,negated_conjecture,
( p10(X4,X3)
| ~ p10(X1,X2)
| ~ p3(X2,X3)
| ~ p3(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_83,negated_conjecture,
( ~ p3(f4(X1),f6(X2))
| ~ p12(X2,c15)
| ~ p11(X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_84,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_85,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_86,negated_conjecture,
( p5(X3,X2)
| ~ p5(X1,X2)
| ~ p5(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_87,negated_conjecture,
( p12(X1,X2)
| ~ p10(f6(X1),f6(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_88,negated_conjecture,
( p5(f7(X1),f7(X2))
| ~ p5(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_89,negated_conjecture,
( p3(f6(X1),f6(X2))
| ~ p5(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_90,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_91,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_92,negated_conjecture,
( p10(f6(X1),f6(X2))
| ~ p12(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_93,negated_conjecture,
( p5(f8(X1),f8(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_94,negated_conjecture,
( p10(f4(f9(X1)),f4(X1))
| ~ p11(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_95,negated_conjecture,
( p3(f4(X1),f6(f8(X1)))
| ~ p11(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_96,negated_conjecture,
( p10(f6(f7(c13)),f4(X1))
| ~ p11(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_97,negated_conjecture,
( p10(f6(f7(c13)),f4(X1))
| ~ p11(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_98,negated_conjecture,
( p11(X2)
| ~ p2(X1,X2)
| ~ p11(X1) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_99,negated_conjecture,
p3(f4(c16),f6(c15)),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_100,negated_conjecture,
p3(f4(c17),f6(c18)),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_101,negated_conjecture,
( p11(f9(X1))
| ~ p11(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_102,negated_conjecture,
p3(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_103,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_104,negated_conjecture,
p5(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_105,negated_conjecture,
p11(c16),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_106,negated_conjecture,
p11(c17),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_107,negated_conjecture,
p11(c14),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_108,negated_conjecture,
( p12(X4,X3)
| ~ p12(X1,X2)
| ~ p5(X2,X3)
| ~ p5(X1,X4) ),
c_0_81,
[final] ).
cnf(c_0_109,negated_conjecture,
( p10(X4,X3)
| ~ p10(X1,X2)
| ~ p3(X2,X3)
| ~ p3(X1,X4) ),
c_0_82,
[final] ).
cnf(c_0_110,negated_conjecture,
( ~ p3(f4(X1),f6(X2))
| ~ p12(X2,c15)
| ~ p11(X1) ),
c_0_83,
[final] ).
cnf(c_0_111,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
c_0_84,
[final] ).
cnf(c_0_112,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_85,
[final] ).
cnf(c_0_113,negated_conjecture,
( p5(X3,X2)
| ~ p5(X1,X2)
| ~ p5(X1,X3) ),
c_0_86,
[final] ).
cnf(c_0_114,negated_conjecture,
( p12(X1,X2)
| ~ p10(f6(X1),f6(X2)) ),
c_0_87,
[final] ).
cnf(c_0_115,negated_conjecture,
( p5(f7(X1),f7(X2))
| ~ p5(X1,X2) ),
c_0_88,
[final] ).
cnf(c_0_116,negated_conjecture,
( p3(f6(X1),f6(X2))
| ~ p5(X1,X2) ),
c_0_89,
[final] ).
cnf(c_0_117,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_90,
[final] ).
cnf(c_0_118,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p2(X1,X2) ),
c_0_91,
[final] ).
cnf(c_0_119,negated_conjecture,
( p10(f6(X1),f6(X2))
| ~ p12(X1,X2) ),
c_0_92,
[final] ).
cnf(c_0_120,negated_conjecture,
( p5(f8(X1),f8(X2))
| ~ p2(X1,X2) ),
c_0_93,
[final] ).
cnf(c_0_121,negated_conjecture,
( p10(f4(f9(X1)),f4(X1))
| ~ p11(X1) ),
c_0_94,
[final] ).
cnf(c_0_122,negated_conjecture,
( p3(f4(X1),f6(f8(X1)))
| ~ p11(X1) ),
c_0_95,
[final] ).
cnf(c_0_123,negated_conjecture,
( p10(f6(f7(c13)),f4(X1))
| ~ p11(X1) ),
c_0_96,
[final] ).
cnf(c_0_124,negated_conjecture,
( p10(f6(f7(c13)),f4(X1))
| ~ p11(X1) ),
c_0_97,
[final] ).
cnf(c_0_125,negated_conjecture,
( p11(X2)
| ~ p2(X1,X2)
| ~ p11(X1) ),
c_0_98,
[final] ).
cnf(c_0_126,negated_conjecture,
p3(f4(c16),f6(c15)),
c_0_99,
[final] ).
cnf(c_0_127,negated_conjecture,
p3(f4(c17),f6(c18)),
c_0_100,
[final] ).
cnf(c_0_128,negated_conjecture,
( p11(f9(X1))
| ~ p11(X1) ),
c_0_101,
[final] ).
cnf(c_0_129,negated_conjecture,
p3(X1,X1),
c_0_102,
[final] ).
cnf(c_0_130,negated_conjecture,
p2(X1,X1),
c_0_103,
[final] ).
cnf(c_0_131,negated_conjecture,
p5(X1,X1),
c_0_104,
[final] ).
cnf(c_0_132,negated_conjecture,
p11(c16),
c_0_105,
[final] ).
cnf(c_0_133,negated_conjecture,
p11(c17),
c_0_106,
[final] ).
cnf(c_0_134,negated_conjecture,
p11(c14),
c_0_107,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_111) ).
cnf(c_48,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_153,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_198,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_153]) ).
cnf(c_205,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_198]) ).
cnf(c_260,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_205]) ).
cnf(c_19,negated_conjecture,
p3(f4(c16),f6(c15)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_126) ).
cnf(c_80,negated_conjecture,
p3(f4(c16),f6(c15)),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_168,negated_conjecture,
p3(f4(c16),f6(c15)),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_183,negated_conjecture,
p3(f4(c16),f6(c15)),
inference(copy,[status(esa)],[c_168]) ).
cnf(c_220,negated_conjecture,
p3(f4(c16),f6(c15)),
inference(copy,[status(esa)],[c_183]) ).
cnf(c_290,plain,
p3(f4(c16),f6(c15)),
inference(copy,[status(esa)],[c_220]) ).
cnf(c_390,plain,
( ~ p3(f4(c16),X0)
| p3(X0,f6(c15)) ),
inference(resolution,[status(thm)],[c_260,c_290]) ).
cnf(c_391,plain,
( ~ p3(f4(c16),X0)
| p3(X0,f6(c15)) ),
inference(rewriting,[status(thm)],[c_390]) ).
cnf(c_14,negated_conjecture,
( p3(f4(X0),f6(f8(X0)))
| ~ p11(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_122) ).
cnf(c_70,negated_conjecture,
( p3(f4(X0),f6(f8(X0)))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_164,negated_conjecture,
( p3(f4(X0),f6(f8(X0)))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_187,negated_conjecture,
( p3(f4(X0),f6(f8(X0)))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_164]) ).
cnf(c_216,negated_conjecture,
( p3(f4(X0),f6(f8(X0)))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_187]) ).
cnf(c_282,negated_conjecture,
( p3(f4(X0),f6(f8(X0)))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_216]) ).
cnf(c_534,plain,
( p3(f6(f8(c16)),f6(c15))
| ~ p11(c16) ),
inference(resolution,[status(thm)],[c_391,c_282]) ).
cnf(c_535,plain,
( p3(f6(f8(c16)),f6(c15))
| ~ p11(c16) ),
inference(rewriting,[status(thm)],[c_534]) ).
cnf(c_24,negated_conjecture,
p11(c16),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_132) ).
cnf(c_90,negated_conjecture,
p11(c16),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_173,negated_conjecture,
p11(c16),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_178,negated_conjecture,
p11(c16),
inference(copy,[status(esa)],[c_173]) ).
cnf(c_225,negated_conjecture,
p11(c16),
inference(copy,[status(esa)],[c_178]) ).
cnf(c_300,negated_conjecture,
p11(c16),
inference(copy,[status(esa)],[c_225]) ).
cnf(c_734,plain,
p3(f6(f8(c16)),f6(c15)),
inference(forward_subsumption_resolution,[status(thm)],[c_535,c_300]) ).
cnf(c_735,plain,
p3(f6(f8(c16)),f6(c15)),
inference(rewriting,[status(thm)],[c_734]) ).
cnf(c_1,negated_conjecture,
( ~ p10(X0,X1)
| p10(X2,X3)
| ~ p3(X0,X2)
| ~ p3(X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_109) ).
cnf(c_44,negated_conjecture,
( ~ p10(X0,X1)
| p10(X2,X3)
| ~ p3(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_151,negated_conjecture,
( ~ p10(X0,X1)
| p10(X2,X3)
| ~ p3(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_200,negated_conjecture,
( ~ p10(X0,X1)
| p10(X2,X3)
| ~ p3(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_151]) ).
cnf(c_203,negated_conjecture,
( ~ p10(X0,X1)
| p10(X2,X3)
| ~ p3(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_200]) ).
cnf(c_256,negated_conjecture,
( ~ p10(X0,X1)
| p10(X2,X3)
| ~ p3(X0,X2)
| ~ p3(X1,X3) ),
inference(copy,[status(esa)],[c_203]) ).
cnf(c_741,plain,
( p10(X0,f6(c15))
| ~ p10(X1,f6(f8(c16)))
| ~ p3(X1,X0) ),
inference(resolution,[status(thm)],[c_735,c_256]) ).
cnf(c_742,plain,
( p10(X0,f6(c15))
| ~ p10(X1,f6(f8(c16)))
| ~ p3(X1,X0) ),
inference(rewriting,[status(thm)],[c_741]) ).
cnf(c_2292,plain,
( ~ p10(f4(X0),f6(f8(c16)))
| p10(f6(f8(X0)),f6(c15))
| ~ p11(X0) ),
inference(resolution,[status(thm)],[c_742,c_282]) ).
cnf(c_2293,plain,
( ~ p10(f4(X0),f6(f8(c16)))
| p10(f6(f8(X0)),f6(c15))
| ~ p11(X0) ),
inference(rewriting,[status(thm)],[c_2292]) ).
cnf(c_6,negated_conjecture,
( p12(X0,X1)
| ~ p10(f6(X0),f6(X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_114) ).
cnf(c_54,negated_conjecture,
( p12(X0,X1)
| ~ p10(f6(X0),f6(X1)) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_156,negated_conjecture,
( p12(X0,X1)
| ~ p10(f6(X0),f6(X1)) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_195,negated_conjecture,
( p12(X0,X1)
| ~ p10(f6(X0),f6(X1)) ),
inference(copy,[status(esa)],[c_156]) ).
cnf(c_208,negated_conjecture,
( p12(X0,X1)
| ~ p10(f6(X0),f6(X1)) ),
inference(copy,[status(esa)],[c_195]) ).
cnf(c_266,negated_conjecture,
( p12(X0,X1)
| ~ p10(f6(X0),f6(X1)) ),
inference(copy,[status(esa)],[c_208]) ).
cnf(c_4482,plain,
( p12(f8(X0),c15)
| ~ p10(f4(X0),f6(f8(c16)))
| ~ p11(X0) ),
inference(resolution,[status(thm)],[c_2293,c_266]) ).
cnf(c_4483,plain,
( p12(f8(X0),c15)
| ~ p10(f4(X0),f6(f8(c16)))
| ~ p11(X0) ),
inference(rewriting,[status(thm)],[c_4482]) ).
cnf(c_2,negated_conjecture,
( ~ p12(X0,c15)
| ~ p3(f4(X1),f6(X0))
| ~ p11(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_110) ).
cnf(c_46,negated_conjecture,
( ~ p12(X0,c15)
| ~ p3(f4(X1),f6(X0))
| ~ p11(X1) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_152,negated_conjecture,
( ~ p12(X0,c15)
| ~ p3(f4(X1),f6(X0))
| ~ p11(X1) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_199,negated_conjecture,
( ~ p12(X0,c15)
| ~ p3(f4(X1),f6(X0))
| ~ p11(X1) ),
inference(copy,[status(esa)],[c_152]) ).
cnf(c_204,negated_conjecture,
( ~ p12(X0,c15)
| ~ p3(f4(X1),f6(X0))
| ~ p11(X1) ),
inference(copy,[status(esa)],[c_199]) ).
cnf(c_258,negated_conjecture,
( ~ p12(X0,c15)
| ~ p3(f4(X1),f6(X0))
| ~ p11(X1) ),
inference(copy,[status(esa)],[c_204]) ).
cnf(c_424,plain,
( ~ p12(f8(X0),c15)
| ~ p11(X0) ),
inference(resolution,[status(thm)],[c_258,c_282]) ).
cnf(c_425,plain,
( ~ p12(f8(X0),c15)
| ~ p11(X0) ),
inference(rewriting,[status(thm)],[c_424]) ).
cnf(c_4509,plain,
( ~ p10(f4(X0),f6(f8(c16)))
| ~ p11(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4483,c_425]) ).
cnf(c_4510,plain,
( ~ p10(f4(X0),f6(f8(c16)))
| ~ p11(X0) ),
inference(rewriting,[status(thm)],[c_4509]) ).
cnf(c_456,plain,
( ~ p10(X0,f4(X1))
| p10(X2,f6(f8(X1)))
| ~ p3(X0,X2)
| ~ p11(X1) ),
inference(resolution,[status(thm)],[c_256,c_282]) ).
cnf(c_457,plain,
( ~ p10(X0,f4(X1))
| p10(X2,f6(f8(X1)))
| ~ p3(X0,X2)
| ~ p11(X1) ),
inference(rewriting,[status(thm)],[c_456]) ).
cnf(c_21,negated_conjecture,
p3(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_129) ).
cnf(c_84,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_170,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_181,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_170]) ).
cnf(c_222,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_181]) ).
cnf(c_294,plain,
p3(X0,X0),
inference(copy,[status(esa)],[c_222]) ).
cnf(c_1484,plain,
( ~ p10(X0,f4(X1))
| p10(X0,f6(f8(X1)))
| ~ p11(X1) ),
inference(resolution,[status(thm)],[c_457,c_294]) ).
cnf(c_1485,plain,
( ~ p10(X0,f4(X1))
| p10(X0,f6(f8(X1)))
| ~ p11(X1) ),
inference(rewriting,[status(thm)],[c_1484]) ).
cnf(c_4513,plain,
( ~ p10(f4(X0),f4(c16))
| ~ p11(c16)
| ~ p11(X0) ),
inference(resolution,[status(thm)],[c_4510,c_1485]) ).
cnf(c_4514,plain,
( ~ p10(f4(X0),f4(c16))
| ~ p11(c16)
| ~ p11(X0) ),
inference(rewriting,[status(thm)],[c_4513]) ).
cnf(c_9044,plain,
( ~ p10(f4(X0),f4(c16))
| ~ p11(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4514,c_300]) ).
cnf(c_9045,plain,
( ~ p10(f4(X0),f4(c16))
| ~ p11(X0) ),
inference(rewriting,[status(thm)],[c_9044]) ).
cnf(c_13,negated_conjecture,
( p10(f4(f9(X0)),f4(X0))
| ~ p11(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_121) ).
cnf(c_68,negated_conjecture,
( p10(f4(f9(X0)),f4(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_163,negated_conjecture,
( p10(f4(f9(X0)),f4(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_188,negated_conjecture,
( p10(f4(f9(X0)),f4(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_163]) ).
cnf(c_215,negated_conjecture,
( p10(f4(f9(X0)),f4(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_188]) ).
cnf(c_280,negated_conjecture,
( p10(f4(f9(X0)),f4(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_215]) ).
cnf(c_9048,plain,
( ~ p11(f9(c16))
| ~ p11(c16) ),
inference(resolution,[status(thm)],[c_9045,c_280]) ).
cnf(c_9049,plain,
( ~ p11(f9(c16))
| ~ p11(c16) ),
inference(rewriting,[status(thm)],[c_9048]) ).
cnf(c_18,negated_conjecture,
( p11(f9(X0))
| ~ p11(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p',c_0_128) ).
cnf(c_78,negated_conjecture,
( p11(f9(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_167,negated_conjecture,
( p11(f9(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_184,negated_conjecture,
( p11(f9(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_167]) ).
cnf(c_219,negated_conjecture,
( p11(f9(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_184]) ).
cnf(c_288,negated_conjecture,
( p11(f9(X0))
| ~ p11(X0) ),
inference(copy,[status(esa)],[c_219]) ).
cnf(c_9052,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9049,c_300,c_288]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN590-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n014.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:34:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.39 % Orientation found
% 0.12/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_18cb5a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_e091cc.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_2d674b | grep -v "SZS"
% 0.19/0.41
% 0.19/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ iProver source info
% 0.19/0.41
% 0.19/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.41 % git: non_committed_changes: true
% 0.19/0.41 % git: last_make_outside_of_git: true
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ Input Options
% 0.19/0.41
% 0.19/0.41 % --out_options all
% 0.19/0.41 % --tptp_safe_out true
% 0.19/0.41 % --problem_path ""
% 0.19/0.41 % --include_path ""
% 0.19/0.41 % --clausifier .//eprover
% 0.19/0.41 % --clausifier_options --tstp-format
% 0.19/0.41 % --stdin false
% 0.19/0.41 % --dbg_backtrace false
% 0.19/0.41 % --dbg_dump_prop_clauses false
% 0.19/0.41 % --dbg_dump_prop_clauses_file -
% 0.19/0.41 % --dbg_out_stat false
% 0.19/0.41
% 0.19/0.41 % ------ General Options
% 0.19/0.41
% 0.19/0.41 % --fof false
% 0.19/0.41 % --time_out_real 150.
% 0.19/0.41 % --time_out_prep_mult 0.2
% 0.19/0.41 % --time_out_virtual -1.
% 0.19/0.41 % --schedule none
% 0.19/0.41 % --ground_splitting input
% 0.19/0.41 % --splitting_nvd 16
% 0.19/0.41 % --non_eq_to_eq false
% 0.19/0.41 % --prep_gs_sim true
% 0.19/0.41 % --prep_unflatten false
% 0.19/0.41 % --prep_res_sim true
% 0.19/0.41 % --prep_upred true
% 0.19/0.41 % --res_sim_input true
% 0.19/0.41 % --clause_weak_htbl true
% 0.19/0.41 % --gc_record_bc_elim false
% 0.19/0.41 % --symbol_type_check false
% 0.19/0.41 % --clausify_out false
% 0.19/0.41 % --large_theory_mode false
% 0.19/0.41 % --prep_sem_filter none
% 0.19/0.41 % --prep_sem_filter_out false
% 0.19/0.41 % --preprocessed_out false
% 0.19/0.41 % --sub_typing false
% 0.19/0.41 % --brand_transform false
% 0.19/0.41 % --pure_diseq_elim true
% 0.19/0.41 % --min_unsat_core false
% 0.19/0.41 % --pred_elim true
% 0.19/0.41 % --add_important_lit false
% 0.19/0.41 % --soft_assumptions false
% 0.19/0.41 % --reset_solvers false
% 0.19/0.41 % --bc_imp_inh []
% 0.19/0.41 % --conj_cone_tolerance 1.5
% 0.19/0.41 % --prolific_symb_bound 500
% 0.19/0.41 % --lt_threshold 2000
% 0.19/0.41
% 0.19/0.41 % ------ SAT Options
% 0.19/0.41
% 0.19/0.41 % --sat_mode false
% 0.19/0.41 % --sat_fm_restart_options ""
% 0.19/0.41 % --sat_gr_def false
% 0.19/0.41 % --sat_epr_types true
% 0.19/0.41 % --sat_non_cyclic_types false
% 0.19/0.41 % --sat_finite_models false
% 0.19/0.41 % --sat_fm_lemmas false
% 0.19/0.41 % --sat_fm_prep false
% 0.19/0.41 % --sat_fm_uc_incr true
% 0.19/0.41 % --sat_out_model small
% 0.19/0.41 % --sat_out_clauses false
% 0.19/0.41
% 0.19/0.41 % ------ QBF Options
% 0.19/0.41
% 0.19/0.41 % --qbf_mode false
% 0.19/0.41 % --qbf_elim_univ true
% 0.19/0.41 % --qbf_sk_in true
% 0.19/0.41 % --qbf_pred_elim true
% 0.19/0.41 % --qbf_split 32
% 0.19/0.41
% 0.19/0.41 % ------ BMC1 Options
% 0.19/0.41
% 0.19/0.41 % --bmc1_incremental false
% 0.19/0.41 % --bmc1_axioms reachable_all
% 0.19/0.41 % --bmc1_min_bound 0
% 0.19/0.41 % --bmc1_max_bound -1
% 0.19/0.41 % --bmc1_max_bound_default -1
% 0.19/0.41 % --bmc1_symbol_reachability true
% 0.19/0.41 % --bmc1_property_lemmas false
% 0.19/0.41 % --bmc1_k_induction false
% 0.19/0.41 % --bmc1_non_equiv_states false
% 0.19/0.41 % --bmc1_deadlock false
% 0.19/0.41 % --bmc1_ucm false
% 0.19/0.41 % --bmc1_add_unsat_core none
% 0.19/0.41 % --bmc1_unsat_core_children false
% 0.19/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.41 % --bmc1_out_stat full
% 0.19/0.41 % --bmc1_ground_init false
% 0.19/0.41 % --bmc1_pre_inst_next_state false
% 0.19/0.41 % --bmc1_pre_inst_state false
% 0.19/0.41 % --bmc1_pre_inst_reach_state false
% 0.19/0.41 % --bmc1_out_unsat_core false
% 0.19/0.41 % --bmc1_aig_witness_out false
% 0.19/0.41 % --bmc1_verbose false
% 0.19/0.41 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_18cb5a.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42 % ------ Parsing...% successful
% 0.19/0.42
% 0.19/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.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 % ------ Problem Properties
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % EPR false
% 0.19/0.42 % Horn true
% 0.19/0.42 % Has equality false
% 0.19/0.42
% 0.19/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % % ------ Current options:
% 0.19/0.42
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.57 % --inst_prop_sim_new false
% 0.19/0.57 % --inst_orphan_elimination true
% 0.19/0.57 % --inst_learning_loop_flag true
% 0.19/0.57 % --inst_learning_start 3000
% 0.19/0.57 % --inst_learning_factor 2
% 0.19/0.57 % --inst_start_prop_sim_after_learn 3
% 0.19/0.57 % --inst_sel_renew solver
% 0.19/0.57 % --inst_lit_activity_flag true
% 0.19/0.57 % --inst_out_proof true
% 0.19/0.57
% 0.19/0.57 % ------ Resolution Options
% 0.19/0.57
% 0.19/0.57 % --resolution_flag true
% 0.19/0.57 % --res_lit_sel kbo_max
% 0.19/0.57 % --res_to_prop_solver none
% 0.19/0.57 % --res_prop_simpl_new false
% 0.19/0.57 % --res_prop_simpl_given false
% 0.19/0.57 % --res_passive_queue_type priority_queues
% 0.19/0.57 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.57 % --res_passive_queues_freq [15;5]
% 0.19/0.57 % --res_forward_subs full
% 0.19/0.57 % --res_backward_subs full
% 0.19/0.57 % --res_forward_subs_resolution true
% 0.19/0.57 % --res_backward_subs_resolution true
% 0.19/0.57 % --res_orphan_elimination false
% 0.19/0.57 % --res_time_limit 1000.
% 0.19/0.57 % --res_out_proof true
% 0.19/0.57 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_18cb5a.s
% 0.19/0.57 % --modulo true
% 0.19/0.57
% 0.19/0.57 % ------ Combination Options
% 0.19/0.57
% 0.19/0.57 % --comb_res_mult 1000
% 0.19/0.57 % --comb_inst_mult 300
% 0.19/0.57 % ------
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57 % ------ Proving...
% 0.19/0.57 %
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57 % Resolution empty clause
% 0.19/0.57
% 0.19/0.57 % ------ Statistics
% 0.19/0.57
% 0.19/0.57 % ------ General
% 0.19/0.57
% 0.19/0.57 % num_of_input_clauses: 27
% 0.19/0.57 % num_of_input_neg_conjectures: 27
% 0.19/0.57 % num_of_splits: 0
% 0.19/0.57 % num_of_split_atoms: 0
% 0.19/0.57 % num_of_sem_filtered_clauses: 0
% 0.19/0.57 % num_of_subtypes: 0
% 0.19/0.57 % monotx_restored_types: 0
% 0.19/0.57 % sat_num_of_epr_types: 0
% 0.19/0.57 % sat_num_of_non_cyclic_types: 0
% 0.19/0.57 % sat_guarded_non_collapsed_types: 0
% 0.19/0.57 % is_epr: 0
% 0.19/0.57 % is_horn: 1
% 0.19/0.57 % has_eq: 0
% 0.19/0.57 % num_pure_diseq_elim: 0
% 0.19/0.57 % simp_replaced_by: 0
% 0.19/0.57 % res_preprocessed: 54
% 0.19/0.57 % prep_upred: 0
% 0.19/0.57 % prep_unflattend: 0
% 0.19/0.57 % pred_elim_cands: 0
% 0.19/0.57 % pred_elim: 0
% 0.19/0.57 % pred_elim_cl: 0
% 0.19/0.57 % pred_elim_cycles: 0
% 0.19/0.57 % forced_gc_time: 0
% 0.19/0.57 % gc_basic_clause_elim: 0
% 0.19/0.57 % parsing_time: 0.
% 0.19/0.57 % sem_filter_time: 0.
% 0.19/0.57 % pred_elim_time: 0.
% 0.19/0.57 % out_proof_time: 0.001
% 0.19/0.57 % monotx_time: 0.
% 0.19/0.57 % subtype_inf_time: 0.
% 0.19/0.57 % unif_index_cands_time: 0.001
% 0.19/0.57 % unif_index_add_time: 0.
% 0.19/0.57 % total_time: 0.167
% 0.19/0.57 % num_of_symbols: 42
% 0.19/0.57 % num_of_terms: 1806
% 0.19/0.57
% 0.19/0.57 % ------ Propositional Solver
% 0.19/0.57
% 0.19/0.57 % prop_solver_calls: 1
% 0.19/0.57 % prop_fast_solver_calls: 163
% 0.19/0.57 % prop_num_of_clauses: 41
% 0.19/0.57 % prop_preprocess_simplified: 441
% 0.19/0.57 % prop_fo_subsumed: 0
% 0.19/0.57 % prop_solver_time: 0.
% 0.19/0.57 % prop_fast_solver_time: 0.
% 0.19/0.57 % prop_unsat_core_time: 0.
% 0.19/0.57
% 0.19/0.57 % ------ QBF
% 0.19/0.57
% 0.19/0.57 % qbf_q_res: 0
% 0.19/0.57 % qbf_num_tautologies: 0
% 0.19/0.57 % qbf_prep_cycles: 0
% 0.19/0.57
% 0.19/0.57 % ------ BMC1
% 0.19/0.57
% 0.19/0.57 % bmc1_current_bound: -1
% 0.19/0.57 % bmc1_last_solved_bound: -1
% 0.19/0.57 % bmc1_unsat_core_size: -1
% 0.19/0.57 % bmc1_unsat_core_parents_size: -1
% 0.19/0.57 % bmc1_merge_next_fun: 0
% 0.19/0.57 % bmc1_unsat_core_clauses_time: 0.
% 0.19/0.57
% 0.19/0.57 % ------ Instantiation
% 0.19/0.57
% 0.19/0.57 % inst_num_of_clauses: 26
% 0.19/0.57 % inst_num_in_passive: 0
% 0.19/0.57 % inst_num_in_active: 0
% 0.19/0.57 % inst_num_in_unprocessed: 26
% 0.19/0.57 % inst_num_of_loops: 0
% 0.19/0.57 % inst_num_of_learning_restarts: 0
% 0.19/0.57 % inst_num_moves_active_passive: 0
% 0.19/0.57 % inst_lit_activity: 0
% 0.19/0.57 % inst_lit_activity_moves: 0
% 0.19/0.57 % inst_num_tautologies: 0
% 0.19/0.57 % inst_num_prop_implied: 0
% 0.19/0.57 % inst_num_existing_simplified: 0
% 0.19/0.57 % inst_num_eq_res_simplified: 0
% 0.19/0.57 % inst_num_child_elim: 0
% 0.19/0.57 % inst_num_of_dismatching_blockings: 0
% 0.19/0.57 % inst_num_of_non_proper_insts: 0
% 0.19/0.57 % inst_num_of_duplicates: 0
% 0.19/0.57 % inst_inst_num_from_inst_to_res: 0
% 0.19/0.57 % inst_dismatching_checking_time: 0.
% 0.19/0.57
% 0.19/0.57 % ------ Resolution
% 0.19/0.57
% 0.19/0.57 % res_num_of_clauses: 2547
% 0.19/0.57 % res_num_in_passive: 2199
% 0.19/0.57 % res_num_in_active: 377
% 0.19/0.57 % res_num_of_loops: 477
% 0.19/0.57 % res_forward_subset_subsumed: 621
% 0.19/0.57 % res_backward_subset_subsumed: 36
% 0.19/0.57 % res_forward_subsumed: 92
% 0.19/0.57 % res_backward_subsumed: 4
% 0.19/0.57 % res_forward_subsumption_resolution: 16
% 0.19/0.57 % res_backward_subsumption_resolution: 0
% 0.19/0.57 % res_clause_to_clause_subsumption: 2587
% 0.19/0.57 % res_orphan_elimination: 0
% 0.19/0.57 % res_tautology_del: 42
% 0.19/0.57 % res_num_eq_res_simplified: 0
% 0.19/0.57 % res_num_sel_changes: 0
% 0.19/0.57 % res_moves_from_active_to_pass: 0
% 0.19/0.57
% 0.19/0.57 % Status Unsatisfiable
% 0.19/0.57 % SZS status Unsatisfiable
% 0.19/0.57 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------