TSTP Solution File: SYN573-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN573-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.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:03 EDT 2022
% Result : Unsatisfiable 2.75s 2.96s
% Output : CNFRefutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 29
% Syntax : Number of formulae : 168 ( 52 unt; 0 def)
% Number of atoms : 368 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 391 ( 191 ~; 200 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 314 ( 18 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,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
file('<stdin>',not_p11_19) ).
fof(c_0_1,negated_conjecture,
! [X37,X38,X39] :
( p11(X39,f3(f8(X38),f3(f8(X37),f5(f6(f7(c14))))))
| ~ p11(X39,X38) ),
file('<stdin>',p11_21) ).
fof(c_0_2,negated_conjecture,
! [X23,X24] : p11(X24,f3(f8(X23),f3(f8(X24),f5(f6(f7(c14)))))),
file('<stdin>',p11_16) ).
fof(c_0_3,negated_conjecture,
! [X33,X34,X35,X36] :
( p2(f3(X36,X35),f3(X34,X33))
| ~ p2(X36,X34)
| ~ p2(X35,X33) ),
file('<stdin>',p2_20) ).
fof(c_0_4,negated_conjecture,
! [X29,X30,X31,X32] :
( p13(X32,X31)
| ~ p4(X30,X32)
| ~ p4(X29,X31)
| ~ p13(X30,X29) ),
file('<stdin>',p13_18) ).
fof(c_0_5,negated_conjecture,
! [X25,X26,X27,X28] :
( p11(X28,X27)
| ~ p2(X26,X28)
| ~ p2(X25,X27)
| ~ p11(X26,X25) ),
file('<stdin>',p11_17) ).
fof(c_0_6,negated_conjecture,
! [X20,X21,X2] :
( p2(X21,X20)
| ~ p2(X2,X21)
| ~ p2(X2,X20) ),
file('<stdin>',p2_13) ).
fof(c_0_7,negated_conjecture,
! [X18,X19,X1] :
( p4(X19,X18)
| ~ p4(X1,X19)
| ~ p4(X1,X18) ),
file('<stdin>',p4_12) ).
fof(c_0_8,negated_conjecture,
! [X16,X17] :
( p4(f6(X17),f6(X16))
| ~ p4(X17,X16) ),
file('<stdin>',p4_11) ).
fof(c_0_9,negated_conjecture,
! [X14,X15] :
( p4(f10(X15),f10(X14))
| ~ p2(X15,X14) ),
file('<stdin>',p4_10) ).
fof(c_0_10,negated_conjecture,
! [X12,X13] :
( p2(f9(X13),f9(X12))
| ~ p4(X13,X12) ),
file('<stdin>',p2_9) ).
fof(c_0_11,negated_conjecture,
! [X10,X11] :
( p2(f8(X11),f8(X10))
| ~ p2(X11,X10) ),
file('<stdin>',p2_8) ).
fof(c_0_12,negated_conjecture,
! [X8,X9] :
( p2(f5(X9),f5(X8))
| ~ p4(X9,X8) ),
file('<stdin>',p2_7) ).
fof(c_0_13,negated_conjecture,
! [X6,X7] :
( p4(f7(X7),f7(X6))
| ~ p4(X7,X6) ),
file('<stdin>',p4_6) ).
fof(c_0_14,negated_conjecture,
! [X3] :
( p13(f10(X3),c17)
| p4(f10(X3),c17)
| ~ p12(X3) ),
file('<stdin>',p13_15) ).
fof(c_0_15,negated_conjecture,
! [X3] :
( p2(X3,f9(f10(X3)))
| ~ p12(X3) ),
file('<stdin>',p2_4) ).
fof(c_0_16,negated_conjecture,
! [X22] :
( p11(X22,c16)
| p2(X22,f9(c17))
| ~ p12(X22) ),
file('<stdin>',p11_14) ).
fof(c_0_17,negated_conjecture,
! [X4,X5] :
( p12(X5)
| ~ p12(X4)
| ~ p2(X4,X5) ),
file('<stdin>',p12_5) ).
fof(c_0_18,negated_conjecture,
! [X2] : p2(X2,X2),
file('<stdin>',p2_3) ).
fof(c_0_19,negated_conjecture,
! [X1] : p4(X1,X1),
file('<stdin>',p4_2) ).
fof(c_0_20,negated_conjecture,
p12(c15),
file('<stdin>',c15_is_p12_1) ).
fof(c_0_21,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_22,negated_conjecture,
! [X37,X38,X39] :
( p11(X39,f3(f8(X38),f3(f8(X37),f5(f6(f7(c14))))))
| ~ p11(X39,X38) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_23,negated_conjecture,
! [X23,X24] : p11(X24,f3(f8(X23),f3(f8(X24),f5(f6(f7(c14)))))),
c_0_2 ).
fof(c_0_24,negated_conjecture,
! [X33,X34,X35,X36] :
( p2(f3(X36,X35),f3(X34,X33))
| ~ p2(X36,X34)
| ~ p2(X35,X33) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_25,negated_conjecture,
! [X29,X30,X31,X32] :
( p13(X32,X31)
| ~ p4(X30,X32)
| ~ p4(X29,X31)
| ~ p13(X30,X29) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_26,negated_conjecture,
! [X25,X26,X27,X28] :
( p11(X28,X27)
| ~ p2(X26,X28)
| ~ p2(X25,X27)
| ~ p11(X26,X25) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_27,negated_conjecture,
! [X20,X21,X2] :
( p2(X21,X20)
| ~ p2(X2,X21)
| ~ p2(X2,X20) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_28,negated_conjecture,
! [X18,X19,X1] :
( p4(X19,X18)
| ~ p4(X1,X19)
| ~ p4(X1,X18) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_29,negated_conjecture,
! [X16,X17] :
( p4(f6(X17),f6(X16))
| ~ p4(X17,X16) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_30,negated_conjecture,
! [X14,X15] :
( p4(f10(X15),f10(X14))
| ~ p2(X15,X14) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_31,negated_conjecture,
! [X12,X13] :
( p2(f9(X13),f9(X12))
| ~ p4(X13,X12) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_32,negated_conjecture,
! [X10,X11] :
( p2(f8(X11),f8(X10))
| ~ p2(X11,X10) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_33,negated_conjecture,
! [X8,X9] :
( p2(f5(X9),f5(X8))
| ~ p4(X9,X8) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_34,negated_conjecture,
! [X6,X7] :
( p4(f7(X7),f7(X6))
| ~ p4(X7,X6) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_35,negated_conjecture,
! [X3] :
( p13(f10(X3),c17)
| p4(f10(X3),c17)
| ~ p12(X3) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_36,negated_conjecture,
! [X3] :
( p2(X3,f9(f10(X3)))
| ~ p12(X3) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_37,negated_conjecture,
! [X22] :
( p11(X22,c16)
| p2(X22,f9(c17))
| ~ p12(X22) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_38,negated_conjecture,
! [X4,X5] :
( p12(X5)
| ~ p12(X4)
| ~ p2(X4,X5) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_39,negated_conjecture,
! [X2] : p2(X2,X2),
c_0_18 ).
fof(c_0_40,negated_conjecture,
! [X1] : p4(X1,X1),
c_0_19 ).
fof(c_0_41,negated_conjecture,
p12(c15),
c_0_20 ).
fof(c_0_42,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
c_0_21 ).
fof(c_0_43,negated_conjecture,
! [X40,X41,X42] :
( p11(X42,f3(f8(X41),f3(f8(X40),f5(f6(f7(c14))))))
| ~ p11(X42,X41) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_44,negated_conjecture,
! [X25,X26] : p11(X26,f3(f8(X25),f3(f8(X26),f5(f6(f7(c14)))))),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_45,negated_conjecture,
! [X37,X38,X39,X40] :
( p2(f3(X40,X39),f3(X38,X37))
| ~ p2(X40,X38)
| ~ p2(X39,X37) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_46,negated_conjecture,
! [X33,X34,X35,X36] :
( p13(X36,X35)
| ~ p4(X34,X36)
| ~ p4(X33,X35)
| ~ p13(X34,X33) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_47,negated_conjecture,
! [X29,X30,X31,X32] :
( p11(X32,X31)
| ~ p2(X30,X32)
| ~ p2(X29,X31)
| ~ p11(X30,X29) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_48,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_27])])]) ).
fof(c_0_49,negated_conjecture,
! [X20,X21,X22] :
( p4(X21,X20)
| ~ p4(X22,X21)
| ~ p4(X22,X20) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_28])])]) ).
fof(c_0_50,negated_conjecture,
! [X18,X19] :
( p4(f6(X19),f6(X18))
| ~ p4(X19,X18) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_51,negated_conjecture,
! [X16,X17] :
( p4(f10(X17),f10(X16))
| ~ p2(X17,X16) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_52,negated_conjecture,
! [X14,X15] :
( p2(f9(X15),f9(X14))
| ~ p4(X15,X14) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_53,negated_conjecture,
! [X12,X13] :
( p2(f8(X13),f8(X12))
| ~ p2(X13,X12) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_54,negated_conjecture,
! [X10,X11] :
( p2(f5(X11),f5(X10))
| ~ p4(X11,X10) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_55,negated_conjecture,
! [X8,X9] :
( p4(f7(X9),f7(X8))
| ~ p4(X9,X8) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_56,negated_conjecture,
! [X4] :
( p13(f10(X4),c17)
| p4(f10(X4),c17)
| ~ p12(X4) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_57,negated_conjecture,
! [X4] :
( p2(X4,f9(f10(X4)))
| ~ p12(X4) ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_58,negated_conjecture,
! [X23] :
( p11(X23,c16)
| p2(X23,f9(c17))
| ~ p12(X23) ),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_59,negated_conjecture,
! [X6,X7] :
( p12(X7)
| ~ p12(X6)
| ~ p2(X6,X7) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_60,negated_conjecture,
! [X3] : p2(X3,X3),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_61,negated_conjecture,
! [X2] : p4(X2,X2),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_62,negated_conjecture,
p12(c15),
c_0_41 ).
cnf(c_0_63,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_64,negated_conjecture,
( p11(X1,f3(f8(X2),f3(f8(X3),f5(f6(f7(c14))))))
| ~ p11(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_65,negated_conjecture,
p11(X1,f3(f8(X2),f3(f8(X1),f5(f6(f7(c14)))))),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_66,negated_conjecture,
( p2(f3(X3,X1),f3(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_67,negated_conjecture,
( p13(X4,X3)
| ~ p13(X1,X2)
| ~ p4(X2,X3)
| ~ p4(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_68,negated_conjecture,
( p11(X4,X3)
| ~ p11(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_69,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_70,negated_conjecture,
( p4(X3,X2)
| ~ p4(X1,X2)
| ~ p4(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_71,negated_conjecture,
( p4(f6(X1),f6(X2))
| ~ p4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_72,negated_conjecture,
( p4(f10(X1),f10(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_73,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_74,negated_conjecture,
( p2(f8(X1),f8(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_75,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_76,negated_conjecture,
( p4(f7(X1),f7(X2))
| ~ p4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_77,negated_conjecture,
( p4(f10(X1),c17)
| p13(f10(X1),c17)
| ~ p12(X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_78,negated_conjecture,
( p2(X1,f9(f10(X1)))
| ~ p12(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_79,negated_conjecture,
( p2(X1,f9(c17))
| p11(X1,c16)
| ~ p12(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_80,negated_conjecture,
( p12(X2)
| ~ p2(X1,X2)
| ~ p12(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_81,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_82,negated_conjecture,
p4(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_83,negated_conjecture,
p12(c15),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_84,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
c_0_63,
[final] ).
cnf(c_0_85,negated_conjecture,
( p11(X1,f3(f8(X2),f3(f8(X3),f5(f6(f7(c14))))))
| ~ p11(X1,X2) ),
c_0_64,
[final] ).
cnf(c_0_86,negated_conjecture,
p11(X1,f3(f8(X2),f3(f8(X1),f5(f6(f7(c14)))))),
c_0_65,
[final] ).
cnf(c_0_87,negated_conjecture,
( p2(f3(X3,X1),f3(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_66,
[final] ).
cnf(c_0_88,negated_conjecture,
( p13(X4,X3)
| ~ p13(X1,X2)
| ~ p4(X2,X3)
| ~ p4(X1,X4) ),
c_0_67,
[final] ).
cnf(c_0_89,negated_conjecture,
( p11(X4,X3)
| ~ p11(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
c_0_68,
[final] ).
cnf(c_0_90,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_69,
[final] ).
cnf(c_0_91,negated_conjecture,
( p4(X3,X2)
| ~ p4(X1,X2)
| ~ p4(X1,X3) ),
c_0_70,
[final] ).
cnf(c_0_92,negated_conjecture,
( p4(f6(X1),f6(X2))
| ~ p4(X1,X2) ),
c_0_71,
[final] ).
cnf(c_0_93,negated_conjecture,
( p4(f10(X1),f10(X2))
| ~ p2(X1,X2) ),
c_0_72,
[final] ).
cnf(c_0_94,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p4(X1,X2) ),
c_0_73,
[final] ).
cnf(c_0_95,negated_conjecture,
( p2(f8(X1),f8(X2))
| ~ p2(X1,X2) ),
c_0_74,
[final] ).
cnf(c_0_96,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p4(X1,X2) ),
c_0_75,
[final] ).
cnf(c_0_97,negated_conjecture,
( p4(f7(X1),f7(X2))
| ~ p4(X1,X2) ),
c_0_76,
[final] ).
cnf(c_0_98,negated_conjecture,
( p4(f10(X1),c17)
| p13(f10(X1),c17)
| ~ p12(X1) ),
c_0_77,
[final] ).
cnf(c_0_99,negated_conjecture,
( p2(X1,f9(f10(X1)))
| ~ p12(X1) ),
c_0_78,
[final] ).
cnf(c_0_100,negated_conjecture,
( p2(X1,f9(c17))
| p11(X1,c16)
| ~ p12(X1) ),
c_0_79,
[final] ).
cnf(c_0_101,negated_conjecture,
( p12(X2)
| ~ p2(X1,X2)
| ~ p12(X1) ),
c_0_80,
[final] ).
cnf(c_0_102,negated_conjecture,
p2(X1,X1),
c_0_81,
[final] ).
cnf(c_0_103,negated_conjecture,
p4(X1,X1),
c_0_82,
[final] ).
cnf(c_0_104,negated_conjecture,
p12(c15),
c_0_83,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,negated_conjecture,
( ~ p11(X0,X1)
| p11(X2,X3)
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_bbf025.p',c_0_89) ).
cnf(c_40,negated_conjecture,
( ~ p11(X0,X1)
| p11(X2,X3)
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_121,negated_conjecture,
( ~ p11(X0,X1)
| p11(X2,X3)
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_156,negated_conjecture,
( ~ p11(X0,X1)
| p11(X2,X3)
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_163,negated_conjecture,
( ~ p11(X0,X1)
| p11(X2,X3)
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_156]) ).
cnf(c_208,negated_conjecture,
( ~ p11(X0,X1)
| p11(X2,X3)
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_163]) ).
cnf(c_18,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_bbf025.p',c_0_102) ).
cnf(c_70,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_136,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_141,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_178,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_141]) ).
cnf(c_238,plain,
p2(X0,X0),
inference(copy,[status(esa)],[c_178]) ).
cnf(c_394,plain,
( ~ p11(X0,X1)
| p11(X2,X1)
| ~ p2(X0,X2) ),
inference(resolution,[status(thm)],[c_208,c_238]) ).
cnf(c_395,plain,
( ~ p11(X0,X1)
| p11(X2,X1)
| ~ p2(X0,X2) ),
inference(rewriting,[status(thm)],[c_394]) ).
cnf(c_4,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_bbf025.p',c_0_90) ).
cnf(c_42,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_122,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_155,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_164,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_155]) ).
cnf(c_210,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_164]) ).
cnf(c_318,plain,
( ~ p2(X0,X1)
| p2(X1,X0) ),
inference(resolution,[status(thm)],[c_210,c_238]) ).
cnf(c_319,plain,
( ~ p2(X0,X1)
| p2(X1,X0) ),
inference(rewriting,[status(thm)],[c_318]) ).
cnf(c_14,negated_conjecture,
( p11(X0,c16)
| p2(X0,f9(c17))
| ~ p12(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_bbf025.p',c_0_100) ).
cnf(c_62,negated_conjecture,
( p11(X0,c16)
| p2(X0,f9(c17))
| ~ p12(X0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_132,negated_conjecture,
( p11(X0,c16)
| p2(X0,f9(c17))
| ~ p12(X0) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_145,negated_conjecture,
( p11(X0,c16)
| p2(X0,f9(c17))
| ~ p12(X0) ),
inference(copy,[status(esa)],[c_132]) ).
cnf(c_174,negated_conjecture,
( p11(X0,c16)
| p2(X0,f9(c17))
| ~ p12(X0) ),
inference(copy,[status(esa)],[c_145]) ).
cnf(c_230,plain,
( p11(X0,c16)
| p2(X0,f9(c17))
| ~ p12(X0) ),
inference(copy,[status(esa)],[c_174]) ).
cnf(c_422,plain,
( p11(X0,c16)
| p2(f9(c17),X0)
| ~ p12(X0) ),
inference(resolution,[status(thm)],[c_319,c_230]) ).
cnf(c_423,plain,
( p11(X0,c16)
| p2(f9(c17),X0)
| ~ p12(X0) ),
inference(rewriting,[status(thm)],[c_422]) ).
cnf(c_612,plain,
( ~ p11(f9(c17),X0)
| p11(X1,c16)
| p11(X1,X0)
| ~ p12(X1) ),
inference(resolution,[status(thm)],[c_395,c_423]) ).
cnf(c_613,plain,
( ~ p11(f9(c17),X0)
| p11(X1,c16)
| p11(X1,X0)
| ~ p12(X1) ),
inference(rewriting,[status(thm)],[c_612]) ).
cnf(c_17,negated_conjecture,
p11(X0,f3(f8(X1),f3(f8(X0),f5(f6(f7(c14)))))),
file('/export/starexec/sandbox/tmp/iprover_modulo_bbf025.p',c_0_86) ).
cnf(c_68,negated_conjecture,
p11(X0,f3(f8(X1),f3(f8(X0),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_135,negated_conjecture,
p11(X0,f3(f8(X1),f3(f8(X0),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_142,negated_conjecture,
p11(X0,f3(f8(X1),f3(f8(X0),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_135]) ).
cnf(c_177,negated_conjecture,
p11(X0,f3(f8(X1),f3(f8(X0),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_142]) ).
cnf(c_236,negated_conjecture,
p11(X0,f3(f8(X1),f3(f8(X0),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_177]) ).
cnf(c_42745,plain,
( p11(X0,f3(f8(X1),f3(f8(f9(c17)),f5(f6(f7(c14))))))
| p11(X0,c16)
| ~ p12(X0) ),
inference(resolution,[status(thm)],[c_613,c_236]) ).
cnf(c_42746,plain,
( p11(X0,f3(f8(X1),f3(f8(f9(c17)),f5(f6(f7(c14))))))
| p11(X0,c16)
| ~ p12(X0) ),
inference(rewriting,[status(thm)],[c_42745]) ).
cnf(c_16,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
file('/export/starexec/sandbox/tmp/iprover_modulo_bbf025.p',c_0_84) ).
cnf(c_66,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_134,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_143,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_134]) ).
cnf(c_176,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_143]) ).
cnf(c_234,negated_conjecture,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
inference(copy,[status(esa)],[c_176]) ).
cnf(c_114404,plain,
( p11(c15,c16)
| ~ p12(c15) ),
inference(resolution,[status(thm)],[c_42746,c_234]) ).
cnf(c_114405,plain,
( p11(c15,c16)
| ~ p12(c15) ),
inference(rewriting,[status(thm)],[c_114404]) ).
cnf(c_20,negated_conjecture,
p12(c15),
file('/export/starexec/sandbox/tmp/iprover_modulo_bbf025.p',c_0_104) ).
cnf(c_74,negated_conjecture,
p12(c15),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_138,negated_conjecture,
p12(c15),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_139,negated_conjecture,
p12(c15),
inference(copy,[status(esa)],[c_138]) ).
cnf(c_180,negated_conjecture,
p12(c15),
inference(copy,[status(esa)],[c_139]) ).
cnf(c_242,negated_conjecture,
p12(c15),
inference(copy,[status(esa)],[c_180]) ).
cnf(c_0,negated_conjecture,
( p11(X0,f3(f8(X1),f3(f8(X2),f5(f6(f7(c14))))))
| ~ p11(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_bbf025.p',c_0_85) ).
cnf(c_34,negated_conjecture,
( p11(X0,f3(f8(X1),f3(f8(X2),f5(f6(f7(c14))))))
| ~ p11(X0,X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_118,negated_conjecture,
( p11(X0,f3(f8(X1),f3(f8(X2),f5(f6(f7(c14))))))
| ~ p11(X0,X1) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_159,negated_conjecture,
( p11(X0,f3(f8(X1),f3(f8(X2),f5(f6(f7(c14))))))
| ~ p11(X0,X1) ),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_160,negated_conjecture,
( p11(X0,f3(f8(X1),f3(f8(X2),f5(f6(f7(c14))))))
| ~ p11(X0,X1) ),
inference(copy,[status(esa)],[c_159]) ).
cnf(c_202,negated_conjecture,
( p11(X0,f3(f8(X1),f3(f8(X2),f5(f6(f7(c14))))))
| ~ p11(X0,X1) ),
inference(copy,[status(esa)],[c_160]) ).
cnf(c_400,plain,
~ p11(c15,c16),
inference(resolution,[status(thm)],[c_202,c_234]) ).
cnf(c_401,plain,
~ p11(c15,c16),
inference(rewriting,[status(thm)],[c_400]) ).
cnf(c_115870,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_114405,c_242,c_401]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN573-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 12 02:20:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.13/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.42 % Orientation found
% 0.13/0.42 % 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_66b182.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_bbf025.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_a10a1d | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 0.20/0.45 % --inst_prop_sim_new false
% 0.20/0.45 % --inst_orphan_elimination true
% 0.20/0.45 % --inst_learning_loop_flag true
% 0.20/0.45 % --inst_learning_start 3000
% 0.20/0.45 % --inst_learning_factor 2
% 0.20/0.45 % --inst_start_prop_sim_after_learn 3
% 0.20/0.45 % --inst_sel_renew solver
% 0.20/0.45 % --inst_lit_activity_flag true
% 0.20/0.45 % --inst_out_proof true
% 0.20/0.45
% 0.20/0.45 % ------ Resolution Options
% 0.20/0.45
% 0.20/0.45 % --resolution_flag true
% 0.20/0.45 % --res_lit_sel kbo_max
% 0.20/0.45 % --res_to_prop_solver none
% 0.20/0.45 % --res_prop_simpl_new false
% 0.20/0.45 % --res_prop_simpl_given false
% 0.20/0.45 % --res_passive_queue_type priority_queues
% 0.20/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.45 % --res_passive_queues_freq [15;5]
% 0.20/0.45 % --res_forward_subs full
% 0.20/0.45 % --res_backward_subs full
% 0.20/0.45 % --res_forward_subs_resolution true
% 0.20/0.45 % --res_backward_subs_resolution true
% 0.20/0.45 % --res_orphan_elimination false
% 0.20/0.45 % --res_time_limit 1000.
% 0.20/0.45 % --res_out_proof true
% 0.20/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_66b182.s
% 0.20/0.45 % --modulo true
% 0.20/0.45
% 0.20/0.45 % ------ Combination Options
% 0.20/0.45
% 0.20/0.45 % --comb_res_mult 1000
% 0.20/0.45 % --comb_inst_mult 300
% 0.20/0.45 % ------
% 0.20/0.45
% 0.20/0.45 % ------ Parsing...% successful
% 0.20/0.45
% 0.20/0.45 % ------ 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.45
% 0.20/0.45 % ------ Proving...
% 0.20/0.45 % ------ Problem Properties
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % EPR false
% 0.20/0.45 % Horn false
% 0.20/0.45 % Has equality false
% 0.20/0.45
% 0.20/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % % ------ Current options:
% 0.20/0.45
% 0.20/0.45 % ------ Input Options
% 0.20/0.45
% 0.20/0.45 % --out_options all
% 0.20/0.45 % --tptp_safe_out true
% 0.20/0.45 % --problem_path ""
% 0.20/0.45 % --include_path ""
% 0.20/0.45 % --clausifier .//eprover
% 0.20/0.45 % --clausifier_options --tstp-format
% 0.20/0.45 % --stdin false
% 0.20/0.45 % --dbg_backtrace false
% 0.20/0.45 % --dbg_dump_prop_clauses false
% 0.20/0.45 % --dbg_dump_prop_clauses_file -
% 0.20/0.45 % --dbg_out_stat false
% 0.20/0.45
% 0.20/0.45 % ------ General Options
% 0.20/0.45
% 0.20/0.45 % --fof false
% 0.20/0.45 % --time_out_real 150.
% 0.20/0.45 % --time_out_prep_mult 0.2
% 0.20/0.45 % --time_out_virtual -1.
% 0.20/0.45 % --schedule none
% 0.20/0.45 % --ground_splitting input
% 0.20/0.45 % --splitting_nvd 16
% 0.20/0.45 % --non_eq_to_eq false
% 0.20/0.45 % --prep_gs_sim true
% 0.20/0.45 % --prep_unflatten false
% 0.20/0.45 % --prep_res_sim true
% 0.20/0.45 % --prep_upred true
% 0.20/0.45 % --res_sim_input true
% 0.20/0.45 % --clause_weak_htbl true
% 0.20/0.45 % --gc_record_bc_elim false
% 0.20/0.45 % --symbol_type_check false
% 0.20/0.45 % --clausify_out false
% 0.20/0.45 % --large_theory_mode false
% 0.20/0.45 % --prep_sem_filter none
% 0.20/0.45 % --prep_sem_filter_out false
% 0.20/0.45 % --preprocessed_out false
% 0.20/0.45 % --sub_typing false
% 0.20/0.45 % --brand_transform false
% 0.20/0.45 % --pure_diseq_elim true
% 0.20/0.45 % --min_unsat_core false
% 0.20/0.45 % --pred_elim true
% 0.20/0.45 % --add_important_lit false
% 0.20/0.45 % --soft_assumptions false
% 0.20/0.45 % --reset_solvers false
% 0.20/0.45 % --bc_imp_inh []
% 0.20/0.45 % --conj_cone_tolerance 1.5
% 0.20/0.45 % --prolific_symb_bound 500
% 0.20/0.45 % --lt_threshold 2000
% 0.20/0.45
% 0.20/0.45 % ------ SAT Options
% 0.20/0.45
% 0.20/0.45 % --sat_mode false
% 0.20/0.45 % --sat_fm_restart_options ""
% 0.20/0.45 % --sat_gr_def false
% 0.20/0.45 % --sat_epr_types true
% 0.20/0.45 % --sat_non_cyclic_types false
% 0.20/0.45 % --sat_finite_models false
% 0.20/0.45 % --sat_fm_lemmas false
% 0.20/0.45 % --sat_fm_prep false
% 0.20/0.45 % --sat_fm_uc_incr true
% 0.20/0.45 % --sat_out_model small
% 0.20/0.45 % --sat_out_clauses false
% 0.20/0.45
% 0.20/0.45 % ------ QBF Options
% 0.20/0.45
% 0.20/0.45 % --qbf_mode false
% 0.20/0.45 % --qbf_elim_univ true
% 0.20/0.45 % --qbf_sk_in true
% 0.20/0.45 % --qbf_pred_elim true
% 0.20/0.45 % --qbf_split 32
% 0.20/0.45
% 0.20/0.45 % ------ BMC1 Options
% 0.20/0.45
% 0.20/0.45 % --bmc1_incremental false
% 0.20/0.45 % --bmc1_axioms reachable_all
% 0.20/0.45 % --bmc1_min_bound 0
% 0.20/0.45 % --bmc1_max_bound -1
% 0.20/0.45 % --bmc1_max_bound_default -1
% 0.20/0.45 % --bmc1_symbol_reachability true
% 0.20/0.45 % --bmc1_property_lemmas false
% 0.20/0.45 % --bmc1_k_induction false
% 0.20/0.45 % --bmc1_non_equiv_states false
% 0.20/0.45 % --bmc1_deadlock false
% 0.20/0.45 % --bmc1_ucm false
% 0.20/0.45 % --bmc1_add_unsat_core none
% 0.20/0.45 % --bmc1_unsat_core_children false
% 0.20/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.45 % --bmc1_out_stat full
% 0.20/0.45 % --bmc1_ground_init false
% 0.20/0.45 % --bmc1_pre_inst_next_state false
% 0.20/0.45 % --bmc1_pre_inst_state false
% 0.20/0.45 % --bmc1_pre_inst_reach_state false
% 0.20/0.45 % --bmc1_out_unsat_core false
% 0.20/0.45 % --bmc1_aig_witness_out false
% 0.20/0.45 % --bmc1_verbose false
% 0.20/0.45 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 2.75/2.95 % --inst_prop_sim_new false
% 2.75/2.95 % --inst_orphan_elimination true
% 2.75/2.95 % --inst_learning_loop_flag true
% 2.75/2.95 % --inst_learning_start 3000
% 2.75/2.95 % --inst_learning_factor 2
% 2.75/2.95 % --inst_start_prop_sim_after_learn 3
% 2.75/2.95 % --inst_sel_renew solver
% 2.75/2.95 % --inst_lit_activity_flag true
% 2.75/2.95 % --inst_out_proof true
% 2.75/2.95
% 2.75/2.95 % ------ Resolution Options
% 2.75/2.95
% 2.75/2.95 % --resolution_flag true
% 2.75/2.95 % --res_lit_sel kbo_max
% 2.75/2.95 % --res_to_prop_solver none
% 2.75/2.95 % --res_prop_simpl_new false
% 2.75/2.95 % --res_prop_simpl_given false
% 2.75/2.95 % --res_passive_queue_type priority_queues
% 2.75/2.95 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.75/2.95 % --res_passive_queues_freq [15;5]
% 2.75/2.95 % --res_forward_subs full
% 2.75/2.95 % --res_backward_subs full
% 2.75/2.95 % --res_forward_subs_resolution true
% 2.75/2.95 % --res_backward_subs_resolution true
% 2.75/2.95 % --res_orphan_elimination false
% 2.75/2.95 % --res_time_limit 1000.
% 2.75/2.95 % --res_out_proof true
% 2.75/2.95 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_66b182.s
% 2.75/2.95 % --modulo true
% 2.75/2.95
% 2.75/2.95 % ------ Combination Options
% 2.75/2.95
% 2.75/2.95 % --comb_res_mult 1000
% 2.75/2.95 % --comb_inst_mult 300
% 2.75/2.95 % ------
% 2.75/2.95
% 2.75/2.95
% 2.75/2.95
% 2.75/2.95 % ------ Proving...
% 2.75/2.95 %
% 2.75/2.95
% 2.75/2.95
% 2.75/2.95 % Resolution empty clause
% 2.75/2.95
% 2.75/2.95 % ------ Statistics
% 2.75/2.95
% 2.75/2.95 % ------ General
% 2.75/2.95
% 2.75/2.95 % num_of_input_clauses: 21
% 2.75/2.95 % num_of_input_neg_conjectures: 21
% 2.75/2.95 % num_of_splits: 0
% 2.75/2.95 % num_of_split_atoms: 0
% 2.75/2.95 % num_of_sem_filtered_clauses: 0
% 2.75/2.95 % num_of_subtypes: 0
% 2.75/2.95 % monotx_restored_types: 0
% 2.75/2.95 % sat_num_of_epr_types: 0
% 2.75/2.95 % sat_num_of_non_cyclic_types: 0
% 2.75/2.95 % sat_guarded_non_collapsed_types: 0
% 2.75/2.95 % is_epr: 0
% 2.75/2.95 % is_horn: 0
% 2.75/2.95 % has_eq: 0
% 2.75/2.95 % num_pure_diseq_elim: 0
% 2.75/2.95 % simp_replaced_by: 0
% 2.75/2.95 % res_preprocessed: 42
% 2.75/2.95 % prep_upred: 0
% 2.75/2.95 % prep_unflattend: 0
% 2.75/2.95 % pred_elim_cands: 0
% 2.75/2.95 % pred_elim: 0
% 2.75/2.95 % pred_elim_cl: 0
% 2.75/2.95 % pred_elim_cycles: 0
% 2.75/2.95 % forced_gc_time: 0
% 2.75/2.95 % gc_basic_clause_elim: 0
% 2.75/2.95 % parsing_time: 0.
% 2.75/2.95 % sem_filter_time: 0.
% 2.75/2.95 % pred_elim_time: 0.
% 2.75/2.95 % out_proof_time: 0.001
% 2.75/2.95 % monotx_time: 0.
% 2.75/2.95 % subtype_inf_time: 0.
% 2.75/2.95 % unif_index_cands_time: 0.011
% 2.75/2.95 % unif_index_add_time: 0.002
% 2.75/2.95 % total_time: 2.531
% 2.75/2.95 % num_of_symbols: 41
% 2.75/2.95 % num_of_terms: 58171
% 2.75/2.95
% 2.75/2.95 % ------ Propositional Solver
% 2.75/2.95
% 2.75/2.95 % prop_solver_calls: 12
% 2.75/2.95 % prop_fast_solver_calls: 141
% 2.75/2.95 % prop_num_of_clauses: 471
% 2.75/2.95 % prop_preprocess_simplified: 1201
% 2.75/2.95 % prop_fo_subsumed: 0
% 2.75/2.95 % prop_solver_time: 0.
% 2.75/2.95 % prop_fast_solver_time: 0.
% 2.75/2.95 % prop_unsat_core_time: 0.
% 2.75/2.95
% 2.75/2.95 % ------ QBF
% 2.75/2.95
% 2.75/2.95 % qbf_q_res: 0
% 2.75/2.95 % qbf_num_tautologies: 0
% 2.75/2.95 % qbf_prep_cycles: 0
% 2.75/2.95
% 2.75/2.95 % ------ BMC1
% 2.75/2.95
% 2.75/2.95 % bmc1_current_bound: -1
% 2.75/2.95 % bmc1_last_solved_bound: -1
% 2.75/2.95 % bmc1_unsat_core_size: -1
% 2.75/2.95 % bmc1_unsat_core_parents_size: -1
% 2.75/2.95 % bmc1_merge_next_fun: 0
% 2.75/2.95 % bmc1_unsat_core_clauses_time: 0.
% 2.75/2.95
% 2.75/2.95 % ------ Instantiation
% 2.75/2.95
% 2.75/2.95 % inst_num_of_clauses: 376
% 2.75/2.95 % inst_num_in_passive: 88
% 2.75/2.95 % inst_num_in_active: 267
% 2.75/2.95 % inst_num_in_unprocessed: 1
% 2.75/2.95 % inst_num_of_loops: 300
% 2.75/2.96 % inst_num_of_learning_restarts: 0
% 2.75/2.96 % inst_num_moves_active_passive: 7
% 2.75/2.96 % inst_lit_activity: 42
% 2.75/2.96 % inst_lit_activity_moves: 0
% 2.75/2.96 % inst_num_tautologies: 20
% 2.75/2.96 % inst_num_prop_implied: 0
% 2.75/2.96 % inst_num_existing_simplified: 0
% 2.75/2.96 % inst_num_eq_res_simplified: 0
% 2.75/2.96 % inst_num_child_elim: 0
% 2.75/2.96 % inst_num_of_dismatching_blockings: 429
% 2.75/2.96 % inst_num_of_non_proper_insts: 1001
% 2.75/2.96 % inst_num_of_duplicates: 366
% 2.75/2.96 % inst_inst_num_from_inst_to_res: 0
% 2.75/2.96 % inst_dismatching_checking_time: 0.
% 2.75/2.96
% 2.75/2.96 % ------ Resolution
% 2.75/2.96
% 2.75/2.96 % res_num_of_clauses: 48251
% 2.75/2.96 % res_num_in_passive: 47282
% 2.75/2.96 % res_num_in_active: 1090
% 2.75/2.96 % res_num_of_loops: 1146
% 2.75/2.96 % res_forward_subset_subsumed: 4774
% 2.75/2.96 % res_backward_subset_subsumed: 137
% 2.75/2.96 % res_forward_subsumed: 52
% 2.75/2.96 % res_backward_subsumed: 1
% 2.75/2.96 % res_forward_subsumption_resolution: 30
% 2.75/2.96 % res_backward_subsumption_resolution: 0
% 2.75/2.96 % res_clause_to_clause_subsumption: 17528
% 2.75/2.96 % res_orphan_elimination: 0
% 2.75/2.96 % res_tautology_del: 185
% 2.75/2.96 % res_num_eq_res_simplified: 0
% 2.75/2.96 % res_num_sel_changes: 0
% 2.75/2.96 % res_moves_from_active_to_pass: 0
% 2.75/2.96
% 2.75/2.96 % Status Unsatisfiable
% 2.75/2.96 % SZS status Unsatisfiable
% 2.75/2.96 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------