TSTP Solution File: SYN570-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN570-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n007.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:01 EDT 2022
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 30
% Syntax : Number of formulae : 177 ( 91 unt; 0 def)
% Number of atoms : 338 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 335 ( 174 ~; 161 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 293 ( 0 sgn 105 !; 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,
! [X27,X28,X29,X30] :
( p11(X30,X29)
| ~ p11(X27,X28)
| ~ p2(X27,X30)
| ~ p10(X28,X29) ),
file('<stdin>',p11_20) ).
fof(c_0_1,negated_conjecture,
! [X23,X24,X25,X26] :
( p9(X26,X25)
| ~ p7(X23,X25)
| ~ p9(X24,X23)
| ~ p3(X24,X26) ),
file('<stdin>',p9_19) ).
fof(c_0_2,negated_conjecture,
! [X21,X22,X5] :
( p2(X22,X21)
| ~ p2(X5,X22)
| ~ p2(X5,X21) ),
file('<stdin>',p2_18) ).
fof(c_0_3,negated_conjecture,
! [X19,X20,X4] :
( p3(X20,X19)
| ~ p3(X4,X20)
| ~ p3(X4,X19) ),
file('<stdin>',p3_17) ).
fof(c_0_4,negated_conjecture,
! [X17,X18,X3] :
( p6(X18,X17)
| ~ p6(X3,X18)
| ~ p6(X3,X17) ),
file('<stdin>',p6_16) ).
fof(c_0_5,negated_conjecture,
! [X15,X16,X2] :
( p7(X16,X15)
| ~ p7(X2,X16)
| ~ p7(X2,X15) ),
file('<stdin>',p7_15) ).
fof(c_0_6,negated_conjecture,
! [X13,X14,X1] :
( p10(X14,X13)
| ~ p10(X1,X14)
| ~ p10(X1,X13) ),
file('<stdin>',p10_14) ).
fof(c_0_7,negated_conjecture,
! [X11,X12] :
( p3(f4(X12),f4(X11))
| ~ p2(X12,X11) ),
file('<stdin>',p3_13) ).
fof(c_0_8,negated_conjecture,
! [X9,X10] :
( p2(f5(X10),f5(X9))
| ~ p3(X10,X9) ),
file('<stdin>',p2_12) ).
fof(c_0_9,negated_conjecture,
! [X7,X8] :
( p7(f8(X8),f8(X7))
| ~ p6(X8,X7) ),
file('<stdin>',p7_11) ).
fof(c_0_10,negated_conjecture,
! [X6] : p3(f4(f5(X6)),X6),
file('<stdin>',p3_9) ).
fof(c_0_11,negated_conjecture,
~ p9(f4(c12),f8(c13)),
file('<stdin>',not_p9_10) ).
fof(c_0_12,negated_conjecture,
p2(c12,f5(c15)),
file('<stdin>',p2_8) ).
fof(c_0_13,negated_conjecture,
p9(c15,f8(c13)),
file('<stdin>',p9_7) ).
fof(c_0_14,negated_conjecture,
! [X5] : p2(X5,X5),
file('<stdin>',p2_5) ).
fof(c_0_15,negated_conjecture,
! [X4] : p3(X4,X4),
file('<stdin>',p3_4) ).
fof(c_0_16,negated_conjecture,
! [X3] : p6(X3,X3),
file('<stdin>',p6_3) ).
fof(c_0_17,negated_conjecture,
! [X2] : p7(X2,X2),
file('<stdin>',p7_2) ).
fof(c_0_18,negated_conjecture,
! [X1] : p10(X1,X1),
file('<stdin>',p10_1) ).
fof(c_0_19,negated_conjecture,
p11(c12,c14),
file('<stdin>',p11_6) ).
fof(c_0_20,negated_conjecture,
! [X27,X28,X29,X30] :
( p11(X30,X29)
| ~ p11(X27,X28)
| ~ p2(X27,X30)
| ~ p10(X28,X29) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_21,negated_conjecture,
! [X23,X24,X25,X26] :
( p9(X26,X25)
| ~ p7(X23,X25)
| ~ p9(X24,X23)
| ~ p3(X24,X26) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_22,negated_conjecture,
! [X21,X22,X5] :
( p2(X22,X21)
| ~ p2(X5,X22)
| ~ p2(X5,X21) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_23,negated_conjecture,
! [X19,X20,X4] :
( p3(X20,X19)
| ~ p3(X4,X20)
| ~ p3(X4,X19) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_24,negated_conjecture,
! [X17,X18,X3] :
( p6(X18,X17)
| ~ p6(X3,X18)
| ~ p6(X3,X17) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_25,negated_conjecture,
! [X15,X16,X2] :
( p7(X16,X15)
| ~ p7(X2,X16)
| ~ p7(X2,X15) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_26,negated_conjecture,
! [X13,X14,X1] :
( p10(X14,X13)
| ~ p10(X1,X14)
| ~ p10(X1,X13) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_27,negated_conjecture,
! [X11,X12] :
( p3(f4(X12),f4(X11))
| ~ p2(X12,X11) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_28,negated_conjecture,
! [X9,X10] :
( p2(f5(X10),f5(X9))
| ~ p3(X10,X9) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_29,negated_conjecture,
! [X7,X8] :
( p7(f8(X8),f8(X7))
| ~ p6(X8,X7) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_30,negated_conjecture,
! [X6] : p3(f4(f5(X6)),X6),
c_0_10 ).
fof(c_0_31,negated_conjecture,
~ p9(f4(c12),f8(c13)),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_32,negated_conjecture,
p2(c12,f5(c15)),
c_0_12 ).
fof(c_0_33,negated_conjecture,
p9(c15,f8(c13)),
c_0_13 ).
fof(c_0_34,negated_conjecture,
! [X5] : p2(X5,X5),
c_0_14 ).
fof(c_0_35,negated_conjecture,
! [X4] : p3(X4,X4),
c_0_15 ).
fof(c_0_36,negated_conjecture,
! [X3] : p6(X3,X3),
c_0_16 ).
fof(c_0_37,negated_conjecture,
! [X2] : p7(X2,X2),
c_0_17 ).
fof(c_0_38,negated_conjecture,
! [X1] : p10(X1,X1),
c_0_18 ).
fof(c_0_39,negated_conjecture,
p11(c12,c14),
c_0_19 ).
fof(c_0_40,negated_conjecture,
! [X31,X32,X33,X34] :
( p11(X34,X33)
| ~ p11(X31,X32)
| ~ p2(X31,X34)
| ~ p10(X32,X33) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_41,negated_conjecture,
! [X27,X28,X29,X30] :
( p9(X30,X29)
| ~ p7(X27,X29)
| ~ p9(X28,X27)
| ~ p3(X28,X30) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_42,negated_conjecture,
! [X23,X24,X25] :
( p2(X24,X23)
| ~ p2(X25,X24)
| ~ p2(X25,X23) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_22])])]) ).
fof(c_0_43,negated_conjecture,
! [X21,X22,X23] :
( p3(X22,X21)
| ~ p3(X23,X22)
| ~ p3(X23,X21) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_23])])]) ).
fof(c_0_44,negated_conjecture,
! [X19,X20,X21] :
( p6(X20,X19)
| ~ p6(X21,X20)
| ~ p6(X21,X19) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_24])])]) ).
fof(c_0_45,negated_conjecture,
! [X17,X18,X19] :
( p7(X18,X17)
| ~ p7(X19,X18)
| ~ p7(X19,X17) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_25])])]) ).
fof(c_0_46,negated_conjecture,
! [X15,X16,X17] :
( p10(X16,X15)
| ~ p10(X17,X16)
| ~ p10(X17,X15) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_26])])]) ).
fof(c_0_47,negated_conjecture,
! [X13,X14] :
( p3(f4(X14),f4(X13))
| ~ p2(X14,X13) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_48,negated_conjecture,
! [X11,X12] :
( p2(f5(X12),f5(X11))
| ~ p3(X12,X11) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_49,negated_conjecture,
! [X9,X10] :
( p7(f8(X10),f8(X9))
| ~ p6(X10,X9) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_50,negated_conjecture,
! [X7] : p3(f4(f5(X7)),X7),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_51,negated_conjecture,
~ p9(f4(c12),f8(c13)),
c_0_31 ).
fof(c_0_52,negated_conjecture,
p2(c12,f5(c15)),
c_0_32 ).
fof(c_0_53,negated_conjecture,
p9(c15,f8(c13)),
c_0_33 ).
fof(c_0_54,negated_conjecture,
! [X6] : p2(X6,X6),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_55,negated_conjecture,
! [X5] : p3(X5,X5),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_56,negated_conjecture,
! [X4] : p6(X4,X4),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_57,negated_conjecture,
! [X3] : p7(X3,X3),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_58,negated_conjecture,
! [X2] : p10(X2,X2),
inference(variable_rename,[status(thm)],[c_0_38]) ).
fof(c_0_59,negated_conjecture,
p11(c12,c14),
c_0_39 ).
cnf(c_0_60,negated_conjecture,
( p11(X4,X2)
| ~ p10(X1,X2)
| ~ p2(X3,X4)
| ~ p11(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_61,negated_conjecture,
( p9(X2,X4)
| ~ p3(X1,X2)
| ~ p9(X1,X3)
| ~ p7(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_62,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_63,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_64,negated_conjecture,
( p6(X3,X2)
| ~ p6(X1,X2)
| ~ p6(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_65,negated_conjecture,
( p7(X3,X2)
| ~ p7(X1,X2)
| ~ p7(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_66,negated_conjecture,
( p10(X3,X2)
| ~ p10(X1,X2)
| ~ p10(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_67,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_68,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_69,negated_conjecture,
( p7(f8(X1),f8(X2))
| ~ p6(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_70,negated_conjecture,
p3(f4(f5(X1)),X1),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_71,negated_conjecture,
~ p9(f4(c12),f8(c13)),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_72,negated_conjecture,
p2(c12,f5(c15)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_73,negated_conjecture,
p9(c15,f8(c13)),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_74,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_75,negated_conjecture,
p3(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_76,negated_conjecture,
p6(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_77,negated_conjecture,
p7(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_78,negated_conjecture,
p10(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_79,negated_conjecture,
p11(c12,c14),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_80,negated_conjecture,
( p11(X4,X2)
| ~ p10(X1,X2)
| ~ p2(X3,X4)
| ~ p11(X3,X1) ),
c_0_60,
[final] ).
cnf(c_0_81,negated_conjecture,
( p9(X2,X4)
| ~ p3(X1,X2)
| ~ p9(X1,X3)
| ~ p7(X3,X4) ),
c_0_61,
[final] ).
cnf(c_0_82,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_62,
[final] ).
cnf(c_0_83,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
c_0_63,
[final] ).
cnf(c_0_84,negated_conjecture,
( p6(X3,X2)
| ~ p6(X1,X2)
| ~ p6(X1,X3) ),
c_0_64,
[final] ).
cnf(c_0_85,negated_conjecture,
( p7(X3,X2)
| ~ p7(X1,X2)
| ~ p7(X1,X3) ),
c_0_65,
[final] ).
cnf(c_0_86,negated_conjecture,
( p10(X3,X2)
| ~ p10(X1,X2)
| ~ p10(X1,X3) ),
c_0_66,
[final] ).
cnf(c_0_87,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_67,
[final] ).
cnf(c_0_88,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p3(X1,X2) ),
c_0_68,
[final] ).
cnf(c_0_89,negated_conjecture,
( p7(f8(X1),f8(X2))
| ~ p6(X1,X2) ),
c_0_69,
[final] ).
cnf(c_0_90,negated_conjecture,
p3(f4(f5(X1)),X1),
c_0_70,
[final] ).
cnf(c_0_91,negated_conjecture,
~ p9(f4(c12),f8(c13)),
c_0_71,
[final] ).
cnf(c_0_92,negated_conjecture,
p2(c12,f5(c15)),
c_0_72,
[final] ).
cnf(c_0_93,negated_conjecture,
p9(c15,f8(c13)),
c_0_73,
[final] ).
cnf(c_0_94,negated_conjecture,
p2(X1,X1),
c_0_74,
[final] ).
cnf(c_0_95,negated_conjecture,
p3(X1,X1),
c_0_75,
[final] ).
cnf(c_0_96,negated_conjecture,
p6(X1,X1),
c_0_76,
[final] ).
cnf(c_0_97,negated_conjecture,
p7(X1,X1),
c_0_77,
[final] ).
cnf(c_0_98,negated_conjecture,
p10(X1,X1),
c_0_78,
[final] ).
cnf(c_0_99,negated_conjecture,
p11(c12,c14),
c_0_79,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_83) ).
cnf(c_35,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_112,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_145,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_112]) ).
cnf(c_152,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_145]) ).
cnf(c_195,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_152]) ).
cnf(c_7,negated_conjecture,
( ~ p2(X0,X1)
| p3(f4(X0),f4(X1)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_87) ).
cnf(c_43,negated_conjecture,
( ~ p2(X0,X1)
| p3(f4(X0),f4(X1)) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_116,negated_conjecture,
( ~ p2(X0,X1)
| p3(f4(X0),f4(X1)) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_141,negated_conjecture,
( ~ p2(X0,X1)
| p3(f4(X0),f4(X1)) ),
inference(copy,[status(esa)],[c_116]) ).
cnf(c_156,negated_conjecture,
( ~ p2(X0,X1)
| p3(f4(X0),f4(X1)) ),
inference(copy,[status(esa)],[c_141]) ).
cnf(c_203,negated_conjecture,
( ~ p2(X0,X1)
| p3(f4(X0),f4(X1)) ),
inference(copy,[status(esa)],[c_156]) ).
cnf(c_279,plain,
( ~ p2(X0,X1)
| ~ p3(f4(X0),X2)
| p3(X2,f4(X1)) ),
inference(resolution,[status(thm)],[c_195,c_203]) ).
cnf(c_280,plain,
( ~ p2(X0,X1)
| ~ p3(f4(X0),X2)
| p3(X2,f4(X1)) ),
inference(rewriting,[status(thm)],[c_279]) ).
cnf(c_11,negated_conjecture,
p3(f4(f5(X0)),X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_90) ).
cnf(c_51,negated_conjecture,
p3(f4(f5(X0)),X0),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_120,negated_conjecture,
p3(f4(f5(X0)),X0),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_137,negated_conjecture,
p3(f4(f5(X0)),X0),
inference(copy,[status(esa)],[c_120]) ).
cnf(c_160,negated_conjecture,
p3(f4(f5(X0)),X0),
inference(copy,[status(esa)],[c_137]) ).
cnf(c_211,negated_conjecture,
p3(f4(f5(X0)),X0),
inference(copy,[status(esa)],[c_160]) ).
cnf(c_539,plain,
( ~ p2(f5(X0),X1)
| p3(X0,f4(X1)) ),
inference(resolution,[status(thm)],[c_280,c_211]) ).
cnf(c_540,plain,
( ~ p2(f5(X0),X1)
| p3(X0,f4(X1)) ),
inference(rewriting,[status(thm)],[c_539]) ).
cnf(c_1,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p3(X0,X2)
| ~ p7(X1,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_81) ).
cnf(c_31,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p3(X0,X2)
| ~ p7(X1,X3) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_110,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p3(X0,X2)
| ~ p7(X1,X3) ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_147,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p3(X0,X2)
| ~ p7(X1,X3) ),
inference(copy,[status(esa)],[c_110]) ).
cnf(c_150,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p3(X0,X2)
| ~ p7(X1,X3) ),
inference(copy,[status(esa)],[c_147]) ).
cnf(c_191,negated_conjecture,
( ~ p9(X0,X1)
| p9(X2,X3)
| ~ p3(X0,X2)
| ~ p7(X1,X3) ),
inference(copy,[status(esa)],[c_150]) ).
cnf(c_17,negated_conjecture,
p7(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_97) ).
cnf(c_63,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_126,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_131,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_126]) ).
cnf(c_166,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_131]) ).
cnf(c_223,negated_conjecture,
p7(X0,X0),
inference(copy,[status(esa)],[c_166]) ).
cnf(c_335,plain,
( ~ p9(X0,X1)
| p9(X2,X1)
| ~ p3(X0,X2) ),
inference(resolution,[status(thm)],[c_191,c_223]) ).
cnf(c_336,plain,
( ~ p9(X0,X1)
| p9(X2,X1)
| ~ p3(X0,X2) ),
inference(rewriting,[status(thm)],[c_335]) ).
cnf(c_578,plain,
( ~ p2(f5(X0),X1)
| p9(f4(X1),X2)
| ~ p9(X0,X2) ),
inference(resolution,[status(thm)],[c_540,c_336]) ).
cnf(c_581,plain,
( ~ p2(f5(X0),X1)
| p9(f4(X1),X2)
| ~ p9(X0,X2) ),
inference(rewriting,[status(thm)],[c_578]) ).
cnf(c_13,negated_conjecture,
p9(c15,f8(c13)),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_93) ).
cnf(c_55,negated_conjecture,
p9(c15,f8(c13)),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_122,negated_conjecture,
p9(c15,f8(c13)),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_135,negated_conjecture,
p9(c15,f8(c13)),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_162,negated_conjecture,
p9(c15,f8(c13)),
inference(copy,[status(esa)],[c_135]) ).
cnf(c_215,negated_conjecture,
p9(c15,f8(c13)),
inference(copy,[status(esa)],[c_162]) ).
cnf(c_3489,plain,
( ~ p2(f5(c15),X0)
| p9(f4(X0),f8(c13)) ),
inference(resolution,[status(thm)],[c_581,c_215]) ).
cnf(c_3490,plain,
( ~ p2(f5(c15),X0)
| p9(f4(X0),f8(c13)) ),
inference(rewriting,[status(thm)],[c_3489]) ).
cnf(c_10,negated_conjecture,
~ p9(f4(c12),f8(c13)),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_91) ).
cnf(c_49,negated_conjecture,
~ p9(f4(c12),f8(c13)),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_119,negated_conjecture,
~ p9(f4(c12),f8(c13)),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_138,negated_conjecture,
~ p9(f4(c12),f8(c13)),
inference(copy,[status(esa)],[c_119]) ).
cnf(c_159,negated_conjecture,
~ p9(f4(c12),f8(c13)),
inference(copy,[status(esa)],[c_138]) ).
cnf(c_209,negated_conjecture,
~ p9(f4(c12),f8(c13)),
inference(copy,[status(esa)],[c_159]) ).
cnf(c_3497,plain,
~ p2(f5(c15),c12),
inference(resolution,[status(thm)],[c_3490,c_209]) ).
cnf(c_3498,plain,
~ p2(f5(c15),c12),
inference(rewriting,[status(thm)],[c_3497]) ).
cnf(c_2,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_82) ).
cnf(c_33,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_111,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_146,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_111]) ).
cnf(c_151,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_146]) ).
cnf(c_193,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_151]) ).
cnf(c_14,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_94) ).
cnf(c_57,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_123,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_134,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_123]) ).
cnf(c_163,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_134]) ).
cnf(c_217,plain,
p2(X0,X0),
inference(copy,[status(esa)],[c_163]) ).
cnf(c_271,plain,
( ~ p2(X0,X1)
| p2(X1,X0) ),
inference(resolution,[status(thm)],[c_193,c_217]) ).
cnf(c_272,plain,
( ~ p2(X0,X1)
| p2(X1,X0) ),
inference(rewriting,[status(thm)],[c_271]) ).
cnf(c_12,negated_conjecture,
p2(c12,f5(c15)),
file('/export/starexec/sandbox/tmp/iprover_modulo_286cbe.p',c_0_92) ).
cnf(c_53,negated_conjecture,
p2(c12,f5(c15)),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_121,negated_conjecture,
p2(c12,f5(c15)),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_136,negated_conjecture,
p2(c12,f5(c15)),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_161,negated_conjecture,
p2(c12,f5(c15)),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_213,plain,
p2(c12,f5(c15)),
inference(copy,[status(esa)],[c_161]) ).
cnf(c_343,plain,
p2(f5(c15),c12),
inference(resolution,[status(thm)],[c_272,c_213]) ).
cnf(c_344,plain,
p2(f5(c15),c12),
inference(rewriting,[status(thm)],[c_343]) ).
cnf(c_3510,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3498,c_344]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN570-1 : TPTP v8.1.0. Released v2.5.0.
% 0.13/0.14 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 04:10:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % 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_6af95e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_286cbe.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_f15fbd | grep -v "SZS"
% 0.22/0.44
% 0.22/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.44
% 0.22/0.44 %
% 0.22/0.44 % ------ iProver source info
% 0.22/0.44
% 0.22/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.44 % git: non_committed_changes: true
% 0.22/0.44 % git: last_make_outside_of_git: true
% 0.22/0.44
% 0.22/0.44 %
% 0.22/0.44 % ------ Input Options
% 0.22/0.44
% 0.22/0.44 % --out_options all
% 0.22/0.44 % --tptp_safe_out true
% 0.22/0.44 % --problem_path ""
% 0.22/0.44 % --include_path ""
% 0.22/0.44 % --clausifier .//eprover
% 0.22/0.44 % --clausifier_options --tstp-format
% 0.22/0.44 % --stdin false
% 0.22/0.44 % --dbg_backtrace false
% 0.22/0.44 % --dbg_dump_prop_clauses false
% 0.22/0.44 % --dbg_dump_prop_clauses_file -
% 0.22/0.44 % --dbg_out_stat false
% 0.22/0.44
% 0.22/0.44 % ------ General Options
% 0.22/0.44
% 0.22/0.44 % --fof false
% 0.22/0.44 % --time_out_real 150.
% 0.22/0.44 % --time_out_prep_mult 0.2
% 0.22/0.44 % --time_out_virtual -1.
% 0.22/0.44 % --schedule none
% 0.22/0.44 % --ground_splitting input
% 0.22/0.44 % --splitting_nvd 16
% 0.22/0.44 % --non_eq_to_eq false
% 0.22/0.44 % --prep_gs_sim true
% 0.22/0.44 % --prep_unflatten false
% 0.22/0.44 % --prep_res_sim true
% 0.22/0.44 % --prep_upred true
% 0.22/0.44 % --res_sim_input true
% 0.22/0.44 % --clause_weak_htbl true
% 0.22/0.44 % --gc_record_bc_elim false
% 0.22/0.44 % --symbol_type_check false
% 0.22/0.44 % --clausify_out false
% 0.22/0.44 % --large_theory_mode false
% 0.22/0.44 % --prep_sem_filter none
% 0.22/0.44 % --prep_sem_filter_out false
% 0.22/0.44 % --preprocessed_out false
% 0.22/0.44 % --sub_typing false
% 0.22/0.44 % --brand_transform false
% 0.22/0.44 % --pure_diseq_elim true
% 0.22/0.44 % --min_unsat_core false
% 0.22/0.44 % --pred_elim true
% 0.22/0.44 % --add_important_lit false
% 0.22/0.44 % --soft_assumptions false
% 0.22/0.44 % --reset_solvers false
% 0.22/0.44 % --bc_imp_inh []
% 0.22/0.44 % --conj_cone_tolerance 1.5
% 0.22/0.44 % --prolific_symb_bound 500
% 0.22/0.44 % --lt_threshold 2000
% 0.22/0.44
% 0.22/0.44 % ------ SAT Options
% 0.22/0.44
% 0.22/0.44 % --sat_mode false
% 0.22/0.44 % --sat_fm_restart_options ""
% 0.22/0.44 % --sat_gr_def false
% 0.22/0.44 % --sat_epr_types true
% 0.22/0.44 % --sat_non_cyclic_types false
% 0.22/0.44 % --sat_finite_models false
% 0.22/0.44 % --sat_fm_lemmas false
% 0.22/0.44 % --sat_fm_prep false
% 0.22/0.44 % --sat_fm_uc_incr true
% 0.22/0.44 % --sat_out_model small
% 0.22/0.44 % --sat_out_clauses false
% 0.22/0.44
% 0.22/0.44 % ------ QBF Options
% 0.22/0.44
% 0.22/0.44 % --qbf_mode false
% 0.22/0.44 % --qbf_elim_univ true
% 0.22/0.44 % --qbf_sk_in true
% 0.22/0.44 % --qbf_pred_elim true
% 0.22/0.44 % --qbf_split 32
% 0.22/0.44
% 0.22/0.44 % ------ BMC1 Options
% 0.22/0.44
% 0.22/0.44 % --bmc1_incremental false
% 0.22/0.44 % --bmc1_axioms reachable_all
% 0.22/0.44 % --bmc1_min_bound 0
% 0.22/0.44 % --bmc1_max_bound -1
% 0.22/0.44 % --bmc1_max_bound_default -1
% 0.22/0.44 % --bmc1_symbol_reachability true
% 0.22/0.44 % --bmc1_property_lemmas false
% 0.22/0.44 % --bmc1_k_induction false
% 0.22/0.44 % --bmc1_non_equiv_states false
% 0.22/0.44 % --bmc1_deadlock false
% 0.22/0.44 % --bmc1_ucm false
% 0.22/0.44 % --bmc1_add_unsat_core none
% 0.22/0.44 % --bmc1_unsat_core_children false
% 0.22/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.44 % --bmc1_out_stat full
% 0.22/0.44 % --bmc1_ground_init false
% 0.22/0.44 % --bmc1_pre_inst_next_state false
% 0.22/0.44 % --bmc1_pre_inst_state false
% 0.22/0.44 % --bmc1_pre_inst_reach_state false
% 0.22/0.44 % --bmc1_out_unsat_core false
% 0.22/0.44 % --bmc1_aig_witness_out false
% 0.22/0.44 % --bmc1_verbose false
% 0.22/0.44 % --bmc1_dump_clauses_tptp false
% 0.22/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.45 % --bmc1_dump_file -
% 0.22/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.45 % --bmc1_ucm_extend_mode 1
% 0.22/0.45 % --bmc1_ucm_init_mode 2
% 0.22/0.45 % --bmc1_ucm_cone_mode none
% 0.22/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.45 % --bmc1_ucm_relax_model 4
% 0.22/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.45 % --bmc1_ucm_layered_model none
% 0.22/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.45
% 0.22/0.45 % ------ AIG Options
% 0.22/0.45
% 0.22/0.45 % --aig_mode false
% 0.22/0.45
% 0.22/0.45 % ------ Instantiation Options
% 0.22/0.45
% 0.22/0.45 % --instantiation_flag true
% 0.22/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.45 % --inst_solver_per_active 750
% 0.22/0.45 % --inst_solver_calls_frac 0.5
% 0.22/0.45 % --inst_passive_queue_type priority_queues
% 0.22/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.45 % --inst_passive_queues_freq [25;2]
% 0.22/0.45 % --inst_dismatching true
% 0.22/0.45 % --inst_eager_unprocessed_to_passive true
% 0.22/0.45 % --inst_prop_sim_given true
% 0.22/0.45 % --inst_prop_sim_new false
% 0.22/0.45 % --inst_orphan_elimination true
% 0.22/0.45 % --inst_learning_loop_flag true
% 0.22/0.45 % --inst_learning_start 3000
% 0.22/0.45 % --inst_learning_factor 2
% 0.22/0.45 % --inst_start_prop_sim_after_learn 3
% 0.22/0.45 % --inst_sel_renew solver
% 0.22/0.45 % --inst_lit_activity_flag true
% 0.22/0.45 % --inst_out_proof true
% 0.22/0.45
% 0.22/0.45 % ------ Resolution Options
% 0.22/0.45
% 0.22/0.45 % --resolution_flag true
% 0.22/0.45 % --res_lit_sel kbo_max
% 0.22/0.45 % --res_to_prop_solver none
% 0.22/0.45 % --res_prop_simpl_new false
% 0.22/0.45 % --res_prop_simpl_given false
% 0.22/0.45 % --res_passive_queue_type priority_queues
% 0.22/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.45 % --res_passive_queues_freq [15;5]
% 0.22/0.45 % --res_forward_subs full
% 0.22/0.45 % --res_backward_subs full
% 0.22/0.45 % --res_forward_subs_resolution true
% 0.22/0.45 % --res_backward_subs_resolution true
% 0.22/0.45 % --res_orphan_elimination false
% 0.22/0.45 % --res_time_limit 1000.
% 0.22/0.45 % --res_out_proof true
% 0.22/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6af95e.s
% 0.22/0.45 % --modulo true
% 0.22/0.45
% 0.22/0.45 % ------ Combination Options
% 0.22/0.45
% 0.22/0.45 % --comb_res_mult 1000
% 0.22/0.45 % --comb_inst_mult 300
% 0.22/0.45 % ------
% 0.22/0.45
% 0.22/0.45 % ------ Parsing...% successful
% 0.22/0.45
% 0.22/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.22/0.45
% 0.22/0.45 % ------ Proving...
% 0.22/0.45 % ------ Problem Properties
% 0.22/0.45
% 0.22/0.45 %
% 0.22/0.45 % EPR false
% 0.22/0.45 % Horn true
% 0.22/0.45 % Has equality false
% 0.22/0.45
% 0.22/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45 % % ------ Current options:
% 0.22/0.45
% 0.22/0.45 % ------ Input Options
% 0.22/0.45
% 0.22/0.45 % --out_options all
% 0.22/0.45 % --tptp_safe_out true
% 0.22/0.45 % --problem_path ""
% 0.22/0.45 % --include_path ""
% 0.22/0.45 % --clausifier .//eprover
% 0.22/0.45 % --clausifier_options --tstp-format
% 0.22/0.45 % --stdin false
% 0.22/0.45 % --dbg_backtrace false
% 0.22/0.45 % --dbg_dump_prop_clauses false
% 0.22/0.45 % --dbg_dump_prop_clauses_file -
% 0.22/0.45 % --dbg_out_stat false
% 0.22/0.45
% 0.22/0.45 % ------ General Options
% 0.22/0.45
% 0.22/0.45 % --fof false
% 0.22/0.45 % --time_out_real 150.
% 0.22/0.45 % --time_out_prep_mult 0.2
% 0.22/0.45 % --time_out_virtual -1.
% 0.22/0.45 % --schedule none
% 0.22/0.45 % --ground_splitting input
% 0.22/0.45 % --splitting_nvd 16
% 0.22/0.45 % --non_eq_to_eq false
% 0.22/0.45 % --prep_gs_sim true
% 0.22/0.45 % --prep_unflatten false
% 0.22/0.45 % --prep_res_sim true
% 0.22/0.45 % --prep_upred true
% 0.22/0.45 % --res_sim_input true
% 0.22/0.45 % --clause_weak_htbl true
% 0.22/0.45 % --gc_record_bc_elim false
% 0.22/0.45 % --symbol_type_check false
% 0.22/0.45 % --clausify_out false
% 0.22/0.45 % --large_theory_mode false
% 0.22/0.45 % --prep_sem_filter none
% 0.22/0.45 % --prep_sem_filter_out false
% 0.22/0.45 % --preprocessed_out false
% 0.22/0.45 % --sub_typing false
% 0.22/0.45 % --brand_transform false
% 0.22/0.45 % --pure_diseq_elim true
% 0.22/0.45 % --min_unsat_core false
% 0.22/0.45 % --pred_elim true
% 0.22/0.45 % --add_important_lit false
% 0.22/0.45 % --soft_assumptions false
% 0.22/0.45 % --reset_solvers false
% 0.22/0.45 % --bc_imp_inh []
% 0.22/0.45 % --conj_cone_tolerance 1.5
% 0.22/0.45 % --prolific_symb_bound 500
% 0.22/0.45 % --lt_threshold 2000
% 0.22/0.45
% 0.22/0.45 % ------ SAT Options
% 0.22/0.45
% 0.22/0.45 % --sat_mode false
% 0.22/0.45 % --sat_fm_restart_options ""
% 0.22/0.45 % --sat_gr_def false
% 0.22/0.45 % --sat_epr_types true
% 0.22/0.45 % --sat_non_cyclic_types false
% 0.22/0.45 % --sat_finite_models false
% 0.22/0.45 % --sat_fm_lemmas false
% 0.22/0.45 % --sat_fm_prep false
% 0.22/0.45 % --sat_fm_uc_incr true
% 0.22/0.45 % --sat_out_model small
% 0.22/0.45 % --sat_out_clauses false
% 0.22/0.45
% 0.22/0.45 % ------ QBF Options
% 0.22/0.45
% 0.22/0.45 % --qbf_mode false
% 0.22/0.45 % --qbf_elim_univ true
% 0.22/0.45 % --qbf_sk_in true
% 0.22/0.45 % --qbf_pred_elim true
% 0.22/0.45 % --qbf_split 32
% 0.22/0.45
% 0.22/0.45 % ------ BMC1 Options
% 0.22/0.45
% 0.22/0.45 % --bmc1_incremental false
% 0.22/0.45 % --bmc1_axioms reachable_all
% 0.22/0.45 % --bmc1_min_bound 0
% 0.22/0.45 % --bmc1_max_bound -1
% 0.22/0.45 % --bmc1_max_bound_default -1
% 0.22/0.45 % --bmc1_symbol_reachability true
% 0.22/0.45 % --bmc1_property_lemmas false
% 0.22/0.45 % --bmc1_k_induction false
% 0.22/0.45 % --bmc1_non_equiv_states false
% 0.22/0.45 % --bmc1_deadlock false
% 0.22/0.45 % --bmc1_ucm false
% 0.22/0.45 % --bmc1_add_unsat_core none
% 0.22/0.45 % --bmc1_unsat_core_children false
% 0.22/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.45 % --bmc1_out_stat full
% 0.22/0.45 % --bmc1_ground_init false
% 0.22/0.45 % --bmc1_pre_inst_next_state false
% 0.22/0.45 % --bmc1_pre_inst_state false
% 0.22/0.45 % --bmc1_pre_inst_reach_state false
% 0.22/0.45 % --bmc1_out_unsat_core false
% 0.22/0.45 % --bmc1_aig_witness_out false
% 0.22/0.45 % --bmc1_verbose false
% 0.22/0.45 % --bmc1_dump_clauses_tptp false
% 0.22/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.45 % --bmc1_dump_file -
% 0.22/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.45 % --bmc1_ucm_extend_mode 1
% 0.22/0.45 % --bmc1_ucm_init_mode 2
% 0.22/0.45 % --bmc1_ucm_cone_mode none
% 0.22/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.45 % --bmc1_ucm_relax_model 4
% 0.22/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.45 % --bmc1_ucm_layered_model none
% 0.22/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.45
% 0.22/0.45 % ------ AIG Options
% 0.22/0.45
% 0.22/0.45 % --aig_mode false
% 0.22/0.45
% 0.22/0.45 % ------ Instantiation Options
% 0.22/0.45
% 0.22/0.45 % --instantiation_flag true
% 0.22/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.45 % --inst_solver_per_active 750
% 0.22/0.45 % --inst_solver_calls_frac 0.5
% 0.22/0.45 % --inst_passive_queue_type priority_queues
% 0.22/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.45 % --inst_passive_queues_freq [25;2]
% 0.22/0.45 % --inst_dismatching true
% 0.22/0.45 % --inst_eager_unprocessed_to_passive true
% 0.22/0.45 % --inst_prop_sim_given true
% 0.22/0.52 % --inst_prop_sim_new false
% 0.22/0.52 % --inst_orphan_elimination true
% 0.22/0.52 % --inst_learning_loop_flag true
% 0.22/0.52 % --inst_learning_start 3000
% 0.22/0.52 % --inst_learning_factor 2
% 0.22/0.52 % --inst_start_prop_sim_after_learn 3
% 0.22/0.52 % --inst_sel_renew solver
% 0.22/0.52 % --inst_lit_activity_flag true
% 0.22/0.52 % --inst_out_proof true
% 0.22/0.52
% 0.22/0.52 % ------ Resolution Options
% 0.22/0.52
% 0.22/0.52 % --resolution_flag true
% 0.22/0.52 % --res_lit_sel kbo_max
% 0.22/0.52 % --res_to_prop_solver none
% 0.22/0.52 % --res_prop_simpl_new false
% 0.22/0.52 % --res_prop_simpl_given false
% 0.22/0.52 % --res_passive_queue_type priority_queues
% 0.22/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.52 % --res_passive_queues_freq [15;5]
% 0.22/0.52 % --res_forward_subs full
% 0.22/0.52 % --res_backward_subs full
% 0.22/0.52 % --res_forward_subs_resolution true
% 0.22/0.52 % --res_backward_subs_resolution true
% 0.22/0.52 % --res_orphan_elimination false
% 0.22/0.52 % --res_time_limit 1000.
% 0.22/0.52 % --res_out_proof true
% 0.22/0.52 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6af95e.s
% 0.22/0.52 % --modulo true
% 0.22/0.52
% 0.22/0.52 % ------ Combination Options
% 0.22/0.52
% 0.22/0.52 % --comb_res_mult 1000
% 0.22/0.52 % --comb_inst_mult 300
% 0.22/0.52 % ------
% 0.22/0.52
% 0.22/0.52
% 0.22/0.52
% 0.22/0.52 % ------ Proving...
% 0.22/0.52 %
% 0.22/0.52
% 0.22/0.52
% 0.22/0.52 % Resolution empty clause
% 0.22/0.52
% 0.22/0.52 % ------ Statistics
% 0.22/0.52
% 0.22/0.52 % ------ General
% 0.22/0.52
% 0.22/0.52 % num_of_input_clauses: 20
% 0.22/0.52 % num_of_input_neg_conjectures: 20
% 0.22/0.52 % num_of_splits: 0
% 0.22/0.52 % num_of_split_atoms: 0
% 0.22/0.52 % num_of_sem_filtered_clauses: 0
% 0.22/0.52 % num_of_subtypes: 0
% 0.22/0.52 % monotx_restored_types: 0
% 0.22/0.52 % sat_num_of_epr_types: 0
% 0.22/0.52 % sat_num_of_non_cyclic_types: 0
% 0.22/0.52 % sat_guarded_non_collapsed_types: 0
% 0.22/0.52 % is_epr: 0
% 0.22/0.52 % is_horn: 1
% 0.22/0.52 % has_eq: 0
% 0.22/0.52 % num_pure_diseq_elim: 0
% 0.22/0.52 % simp_replaced_by: 0
% 0.22/0.52 % res_preprocessed: 40
% 0.22/0.52 % prep_upred: 0
% 0.22/0.52 % prep_unflattend: 0
% 0.22/0.52 % pred_elim_cands: 0
% 0.22/0.52 % pred_elim: 0
% 0.22/0.52 % pred_elim_cl: 0
% 0.22/0.52 % pred_elim_cycles: 0
% 0.22/0.52 % forced_gc_time: 0
% 0.22/0.52 % gc_basic_clause_elim: 0
% 0.22/0.52 % parsing_time: 0.
% 0.22/0.52 % sem_filter_time: 0.
% 0.22/0.52 % pred_elim_time: 0.
% 0.22/0.52 % out_proof_time: 0.002
% 0.22/0.52 % monotx_time: 0.
% 0.22/0.52 % subtype_inf_time: 0.
% 0.22/0.52 % unif_index_cands_time: 0.
% 0.22/0.52 % unif_index_add_time: 0.
% 0.22/0.52 % total_time: 0.094
% 0.22/0.52 % num_of_symbols: 39
% 0.22/0.52 % num_of_terms: 844
% 0.22/0.52
% 0.22/0.52 % ------ Propositional Solver
% 0.22/0.52
% 0.22/0.52 % prop_solver_calls: 1
% 0.22/0.52 % prop_fast_solver_calls: 117
% 0.22/0.52 % prop_num_of_clauses: 29
% 0.22/0.52 % prop_preprocess_simplified: 331
% 0.22/0.52 % prop_fo_subsumed: 0
% 0.22/0.52 % prop_solver_time: 0.
% 0.22/0.52 % prop_fast_solver_time: 0.
% 0.22/0.52 % prop_unsat_core_time: 0.
% 0.22/0.52
% 0.22/0.52 % ------ QBF
% 0.22/0.52
% 0.22/0.52 % qbf_q_res: 0
% 0.22/0.52 % qbf_num_tautologies: 0
% 0.22/0.52 % qbf_prep_cycles: 0
% 0.22/0.52
% 0.22/0.52 % ------ BMC1
% 0.22/0.52
% 0.22/0.52 % bmc1_current_bound: -1
% 0.22/0.52 % bmc1_last_solved_bound: -1
% 0.22/0.52 % bmc1_unsat_core_size: -1
% 0.22/0.52 % bmc1_unsat_core_parents_size: -1
% 0.22/0.52 % bmc1_merge_next_fun: 0
% 0.22/0.52 % bmc1_unsat_core_clauses_time: 0.
% 0.22/0.52
% 0.22/0.52 % ------ Instantiation
% 0.22/0.52
% 0.22/0.52 % inst_num_of_clauses: 20
% 0.22/0.52 % inst_num_in_passive: 0
% 0.22/0.52 % inst_num_in_active: 0
% 0.22/0.52 % inst_num_in_unprocessed: 20
% 0.22/0.52 % inst_num_of_loops: 0
% 0.22/0.52 % inst_num_of_learning_restarts: 0
% 0.22/0.52 % inst_num_moves_active_passive: 0
% 0.22/0.52 % inst_lit_activity: 0
% 0.22/0.52 % inst_lit_activity_moves: 0
% 0.22/0.52 % inst_num_tautologies: 0
% 0.22/0.52 % inst_num_prop_implied: 0
% 0.22/0.52 % inst_num_existing_simplified: 0
% 0.22/0.52 % inst_num_eq_res_simplified: 0
% 0.22/0.52 % inst_num_child_elim: 0
% 0.22/0.52 % inst_num_of_dismatching_blockings: 0
% 0.22/0.52 % inst_num_of_non_proper_insts: 0
% 0.22/0.52 % inst_num_of_duplicates: 0
% 0.22/0.52 % inst_inst_num_from_inst_to_res: 0
% 0.22/0.52 % inst_dismatching_checking_time: 0.
% 0.22/0.52
% 0.22/0.52 % ------ Resolution
% 0.22/0.52
% 0.22/0.52 % res_num_of_clauses: 990
% 0.22/0.52 % res_num_in_passive: 848
% 0.22/0.52 % res_num_in_active: 144
% 0.22/0.52 % res_num_of_loops: 162
% 0.22/0.52 % res_forward_subset_subsumed: 283
% 0.22/0.52 % res_backward_subset_subsumed: 3
% 0.22/0.52 % res_forward_subsumed: 17
% 0.22/0.52 % res_backward_subsumed: 0
% 0.22/0.52 % res_forward_subsumption_resolution: 1
% 0.22/0.52 % res_backward_subsumption_resolution: 0
% 0.22/0.52 % res_clause_to_clause_subsumption: 1255
% 0.22/0.52 % res_orphan_elimination: 0
% 0.22/0.52 % res_tautology_del: 11
% 0.22/0.52 % res_num_eq_res_simplified: 0
% 0.22/0.52 % res_num_sel_changes: 0
% 0.22/0.52 % res_moves_from_active_to_pass: 0
% 0.22/0.52
% 0.22/0.52 % Status Unsatisfiable
% 0.22/0.52 % SZS status Unsatisfiable
% 0.22/0.52 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------