TSTP Solution File: SYN581-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN581-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n029.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:06 EDT 2022
% Result : Unsatisfiable 0.71s 0.88s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 34
% Syntax : Number of formulae : 192 ( 78 unt; 0 def)
% Number of atoms : 415 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 454 ( 231 ~; 223 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 338 ( 0 sgn 138 !; 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,X37,X38] :
( p10(X38,X37,X36)
| ~ p5(X35,X38)
| ~ p2(X33,X36)
| ~ p2(X34,X37)
| ~ p10(X35,X34,X33) ),
file('<stdin>',p10_24) ).
fof(c_0_1,negated_conjecture,
! [X39] :
( p11(f4(f6(c15,X39)),c16)
| ~ p12(X39,c14)
| ~ p12(c13,X39)
| ~ p2(f3(X39),f8(f9(c17))) ),
file('<stdin>',p11_25) ).
fof(c_0_2,negated_conjecture,
! [X29,X30,X31,X32] :
( p2(f6(X32,X31),f6(X30,X29))
| ~ p2(X31,X29)
| ~ p5(X32,X30) ),
file('<stdin>',p2_23) ).
fof(c_0_3,negated_conjecture,
! [X20] :
( p10(c15,f3(X20),X20)
| ~ p11(X20,c14)
| ~ p11(c13,X20) ),
file('<stdin>',p10_20) ).
fof(c_0_4,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
file('<stdin>',not_p11_9) ).
fof(c_0_5,negated_conjecture,
! [X25,X26,X27,X28] :
( p12(X28,X27)
| ~ p2(X26,X28)
| ~ p2(X25,X27)
| ~ p12(X26,X25) ),
file('<stdin>',p12_22) ).
fof(c_0_6,negated_conjecture,
! [X21,X22,X23,X24] :
( p11(X23,X22)
| ~ p2(X21,X23)
| ~ p2(X24,X22)
| ~ p11(X21,X24) ),
file('<stdin>',p11_21) ).
fof(c_0_7,negated_conjecture,
! [X18,X19,X3] :
( p5(X19,X18)
| ~ p5(X3,X19)
| ~ p5(X3,X18) ),
file('<stdin>',p5_19) ).
fof(c_0_8,negated_conjecture,
! [X16,X17,X2] :
( p2(X17,X16)
| ~ p2(X2,X17)
| ~ p2(X2,X16) ),
file('<stdin>',p2_18) ).
fof(c_0_9,negated_conjecture,
! [X14,X15,X1] :
( p7(X15,X14)
| ~ p7(X1,X15)
| ~ p7(X1,X14) ),
file('<stdin>',p7_17) ).
fof(c_0_10,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
file('<stdin>',p11_8) ).
fof(c_0_11,negated_conjecture,
p11(f4(f6(c15,c13)),c16),
file('<stdin>',p11_7) ).
fof(c_0_12,negated_conjecture,
! [X4,X5] :
( p12(X5,X4)
| p2(X5,X4)
| ~ p11(X5,X4) ),
file('<stdin>',p12_16) ).
fof(c_0_13,negated_conjecture,
! [X12,X13] :
( p2(f8(X13),f8(X12))
| ~ p7(X13,X12) ),
file('<stdin>',p2_15) ).
fof(c_0_14,negated_conjecture,
! [X10,X11] :
( p2(f4(X11),f4(X10))
| ~ p2(X11,X10) ),
file('<stdin>',p2_14) ).
fof(c_0_15,negated_conjecture,
! [X8,X9] :
( p2(f3(X9),f3(X8))
| ~ p2(X9,X8) ),
file('<stdin>',p2_13) ).
fof(c_0_16,negated_conjecture,
! [X6,X7] :
( p7(f9(X7),f9(X6))
| ~ p7(X7,X6) ),
file('<stdin>',p7_12) ).
fof(c_0_17,negated_conjecture,
! [X4,X5] :
( p11(X5,X4)
| ~ p2(X5,X4) ),
file('<stdin>',p11_11) ).
fof(c_0_18,negated_conjecture,
! [X4,X5] :
( p11(X5,X4)
| ~ p12(X5,X4) ),
file('<stdin>',p11_10) ).
fof(c_0_19,negated_conjecture,
p2(f3(c18),f8(f9(c17))),
file('<stdin>',p2_6) ).
fof(c_0_20,negated_conjecture,
! [X3] : p5(X3,X3),
file('<stdin>',p5_3) ).
fof(c_0_21,negated_conjecture,
! [X2] : p2(X2,X2),
file('<stdin>',p2_2) ).
fof(c_0_22,negated_conjecture,
! [X1] : p7(X1,X1),
file('<stdin>',p7_1) ).
fof(c_0_23,negated_conjecture,
p2(c18,c14),
file('<stdin>',p2_5) ).
fof(c_0_24,negated_conjecture,
p12(c13,c18),
file('<stdin>',p12_4) ).
fof(c_0_25,negated_conjecture,
! [X33,X34,X35,X36,X37,X38] :
( p10(X38,X37,X36)
| ~ p5(X35,X38)
| ~ p2(X33,X36)
| ~ p2(X34,X37)
| ~ p10(X35,X34,X33) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_26,negated_conjecture,
! [X39] :
( p11(f4(f6(c15,X39)),c16)
| ~ p12(X39,c14)
| ~ p12(c13,X39)
| ~ p2(f3(X39),f8(f9(c17))) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_27,negated_conjecture,
! [X29,X30,X31,X32] :
( p2(f6(X32,X31),f6(X30,X29))
| ~ p2(X31,X29)
| ~ p5(X32,X30) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_28,negated_conjecture,
! [X20] :
( p10(c15,f3(X20),X20)
| ~ p11(X20,c14)
| ~ p11(c13,X20) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_29,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_30,negated_conjecture,
! [X25,X26,X27,X28] :
( p12(X28,X27)
| ~ p2(X26,X28)
| ~ p2(X25,X27)
| ~ p12(X26,X25) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_31,negated_conjecture,
! [X21,X22,X23,X24] :
( p11(X23,X22)
| ~ p2(X21,X23)
| ~ p2(X24,X22)
| ~ p11(X21,X24) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_32,negated_conjecture,
! [X18,X19,X3] :
( p5(X19,X18)
| ~ p5(X3,X19)
| ~ p5(X3,X18) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_33,negated_conjecture,
! [X16,X17,X2] :
( p2(X17,X16)
| ~ p2(X2,X17)
| ~ p2(X2,X16) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_34,negated_conjecture,
! [X14,X15,X1] :
( p7(X15,X14)
| ~ p7(X1,X15)
| ~ p7(X1,X14) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_35,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
c_0_10 ).
fof(c_0_36,negated_conjecture,
p11(f4(f6(c15,c13)),c16),
c_0_11 ).
fof(c_0_37,negated_conjecture,
! [X4,X5] :
( p12(X5,X4)
| p2(X5,X4)
| ~ p11(X5,X4) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_38,negated_conjecture,
! [X12,X13] :
( p2(f8(X13),f8(X12))
| ~ p7(X13,X12) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_39,negated_conjecture,
! [X10,X11] :
( p2(f4(X11),f4(X10))
| ~ p2(X11,X10) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_40,negated_conjecture,
! [X8,X9] :
( p2(f3(X9),f3(X8))
| ~ p2(X9,X8) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_41,negated_conjecture,
! [X6,X7] :
( p7(f9(X7),f9(X6))
| ~ p7(X7,X6) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_42,negated_conjecture,
! [X4,X5] :
( p11(X5,X4)
| ~ p2(X5,X4) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_43,negated_conjecture,
! [X4,X5] :
( p11(X5,X4)
| ~ p12(X5,X4) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_44,negated_conjecture,
p2(f3(c18),f8(f9(c17))),
c_0_19 ).
fof(c_0_45,negated_conjecture,
! [X3] : p5(X3,X3),
c_0_20 ).
fof(c_0_46,negated_conjecture,
! [X2] : p2(X2,X2),
c_0_21 ).
fof(c_0_47,negated_conjecture,
! [X1] : p7(X1,X1),
c_0_22 ).
fof(c_0_48,negated_conjecture,
p2(c18,c14),
c_0_23 ).
fof(c_0_49,negated_conjecture,
p12(c13,c18),
c_0_24 ).
fof(c_0_50,negated_conjecture,
! [X39,X40,X41,X42,X43,X44] :
( p10(X44,X43,X42)
| ~ p5(X41,X44)
| ~ p2(X39,X42)
| ~ p2(X40,X43)
| ~ p10(X41,X40,X39) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_51,negated_conjecture,
! [X40] :
( p11(f4(f6(c15,X40)),c16)
| ~ p12(X40,c14)
| ~ p12(c13,X40)
| ~ p2(f3(X40),f8(f9(c17))) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_52,negated_conjecture,
! [X33,X34,X35,X36] :
( p2(f6(X36,X35),f6(X34,X33))
| ~ p2(X35,X33)
| ~ p5(X36,X34) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_53,negated_conjecture,
! [X21] :
( p10(c15,f3(X21),X21)
| ~ p11(X21,c14)
| ~ p11(c13,X21) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_54,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
c_0_29 ).
fof(c_0_55,negated_conjecture,
! [X29,X30,X31,X32] :
( p12(X32,X31)
| ~ p2(X30,X32)
| ~ p2(X29,X31)
| ~ p12(X30,X29) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_56,negated_conjecture,
! [X25,X26,X27,X28] :
( p11(X27,X26)
| ~ p2(X25,X27)
| ~ p2(X28,X26)
| ~ p11(X25,X28) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_31])])]) ).
fof(c_0_57,negated_conjecture,
! [X20,X21,X22] :
( p5(X21,X20)
| ~ p5(X22,X21)
| ~ p5(X22,X20) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_32])])]) ).
fof(c_0_58,negated_conjecture,
! [X18,X19,X20] :
( p2(X19,X18)
| ~ p2(X20,X19)
| ~ p2(X20,X18) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_33])])]) ).
fof(c_0_59,negated_conjecture,
! [X16,X17,X18] :
( p7(X17,X16)
| ~ p7(X18,X17)
| ~ p7(X18,X16) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_34])])]) ).
fof(c_0_60,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
c_0_35 ).
fof(c_0_61,negated_conjecture,
p11(f4(f6(c15,c13)),c16),
c_0_36 ).
fof(c_0_62,negated_conjecture,
! [X6,X7] :
( p12(X7,X6)
| p2(X7,X6)
| ~ p11(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_63,negated_conjecture,
! [X14,X15] :
( p2(f8(X15),f8(X14))
| ~ p7(X15,X14) ),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_64,negated_conjecture,
! [X12,X13] :
( p2(f4(X13),f4(X12))
| ~ p2(X13,X12) ),
inference(variable_rename,[status(thm)],[c_0_39]) ).
fof(c_0_65,negated_conjecture,
! [X10,X11] :
( p2(f3(X11),f3(X10))
| ~ p2(X11,X10) ),
inference(variable_rename,[status(thm)],[c_0_40]) ).
fof(c_0_66,negated_conjecture,
! [X8,X9] :
( p7(f9(X9),f9(X8))
| ~ p7(X9,X8) ),
inference(variable_rename,[status(thm)],[c_0_41]) ).
fof(c_0_67,negated_conjecture,
! [X6,X7] :
( p11(X7,X6)
| ~ p2(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_42]) ).
fof(c_0_68,negated_conjecture,
! [X6,X7] :
( p11(X7,X6)
| ~ p12(X7,X6) ),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_69,negated_conjecture,
p2(f3(c18),f8(f9(c17))),
c_0_44 ).
fof(c_0_70,negated_conjecture,
! [X4] : p5(X4,X4),
inference(variable_rename,[status(thm)],[c_0_45]) ).
fof(c_0_71,negated_conjecture,
! [X3] : p2(X3,X3),
inference(variable_rename,[status(thm)],[c_0_46]) ).
fof(c_0_72,negated_conjecture,
! [X2] : p7(X2,X2),
inference(variable_rename,[status(thm)],[c_0_47]) ).
fof(c_0_73,negated_conjecture,
p2(c18,c14),
c_0_48 ).
fof(c_0_74,negated_conjecture,
p12(c13,c18),
c_0_49 ).
cnf(c_0_75,negated_conjecture,
( p10(X6,X4,X5)
| ~ p10(X1,X2,X3)
| ~ p2(X2,X4)
| ~ p2(X3,X5)
| ~ p5(X1,X6) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_76,negated_conjecture,
( p11(f4(f6(c15,X1)),c16)
| ~ p2(f3(X1),f8(f9(c17)))
| ~ p12(c13,X1)
| ~ p12(X1,c14) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_77,negated_conjecture,
( p2(f6(X1,X3),f6(X2,X4))
| ~ p5(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_78,negated_conjecture,
( p10(c15,f3(X1),X1)
| ~ p11(c13,X1)
| ~ p11(X1,c14) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_79,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_80,negated_conjecture,
( p12(X4,X3)
| ~ p12(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_81,negated_conjecture,
( p11(X4,X3)
| ~ p11(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_82,negated_conjecture,
( p5(X3,X2)
| ~ p5(X1,X2)
| ~ p5(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_83,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_84,negated_conjecture,
( p7(X3,X2)
| ~ p7(X1,X2)
| ~ p7(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_85,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_86,negated_conjecture,
p11(f4(f6(c15,c13)),c16),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_87,negated_conjecture,
( p2(X1,X2)
| p12(X1,X2)
| ~ p11(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_88,negated_conjecture,
( p2(f8(X1),f8(X2))
| ~ p7(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_89,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_90,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_91,negated_conjecture,
( p7(f9(X1),f9(X2))
| ~ p7(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_92,negated_conjecture,
( p11(X1,X2)
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_93,negated_conjecture,
( p11(X1,X2)
| ~ p12(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_94,negated_conjecture,
p2(f3(c18),f8(f9(c17))),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_95,negated_conjecture,
p5(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_96,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_97,negated_conjecture,
p7(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_98,negated_conjecture,
p2(c18,c14),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_99,negated_conjecture,
p12(c13,c18),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_100,negated_conjecture,
( p10(X6,X4,X5)
| ~ p10(X1,X2,X3)
| ~ p2(X2,X4)
| ~ p2(X3,X5)
| ~ p5(X1,X6) ),
c_0_75,
[final] ).
cnf(c_0_101,negated_conjecture,
( p11(f4(f6(c15,X1)),c16)
| ~ p2(f3(X1),f8(f9(c17)))
| ~ p12(c13,X1)
| ~ p12(X1,c14) ),
c_0_76,
[final] ).
cnf(c_0_102,negated_conjecture,
( p2(f6(X1,X3),f6(X2,X4))
| ~ p5(X1,X2)
| ~ p2(X3,X4) ),
c_0_77,
[final] ).
cnf(c_0_103,negated_conjecture,
( p10(c15,f3(X1),X1)
| ~ p11(c13,X1)
| ~ p11(X1,c14) ),
c_0_78,
[final] ).
cnf(c_0_104,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
c_0_79,
[final] ).
cnf(c_0_105,negated_conjecture,
( p12(X4,X3)
| ~ p12(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
c_0_80,
[final] ).
cnf(c_0_106,negated_conjecture,
( p11(X4,X3)
| ~ p11(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
c_0_81,
[final] ).
cnf(c_0_107,negated_conjecture,
( p5(X3,X2)
| ~ p5(X1,X2)
| ~ p5(X1,X3) ),
c_0_82,
[final] ).
cnf(c_0_108,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_83,
[final] ).
cnf(c_0_109,negated_conjecture,
( p7(X3,X2)
| ~ p7(X1,X2)
| ~ p7(X1,X3) ),
c_0_84,
[final] ).
cnf(c_0_110,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
c_0_85,
[final] ).
cnf(c_0_111,negated_conjecture,
p11(f4(f6(c15,c13)),c16),
c_0_86,
[final] ).
cnf(c_0_112,negated_conjecture,
( p2(X1,X2)
| p12(X1,X2)
| ~ p11(X1,X2) ),
c_0_87,
[final] ).
cnf(c_0_113,negated_conjecture,
( p2(f8(X1),f8(X2))
| ~ p7(X1,X2) ),
c_0_88,
[final] ).
cnf(c_0_114,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_89,
[final] ).
cnf(c_0_115,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
c_0_90,
[final] ).
cnf(c_0_116,negated_conjecture,
( p7(f9(X1),f9(X2))
| ~ p7(X1,X2) ),
c_0_91,
[final] ).
cnf(c_0_117,negated_conjecture,
( p11(X1,X2)
| ~ p2(X1,X2) ),
c_0_92,
[final] ).
cnf(c_0_118,negated_conjecture,
( p11(X1,X2)
| ~ p12(X1,X2) ),
c_0_93,
[final] ).
cnf(c_0_119,negated_conjecture,
p2(f3(c18),f8(f9(c17))),
c_0_94,
[final] ).
cnf(c_0_120,negated_conjecture,
p5(X1,X1),
c_0_95,
[final] ).
cnf(c_0_121,negated_conjecture,
p2(X1,X1),
c_0_96,
[final] ).
cnf(c_0_122,negated_conjecture,
p7(X1,X1),
c_0_97,
[final] ).
cnf(c_0_123,negated_conjecture,
p2(c18,c14),
c_0_98,
[final] ).
cnf(c_0_124,negated_conjecture,
p12(c13,c18),
c_0_99,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_5,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X2,X3)
| ~ p11(X0,X2)
| p11(X1,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_106) ).
cnf(c_47,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X2,X3)
| ~ p11(X0,X2)
| p11(X1,X3) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_142,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X2,X3)
| ~ p11(X0,X2)
| p11(X1,X3) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_181,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X2,X3)
| ~ p11(X0,X2)
| p11(X1,X3) ),
inference(copy,[status(esa)],[c_142]) ).
cnf(c_192,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X2,X3)
| ~ p11(X0,X2)
| p11(X1,X3) ),
inference(copy,[status(esa)],[c_181]) ).
cnf(c_247,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X2,X3)
| ~ p11(X0,X2)
| p11(X1,X3) ),
inference(copy,[status(esa)],[c_192]) ).
cnf(c_17,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_110) ).
cnf(c_71,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_154,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_169,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
inference(copy,[status(esa)],[c_154]) ).
cnf(c_204,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
inference(copy,[status(esa)],[c_169]) ).
cnf(c_271,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
inference(copy,[status(esa)],[c_204]) ).
cnf(c_413,plain,
( ~ p2(f4(f6(c15,c14)),X0)
| ~ p2(c16,X1)
| p11(X0,X1) ),
inference(resolution,[status(thm)],[c_247,c_271]) ).
cnf(c_414,plain,
( ~ p2(f4(f6(c15,c14)),X0)
| ~ p2(c16,X1)
| p11(X0,X1) ),
inference(rewriting,[status(thm)],[c_413]) ).
cnf(c_11,negated_conjecture,
( p2(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_114) ).
cnf(c_59,negated_conjecture,
( p2(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_148,negated_conjecture,
( p2(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_175,negated_conjecture,
( p2(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_148]) ).
cnf(c_198,negated_conjecture,
( p2(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_175]) ).
cnf(c_259,negated_conjecture,
( p2(f4(X0),f4(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_198]) ).
cnf(c_794,plain,
( ~ p2(f6(c15,c14),X0)
| ~ p2(c16,X1)
| p11(f4(X0),X1) ),
inference(resolution,[status(thm)],[c_414,c_259]) ).
cnf(c_795,plain,
( ~ p2(f6(c15,c14),X0)
| ~ p2(c16,X1)
| p11(f4(X0),X1) ),
inference(rewriting,[status(thm)],[c_794]) ).
cnf(c_2,negated_conjecture,
( p2(f6(X0,X1),f6(X2,X3))
| ~ p2(X1,X3)
| ~ p5(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_102) ).
cnf(c_41,negated_conjecture,
( p2(f6(X0,X1),f6(X2,X3))
| ~ p2(X1,X3)
| ~ p5(X0,X2) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_139,negated_conjecture,
( p2(f6(X0,X1),f6(X2,X3))
| ~ p2(X1,X3)
| ~ p5(X0,X2) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_184,negated_conjecture,
( p2(f6(X0,X1),f6(X2,X3))
| ~ p2(X1,X3)
| ~ p5(X0,X2) ),
inference(copy,[status(esa)],[c_139]) ).
cnf(c_189,negated_conjecture,
( p2(f6(X0,X1),f6(X2,X3))
| ~ p2(X1,X3)
| ~ p5(X0,X2) ),
inference(copy,[status(esa)],[c_184]) ).
cnf(c_241,negated_conjecture,
( p2(f6(X0,X1),f6(X2,X3))
| ~ p2(X1,X3)
| ~ p5(X0,X2) ),
inference(copy,[status(esa)],[c_189]) ).
cnf(c_1446,plain,
( ~ p2(c16,X0)
| ~ p2(c14,X1)
| ~ p5(c15,X2)
| p11(f4(f6(X2,X1)),X0) ),
inference(resolution,[status(thm)],[c_795,c_241]) ).
cnf(c_1447,plain,
( ~ p2(c16,X0)
| ~ p2(c14,X1)
| ~ p5(c15,X2)
| p11(f4(f6(X2,X1)),X0) ),
inference(rewriting,[status(thm)],[c_1446]) ).
cnf(c_16,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_104) ).
cnf(c_69,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_153,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_170,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
inference(copy,[status(esa)],[c_153]) ).
cnf(c_203,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
inference(copy,[status(esa)],[c_170]) ).
cnf(c_269,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
inference(copy,[status(esa)],[c_203]) ).
cnf(c_29399,plain,
( ~ p2(c16,c16)
| ~ p2(c14,c18)
| ~ p5(c15,c15) ),
inference(resolution,[status(thm)],[c_1447,c_269]) ).
cnf(c_29400,plain,
( ~ p2(c16,c16)
| ~ p2(c14,c18)
| ~ p5(c15,c15) ),
inference(rewriting,[status(thm)],[c_29399]) ).
cnf(c_20,negated_conjecture,
p5(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_120) ).
cnf(c_77,negated_conjecture,
p5(X0,X0),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_157,negated_conjecture,
p5(X0,X0),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_166,negated_conjecture,
p5(X0,X0),
inference(copy,[status(esa)],[c_157]) ).
cnf(c_207,negated_conjecture,
p5(X0,X0),
inference(copy,[status(esa)],[c_166]) ).
cnf(c_277,negated_conjecture,
p5(X0,X0),
inference(copy,[status(esa)],[c_207]) ).
cnf(c_7,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_108) ).
cnf(c_51,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_144,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_179,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_144]) ).
cnf(c_194,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_179]) ).
cnf(c_251,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_194]) ).
cnf(c_21,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_121) ).
cnf(c_79,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_158,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_165,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_158]) ).
cnf(c_208,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_165]) ).
cnf(c_279,plain,
p2(X0,X0),
inference(copy,[status(esa)],[c_208]) ).
cnf(c_363,plain,
( ~ p2(X0,X1)
| p2(X1,X0) ),
inference(resolution,[status(thm)],[c_251,c_279]) ).
cnf(c_364,plain,
( ~ p2(X0,X1)
| p2(X1,X0) ),
inference(rewriting,[status(thm)],[c_363]) ).
cnf(c_23,negated_conjecture,
p2(c18,c14),
file('/export/starexec/sandbox/tmp/iprover_modulo_7ed467.p',c_0_123) ).
cnf(c_83,negated_conjecture,
p2(c18,c14),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_160,negated_conjecture,
p2(c18,c14),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_163,negated_conjecture,
p2(c18,c14),
inference(copy,[status(esa)],[c_160]) ).
cnf(c_210,negated_conjecture,
p2(c18,c14),
inference(copy,[status(esa)],[c_163]) ).
cnf(c_283,plain,
p2(c18,c14),
inference(copy,[status(esa)],[c_210]) ).
cnf(c_469,plain,
p2(c14,c18),
inference(resolution,[status(thm)],[c_364,c_283]) ).
cnf(c_470,plain,
p2(c14,c18),
inference(rewriting,[status(thm)],[c_469]) ).
cnf(c_29404,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_29400,c_277,c_470,c_279]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN581-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n029.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 20:42:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.40 % Orientation found
% 0.21/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c25f25.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_7ed467.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_3acbeb | grep -v "SZS"
% 0.21/0.43
% 0.21/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ iProver source info
% 0.21/0.43
% 0.21/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.43 % git: non_committed_changes: true
% 0.21/0.43 % git: last_make_outside_of_git: true
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.43 % --inst_prop_sim_new false
% 0.21/0.43 % --inst_orphan_elimination true
% 0.21/0.43 % --inst_learning_loop_flag true
% 0.21/0.43 % --inst_learning_start 3000
% 0.21/0.43 % --inst_learning_factor 2
% 0.21/0.43 % --inst_start_prop_sim_after_learn 3
% 0.21/0.43 % --inst_sel_renew solver
% 0.21/0.43 % --inst_lit_activity_flag true
% 0.21/0.43 % --inst_out_proof true
% 0.21/0.43
% 0.21/0.43 % ------ Resolution Options
% 0.21/0.43
% 0.21/0.43 % --resolution_flag true
% 0.21/0.43 % --res_lit_sel kbo_max
% 0.21/0.43 % --res_to_prop_solver none
% 0.21/0.43 % --res_prop_simpl_new false
% 0.21/0.43 % --res_prop_simpl_given false
% 0.21/0.43 % --res_passive_queue_type priority_queues
% 0.21/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.43 % --res_passive_queues_freq [15;5]
% 0.21/0.43 % --res_forward_subs full
% 0.21/0.43 % --res_backward_subs full
% 0.21/0.43 % --res_forward_subs_resolution true
% 0.21/0.43 % --res_backward_subs_resolution true
% 0.21/0.43 % --res_orphan_elimination false
% 0.21/0.43 % --res_time_limit 1000.
% 0.21/0.43 % --res_out_proof true
% 0.21/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c25f25.s
% 0.21/0.43 % --modulo true
% 0.21/0.43
% 0.21/0.43 % ------ Combination Options
% 0.21/0.43
% 0.21/0.43 % --comb_res_mult 1000
% 0.21/0.43 % --comb_inst_mult 300
% 0.21/0.43 % ------
% 0.21/0.43
% 0.21/0.43 % ------ Parsing...% successful
% 0.21/0.43
% 0.21/0.43 % ------ 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.21/0.43
% 0.21/0.43 % ------ Proving...
% 0.21/0.43 % ------ Problem Properties
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % EPR false
% 0.21/0.43 % Horn false
% 0.21/0.43 % Has equality false
% 0.21/0.43
% 0.21/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 % % ------ Current options:
% 0.21/0.43
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.71/0.88 % --inst_prop_sim_new false
% 0.71/0.88 % --inst_orphan_elimination true
% 0.71/0.88 % --inst_learning_loop_flag true
% 0.71/0.88 % --inst_learning_start 3000
% 0.71/0.88 % --inst_learning_factor 2
% 0.71/0.88 % --inst_start_prop_sim_after_learn 3
% 0.71/0.88 % --inst_sel_renew solver
% 0.71/0.88 % --inst_lit_activity_flag true
% 0.71/0.88 % --inst_out_proof true
% 0.71/0.88
% 0.71/0.88 % ------ Resolution Options
% 0.71/0.88
% 0.71/0.88 % --resolution_flag true
% 0.71/0.88 % --res_lit_sel kbo_max
% 0.71/0.88 % --res_to_prop_solver none
% 0.71/0.88 % --res_prop_simpl_new false
% 0.71/0.88 % --res_prop_simpl_given false
% 0.71/0.88 % --res_passive_queue_type priority_queues
% 0.71/0.88 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.71/0.88 % --res_passive_queues_freq [15;5]
% 0.71/0.88 % --res_forward_subs full
% 0.71/0.88 % --res_backward_subs full
% 0.71/0.88 % --res_forward_subs_resolution true
% 0.71/0.88 % --res_backward_subs_resolution true
% 0.71/0.88 % --res_orphan_elimination false
% 0.71/0.88 % --res_time_limit 1000.
% 0.71/0.88 % --res_out_proof true
% 0.71/0.88 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c25f25.s
% 0.71/0.88 % --modulo true
% 0.71/0.88
% 0.71/0.88 % ------ Combination Options
% 0.71/0.88
% 0.71/0.88 % --comb_res_mult 1000
% 0.71/0.88 % --comb_inst_mult 300
% 0.71/0.88 % ------
% 0.71/0.88
% 0.71/0.88
% 0.71/0.88
% 0.71/0.88 % ------ Proving...
% 0.71/0.88 %
% 0.71/0.88
% 0.71/0.88
% 0.71/0.88 % Resolution empty clause
% 0.71/0.88
% 0.71/0.88 % ------ Statistics
% 0.71/0.88
% 0.71/0.88 % ------ General
% 0.71/0.88
% 0.71/0.88 % num_of_input_clauses: 25
% 0.71/0.88 % num_of_input_neg_conjectures: 25
% 0.71/0.88 % num_of_splits: 0
% 0.71/0.88 % num_of_split_atoms: 0
% 0.71/0.88 % num_of_sem_filtered_clauses: 0
% 0.71/0.88 % num_of_subtypes: 0
% 0.71/0.88 % monotx_restored_types: 0
% 0.71/0.88 % sat_num_of_epr_types: 0
% 0.71/0.88 % sat_num_of_non_cyclic_types: 0
% 0.71/0.88 % sat_guarded_non_collapsed_types: 0
% 0.71/0.88 % is_epr: 0
% 0.71/0.88 % is_horn: 0
% 0.71/0.88 % has_eq: 0
% 0.71/0.88 % num_pure_diseq_elim: 0
% 0.71/0.88 % simp_replaced_by: 0
% 0.71/0.88 % res_preprocessed: 50
% 0.71/0.88 % prep_upred: 0
% 0.71/0.88 % prep_unflattend: 0
% 0.71/0.88 % pred_elim_cands: 0
% 0.71/0.88 % pred_elim: 0
% 0.71/0.88 % pred_elim_cl: 0
% 0.71/0.88 % pred_elim_cycles: 0
% 0.71/0.88 % forced_gc_time: 0
% 0.71/0.88 % gc_basic_clause_elim: 0
% 0.71/0.88 % parsing_time: 0.001
% 0.71/0.88 % sem_filter_time: 0.
% 0.71/0.88 % pred_elim_time: 0.
% 0.71/0.88 % out_proof_time: 0.001
% 0.71/0.88 % monotx_time: 0.
% 0.71/0.88 % subtype_inf_time: 0.
% 0.71/0.88 % unif_index_cands_time: 0.002
% 0.71/0.88 % unif_index_add_time: 0.001
% 0.71/0.88 % total_time: 0.469
% 0.71/0.88 % num_of_symbols: 42
% 0.71/0.88 % num_of_terms: 8124
% 0.71/0.88
% 0.71/0.88 % ------ Propositional Solver
% 0.71/0.88
% 0.71/0.88 % prop_solver_calls: 1
% 0.71/0.88 % prop_fast_solver_calls: 168
% 0.71/0.88 % prop_num_of_clauses: 37
% 0.71/0.88 % prop_preprocess_simplified: 403
% 0.71/0.88 % prop_fo_subsumed: 0
% 0.71/0.88 % prop_solver_time: 0.
% 0.71/0.88 % prop_fast_solver_time: 0.
% 0.71/0.88 % prop_unsat_core_time: 0.
% 0.71/0.88
% 0.71/0.88 % ------ QBF
% 0.71/0.88
% 0.71/0.88 % qbf_q_res: 0
% 0.71/0.88 % qbf_num_tautologies: 0
% 0.71/0.88 % qbf_prep_cycles: 0
% 0.71/0.88
% 0.71/0.88 % ------ BMC1
% 0.71/0.88
% 0.71/0.88 % bmc1_current_bound: -1
% 0.71/0.88 % bmc1_last_solved_bound: -1
% 0.71/0.88 % bmc1_unsat_core_size: -1
% 0.71/0.88 % bmc1_unsat_core_parents_size: -1
% 0.71/0.88 % bmc1_merge_next_fun: 0
% 0.71/0.88 % bmc1_unsat_core_clauses_time: 0.
% 0.71/0.88
% 0.71/0.88 % ------ Instantiation
% 0.71/0.88
% 0.71/0.88 % inst_num_of_clauses: 25
% 0.71/0.88 % inst_num_in_passive: 0
% 0.71/0.88 % inst_num_in_active: 0
% 0.71/0.88 % inst_num_in_unprocessed: 25
% 0.71/0.88 % inst_num_of_loops: 0
% 0.71/0.88 % inst_num_of_learning_restarts: 0
% 0.71/0.88 % inst_num_moves_active_passive: 0
% 0.71/0.88 % inst_lit_activity: 0
% 0.71/0.88 % inst_lit_activity_moves: 0
% 0.71/0.88 % inst_num_tautologies: 0
% 0.71/0.88 % inst_num_prop_implied: 0
% 0.71/0.88 % inst_num_existing_simplified: 0
% 0.71/0.88 % inst_num_eq_res_simplified: 0
% 0.71/0.88 % inst_num_child_elim: 0
% 0.71/0.88 % inst_num_of_dismatching_blockings: 0
% 0.71/0.88 % inst_num_of_non_proper_insts: 0
% 0.71/0.88 % inst_num_of_duplicates: 0
% 0.71/0.88 % inst_inst_num_from_inst_to_res: 0
% 0.71/0.88 % inst_dismatching_checking_time: 0.
% 0.71/0.88
% 0.71/0.88 % ------ Resolution
% 0.71/0.88
% 0.71/0.88 % res_num_of_clauses: 12148
% 0.71/0.88 % res_num_in_passive: 11716
% 0.71/0.88 % res_num_in_active: 463
% 0.71/0.88 % res_num_of_loops: 552
% 0.71/0.88 % res_forward_subset_subsumed: 974
% 0.71/0.88 % res_backward_subset_subsumed: 32
% 0.71/0.88 % res_forward_subsumed: 83
% 0.71/0.88 % res_backward_subsumed: 5
% 0.71/0.88 % res_forward_subsumption_resolution: 7
% 0.71/0.88 % res_backward_subsumption_resolution: 0
% 0.71/0.88 % res_clause_to_clause_subsumption: 5708
% 0.71/0.88 % res_orphan_elimination: 0
% 0.71/0.88 % res_tautology_del: 22
% 0.71/0.88 % res_num_eq_res_simplified: 0
% 0.71/0.88 % res_num_sel_changes: 0
% 0.71/0.88 % res_moves_from_active_to_pass: 0
% 0.71/0.88
% 0.71/0.88 % Status Unsatisfiable
% 0.71/0.88 % SZS status Unsatisfiable
% 0.71/0.88 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------