TSTP Solution File: SYN569-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN569-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n010.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 1.81s 2.01s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 31
% Syntax : Number of formulae : 165 ( 48 unt; 0 def)
% Number of atoms : 401 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 484 ( 248 ~; 236 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 329 ( 0 sgn 132 !; 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,
! [X42] :
( ~ p8(X42,c12)
| ~ p8(c11,X42)
| ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X42))) ),
file('<stdin>',not_p8_20) ).
fof(c_0_1,negated_conjecture,
! [X36,X37,X38,X39,X40,X41] :
( p9(X41,X40,X39)
| ~ p2(X38,X40)
| ~ p2(X37,X39)
| ~ p6(X36,X41)
| ~ p9(X36,X38,X37) ),
file('<stdin>',p9_19) ).
fof(c_0_2,negated_conjecture,
! [X11,X12,X13,X14] :
( p2(X11,X14)
| ~ p9(X13,X11,X12)
| ~ p9(X13,X14,X12) ),
file('<stdin>',p2_11) ).
fof(c_0_3,negated_conjecture,
p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
file('<stdin>',p2_15) ).
fof(c_0_4,negated_conjecture,
! [X32,X33,X34,X35] :
( p2(f5(X35,X34),f5(X33,X32))
| ~ p2(X35,X33)
| ~ p2(X34,X32) ),
file('<stdin>',p2_18) ).
fof(c_0_5,negated_conjecture,
! [X28,X29,X30,X31] :
( p2(f7(X31,X30),f7(X29,X28))
| ~ p2(X30,X28)
| ~ p6(X31,X29) ),
file('<stdin>',p2_17) ).
fof(c_0_6,negated_conjecture,
! [X24,X25,X26,X27] :
( p2(f4(X27,X26),f4(X25,X24))
| ~ p2(X27,X25)
| ~ p2(X26,X24) ),
file('<stdin>',p2_16) ).
fof(c_0_7,negated_conjecture,
! [X15] :
( p9(c13,f3(X15),X15)
| ~ p10(X15,c12)
| ~ p10(c11,X15) ),
file('<stdin>',p9_12) ).
fof(c_0_8,negated_conjecture,
! [X20,X21,X22,X23] :
( p8(X23,X22)
| ~ p2(X20,X22)
| ~ p8(X21,X20)
| ~ p2(X21,X23) ),
file('<stdin>',p8_14) ).
fof(c_0_9,negated_conjecture,
! [X16,X17,X18,X19] :
( p10(X19,X18)
| ~ p2(X17,X19)
| ~ p2(X16,X18)
| ~ p10(X17,X16) ),
file('<stdin>',p10_13) ).
fof(c_0_10,negated_conjecture,
! [X9,X10,X1] :
( p2(X10,X9)
| ~ p2(X1,X10)
| ~ p2(X1,X9) ),
file('<stdin>',p2_10) ).
fof(c_0_11,negated_conjecture,
! [X7,X8,X2] :
( p6(X8,X7)
| ~ p6(X2,X8)
| ~ p6(X2,X7) ),
file('<stdin>',p6_9) ).
fof(c_0_12,negated_conjecture,
p9(c13,c15,c14),
file('<stdin>',p9_6) ).
fof(c_0_13,negated_conjecture,
! [X5,X6] :
( p2(f3(X6),f3(X5))
| ~ p2(X6,X5) ),
file('<stdin>',p2_8) ).
fof(c_0_14,negated_conjecture,
! [X3,X4] :
( p10(X4,X3)
| ~ p8(X4,X3) ),
file('<stdin>',p10_7) ).
fof(c_0_15,negated_conjecture,
! [X2] : p6(X2,X2),
file('<stdin>',p6_2) ).
fof(c_0_16,negated_conjecture,
! [X1] : p2(X1,X1),
file('<stdin>',p2_1) ).
fof(c_0_17,negated_conjecture,
p8(c11,c14),
file('<stdin>',p8_5) ).
fof(c_0_18,negated_conjecture,
p8(c11,c12),
file('<stdin>',p8_4) ).
fof(c_0_19,negated_conjecture,
p8(c14,c12),
file('<stdin>',p8_3) ).
fof(c_0_20,negated_conjecture,
! [X42] :
( ~ p8(X42,c12)
| ~ p8(c11,X42)
| ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X42))) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_21,negated_conjecture,
! [X36,X37,X38,X39,X40,X41] :
( p9(X41,X40,X39)
| ~ p2(X38,X40)
| ~ p2(X37,X39)
| ~ p6(X36,X41)
| ~ p9(X36,X38,X37) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_22,negated_conjecture,
! [X11,X12,X13,X14] :
( p2(X11,X14)
| ~ p9(X13,X11,X12)
| ~ p9(X13,X14,X12) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_23,negated_conjecture,
p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
c_0_3 ).
fof(c_0_24,negated_conjecture,
! [X32,X33,X34,X35] :
( p2(f5(X35,X34),f5(X33,X32))
| ~ p2(X35,X33)
| ~ p2(X34,X32) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_25,negated_conjecture,
! [X28,X29,X30,X31] :
( p2(f7(X31,X30),f7(X29,X28))
| ~ p2(X30,X28)
| ~ p6(X31,X29) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_26,negated_conjecture,
! [X24,X25,X26,X27] :
( p2(f4(X27,X26),f4(X25,X24))
| ~ p2(X27,X25)
| ~ p2(X26,X24) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_27,negated_conjecture,
! [X15] :
( p9(c13,f3(X15),X15)
| ~ p10(X15,c12)
| ~ p10(c11,X15) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_28,negated_conjecture,
! [X20,X21,X22,X23] :
( p8(X23,X22)
| ~ p2(X20,X22)
| ~ p8(X21,X20)
| ~ p2(X21,X23) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_29,negated_conjecture,
! [X16,X17,X18,X19] :
( p10(X19,X18)
| ~ p2(X17,X19)
| ~ p2(X16,X18)
| ~ p10(X17,X16) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_30,negated_conjecture,
! [X9,X10,X1] :
( p2(X10,X9)
| ~ p2(X1,X10)
| ~ p2(X1,X9) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_31,negated_conjecture,
! [X7,X8,X2] :
( p6(X8,X7)
| ~ p6(X2,X8)
| ~ p6(X2,X7) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_32,negated_conjecture,
p9(c13,c15,c14),
c_0_12 ).
fof(c_0_33,negated_conjecture,
! [X5,X6] :
( p2(f3(X6),f3(X5))
| ~ p2(X6,X5) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_34,negated_conjecture,
! [X3,X4] :
( p10(X4,X3)
| ~ p8(X4,X3) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_35,negated_conjecture,
! [X2] : p6(X2,X2),
c_0_15 ).
fof(c_0_36,negated_conjecture,
! [X1] : p2(X1,X1),
c_0_16 ).
fof(c_0_37,negated_conjecture,
p8(c11,c14),
c_0_17 ).
fof(c_0_38,negated_conjecture,
p8(c11,c12),
c_0_18 ).
fof(c_0_39,negated_conjecture,
p8(c14,c12),
c_0_19 ).
fof(c_0_40,negated_conjecture,
! [X43] :
( ~ p8(X43,c12)
| ~ p8(c11,X43)
| ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X43))) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_41,negated_conjecture,
! [X42,X43,X44,X45,X46,X47] :
( p9(X47,X46,X45)
| ~ p2(X44,X46)
| ~ p2(X43,X45)
| ~ p6(X42,X47)
| ~ p9(X42,X44,X43) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_42,negated_conjecture,
! [X15,X16,X17,X18] :
( p2(X15,X18)
| ~ p9(X17,X15,X16)
| ~ p9(X17,X18,X16) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_43,negated_conjecture,
p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
c_0_23 ).
fof(c_0_44,negated_conjecture,
! [X36,X37,X38,X39] :
( p2(f5(X39,X38),f5(X37,X36))
| ~ p2(X39,X37)
| ~ p2(X38,X36) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_45,negated_conjecture,
! [X32,X33,X34,X35] :
( p2(f7(X35,X34),f7(X33,X32))
| ~ p2(X34,X32)
| ~ p6(X35,X33) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_46,negated_conjecture,
! [X28,X29,X30,X31] :
( p2(f4(X31,X30),f4(X29,X28))
| ~ p2(X31,X29)
| ~ p2(X30,X28) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_47,negated_conjecture,
! [X16] :
( p9(c13,f3(X16),X16)
| ~ p10(X16,c12)
| ~ p10(c11,X16) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_48,negated_conjecture,
! [X24,X25,X26,X27] :
( p8(X27,X26)
| ~ p2(X24,X26)
| ~ p8(X25,X24)
| ~ p2(X25,X27) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_49,negated_conjecture,
! [X20,X21,X22,X23] :
( p10(X23,X22)
| ~ p2(X21,X23)
| ~ p2(X20,X22)
| ~ p10(X21,X20) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_50,negated_conjecture,
! [X11,X12,X13] :
( p2(X12,X11)
| ~ p2(X13,X12)
| ~ p2(X13,X11) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_30])])]) ).
fof(c_0_51,negated_conjecture,
! [X9,X10,X11] :
( p6(X10,X9)
| ~ p6(X11,X10)
| ~ p6(X11,X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_31])])]) ).
fof(c_0_52,negated_conjecture,
p9(c13,c15,c14),
c_0_32 ).
fof(c_0_53,negated_conjecture,
! [X7,X8] :
( p2(f3(X8),f3(X7))
| ~ p2(X8,X7) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_54,negated_conjecture,
! [X5,X6] :
( p10(X6,X5)
| ~ p8(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_55,negated_conjecture,
! [X3] : p6(X3,X3),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_56,negated_conjecture,
! [X2] : p2(X2,X2),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_57,negated_conjecture,
p8(c11,c14),
c_0_37 ).
fof(c_0_58,negated_conjecture,
p8(c11,c12),
c_0_38 ).
fof(c_0_59,negated_conjecture,
p8(c14,c12),
c_0_39 ).
cnf(c_0_60,negated_conjecture,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X1)))
| ~ p8(c11,X1)
| ~ p8(X1,c12) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_61,negated_conjecture,
( p9(X4,X6,X5)
| ~ p9(X1,X2,X3)
| ~ p6(X1,X4)
| ~ p2(X3,X5)
| ~ p2(X2,X6) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_62,negated_conjecture,
( p2(X4,X2)
| ~ p9(X1,X2,X3)
| ~ p9(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_63,negated_conjecture,
p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_64,negated_conjecture,
( p2(f5(X3,X1),f5(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_65,negated_conjecture,
( p2(f7(X1,X3),f7(X2,X4))
| ~ p6(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_66,negated_conjecture,
( p2(f4(X3,X1),f4(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_67,negated_conjecture,
( p9(c13,f3(X1),X1)
| ~ p10(c11,X1)
| ~ p10(X1,c12) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_68,negated_conjecture,
( p8(X2,X4)
| ~ p2(X1,X2)
| ~ p8(X1,X3)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_69,negated_conjecture,
( p10(X4,X3)
| ~ p10(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_70,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_71,negated_conjecture,
( p6(X3,X2)
| ~ p6(X1,X2)
| ~ p6(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_72,negated_conjecture,
p9(c13,c15,c14),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_73,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_74,negated_conjecture,
( p10(X1,X2)
| ~ p8(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_75,negated_conjecture,
p6(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_76,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_77,negated_conjecture,
p8(c11,c14),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_78,negated_conjecture,
p8(c11,c12),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_79,negated_conjecture,
p8(c14,c12),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_80,negated_conjecture,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X1)))
| ~ p8(c11,X1)
| ~ p8(X1,c12) ),
c_0_60,
[final] ).
cnf(c_0_81,negated_conjecture,
( p9(X4,X6,X5)
| ~ p9(X1,X2,X3)
| ~ p6(X1,X4)
| ~ p2(X3,X5)
| ~ p2(X2,X6) ),
c_0_61,
[final] ).
cnf(c_0_82,negated_conjecture,
( p2(X4,X2)
| ~ p9(X1,X2,X3)
| ~ p9(X1,X4,X3) ),
c_0_62,
[final] ).
cnf(c_0_83,negated_conjecture,
p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
c_0_63,
[final] ).
cnf(c_0_84,negated_conjecture,
( p2(f5(X3,X1),f5(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_64,
[final] ).
cnf(c_0_85,negated_conjecture,
( p2(f7(X1,X3),f7(X2,X4))
| ~ p6(X1,X2)
| ~ p2(X3,X4) ),
c_0_65,
[final] ).
cnf(c_0_86,negated_conjecture,
( p2(f4(X3,X1),f4(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_66,
[final] ).
cnf(c_0_87,negated_conjecture,
( p9(c13,f3(X1),X1)
| ~ p10(c11,X1)
| ~ p10(X1,c12) ),
c_0_67,
[final] ).
cnf(c_0_88,negated_conjecture,
( p8(X2,X4)
| ~ p2(X1,X2)
| ~ p8(X1,X3)
| ~ p2(X3,X4) ),
c_0_68,
[final] ).
cnf(c_0_89,negated_conjecture,
( p10(X4,X3)
| ~ p10(X1,X2)
| ~ p2(X2,X3)
| ~ p2(X1,X4) ),
c_0_69,
[final] ).
cnf(c_0_90,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_70,
[final] ).
cnf(c_0_91,negated_conjecture,
( p6(X3,X2)
| ~ p6(X1,X2)
| ~ p6(X1,X3) ),
c_0_71,
[final] ).
cnf(c_0_92,negated_conjecture,
p9(c13,c15,c14),
c_0_72,
[final] ).
cnf(c_0_93,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
c_0_73,
[final] ).
cnf(c_0_94,negated_conjecture,
( p10(X1,X2)
| ~ p8(X1,X2) ),
c_0_74,
[final] ).
cnf(c_0_95,negated_conjecture,
p6(X1,X1),
c_0_75,
[final] ).
cnf(c_0_96,negated_conjecture,
p2(X1,X1),
c_0_76,
[final] ).
cnf(c_0_97,negated_conjecture,
p8(c11,c14),
c_0_77,
[final] ).
cnf(c_0_98,negated_conjecture,
p8(c11,c12),
c_0_78,
[final] ).
cnf(c_0_99,negated_conjecture,
p8(c14,c12),
c_0_79,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_16,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_96) ).
cnf(c_61,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_125,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_132,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_125]) ).
cnf(c_165,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_132]) ).
cnf(c_185,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_165]) ).
cnf(c_74039,plain,
p2(f5(f7(c13,c12),f7(c13,c11)),f5(f7(c13,c12),f7(c13,c11))),
inference(instantiation,[status(thm)],[c_185]) ).
cnf(c_9,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_90) ).
cnf(c_47,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_118,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_139,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_158,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_139]) ).
cnf(c_178,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_158]) ).
cnf(c_73870,plain,
( p2(f4(f5(c12,c11),c15),f5(f7(c13,c12),f7(c13,c11)))
| ~ p2(X0,f5(f7(c13,c12),f7(c13,c11)))
| ~ p2(X0,f4(f5(c12,c11),c15)) ),
inference(instantiation,[status(thm)],[c_178]) ).
cnf(c_73944,plain,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f5(f7(c13,c12),f7(c13,c11)))
| ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15))
| p2(f4(f5(c12,c11),c15),f5(f7(c13,c12),f7(c13,c11))) ),
inference(instantiation,[status(thm)],[c_73870]) ).
cnf(c_73346,plain,
( p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(c14)))
| ~ p2(X0,f5(f7(c13,c12),f7(c13,c11)))
| ~ p2(X0,f4(f5(c12,c11),f3(c14))) ),
inference(instantiation,[status(thm)],[c_178]) ).
cnf(c_73360,plain,
( p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(c14)))
| ~ p2(f4(X0,X1),f5(f7(c13,c12),f7(c13,c11)))
| ~ p2(f4(X0,X1),f4(f5(c12,c11),f3(c14))) ),
inference(instantiation,[status(thm)],[c_73346]) ).
cnf(c_73761,plain,
( p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(c14)))
| ~ p2(f4(f5(c12,c11),c15),f5(f7(c13,c12),f7(c13,c11)))
| ~ p2(f4(f5(c12,c11),c15),f4(f5(c12,c11),f3(c14))) ),
inference(instantiation,[status(thm)],[c_73360]) ).
cnf(c_5,negated_conjecture,
( p2(f4(X0,X1),f4(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_86) ).
cnf(c_39,negated_conjecture,
( p2(f4(X0,X1),f4(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_114,negated_conjecture,
( p2(f4(X0,X1),f4(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_143,negated_conjecture,
( p2(f4(X0,X1),f4(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_154,negated_conjecture,
( p2(f4(X0,X1),f4(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_143]) ).
cnf(c_174,negated_conjecture,
( p2(f4(X0,X1),f4(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_154]) ).
cnf(c_73361,plain,
( p2(f4(X0,X1),f4(f5(c12,c11),f3(c14)))
| ~ p2(X0,f5(c12,c11))
| ~ p2(X1,f3(c14)) ),
inference(instantiation,[status(thm)],[c_174]) ).
cnf(c_73622,plain,
( p2(f4(X0,c15),f4(f5(c12,c11),f3(c14)))
| ~ p2(c15,f3(c14))
| ~ p2(X0,f5(c12,c11)) ),
inference(instantiation,[status(thm)],[c_73361]) ).
cnf(c_73692,plain,
( ~ p2(f5(X0,X1),f5(c12,c11))
| p2(f4(f5(X0,X1),c15),f4(f5(c12,c11),f3(c14)))
| ~ p2(c15,f3(c14)) ),
inference(instantiation,[status(thm)],[c_73622]) ).
cnf(c_73735,plain,
( ~ p2(f5(c12,c11),f5(c12,c11))
| p2(f4(f5(c12,c11),c15),f4(f5(c12,c11),f3(c14)))
| ~ p2(c15,f3(c14)) ),
inference(instantiation,[status(thm)],[c_73692]) ).
cnf(c_73667,plain,
p2(f5(c12,c11),f5(c12,c11)),
inference(instantiation,[status(thm)],[c_185]) ).
cnf(c_2,negated_conjecture,
( p2(X0,X1)
| ~ p9(X2,X0,X3)
| ~ p9(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_82) ).
cnf(c_33,negated_conjecture,
( p2(X0,X1)
| ~ p9(X2,X0,X3)
| ~ p9(X2,X1,X3) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_111,negated_conjecture,
( p2(X0,X1)
| ~ p9(X2,X0,X3)
| ~ p9(X2,X1,X3) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_146,negated_conjecture,
( p2(X0,X1)
| ~ p9(X2,X0,X3)
| ~ p9(X2,X1,X3) ),
inference(copy,[status(esa)],[c_111]) ).
cnf(c_151,negated_conjecture,
( p2(X0,X1)
| ~ p9(X2,X0,X3)
| ~ p9(X2,X1,X3) ),
inference(copy,[status(esa)],[c_146]) ).
cnf(c_171,negated_conjecture,
( p2(X0,X1)
| ~ p9(X2,X0,X3)
| ~ p9(X2,X1,X3) ),
inference(copy,[status(esa)],[c_151]) ).
cnf(c_73380,plain,
( p2(c15,X0)
| ~ p9(X1,c15,X2)
| ~ p9(X1,X0,X2) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_73495,plain,
( p2(c15,X0)
| ~ p9(c13,c15,c14)
| ~ p9(c13,X0,c14) ),
inference(instantiation,[status(thm)],[c_73380]) ).
cnf(c_73533,plain,
( p2(c15,f3(c14))
| ~ p9(c13,f3(c14),c14)
| ~ p9(c13,c15,c14) ),
inference(instantiation,[status(thm)],[c_73495]) ).
cnf(c_6,negated_conjecture,
( p9(c13,f3(X0),X0)
| ~ p10(c11,X0)
| ~ p10(X0,c12) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_87) ).
cnf(c_41,negated_conjecture,
( p9(c13,f3(X0),X0)
| ~ p10(c11,X0)
| ~ p10(X0,c12) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_115,negated_conjecture,
( p9(c13,f3(X0),X0)
| ~ p10(c11,X0)
| ~ p10(X0,c12) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_142,negated_conjecture,
( p9(c13,f3(X0),X0)
| ~ p10(c11,X0)
| ~ p10(X0,c12) ),
inference(copy,[status(esa)],[c_115]) ).
cnf(c_155,negated_conjecture,
( p9(c13,f3(X0),X0)
| ~ p10(c11,X0)
| ~ p10(X0,c12) ),
inference(copy,[status(esa)],[c_142]) ).
cnf(c_175,negated_conjecture,
( p9(c13,f3(X0),X0)
| ~ p10(c11,X0)
| ~ p10(X0,c12) ),
inference(copy,[status(esa)],[c_155]) ).
cnf(c_73348,plain,
( p9(c13,f3(c14),c14)
| ~ p10(c11,c14)
| ~ p10(c14,c12) ),
inference(instantiation,[status(thm)],[c_175]) ).
cnf(c_12,negated_conjecture,
( ~ p8(X0,X1)
| p10(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_94) ).
cnf(c_53,negated_conjecture,
( ~ p8(X0,X1)
| p10(X0,X1) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_121,negated_conjecture,
( ~ p8(X0,X1)
| p10(X0,X1) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_136,negated_conjecture,
( ~ p8(X0,X1)
| p10(X0,X1) ),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_161,negated_conjecture,
( ~ p8(X0,X1)
| p10(X0,X1) ),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_181,negated_conjecture,
( ~ p8(X0,X1)
| p10(X0,X1) ),
inference(copy,[status(esa)],[c_161]) ).
cnf(c_73335,plain,
( ~ p8(c14,c12)
| p10(c14,c12) ),
inference(instantiation,[status(thm)],[c_181]) ).
cnf(c_73333,plain,
( ~ p8(c11,c14)
| p10(c11,c14) ),
inference(instantiation,[status(thm)],[c_181]) ).
cnf(c_0,negated_conjecture,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X0)))
| ~ p8(c11,X0)
| ~ p8(X0,c12) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_80) ).
cnf(c_29,negated_conjecture,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X0)))
| ~ p8(c11,X0)
| ~ p8(X0,c12) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_109,negated_conjecture,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X0)))
| ~ p8(c11,X0)
| ~ p8(X0,c12) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_148,negated_conjecture,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X0)))
| ~ p8(c11,X0)
| ~ p8(X0,c12) ),
inference(copy,[status(esa)],[c_109]) ).
cnf(c_149,negated_conjecture,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X0)))
| ~ p8(c11,X0)
| ~ p8(X0,c12) ),
inference(copy,[status(esa)],[c_148]) ).
cnf(c_169,negated_conjecture,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X0)))
| ~ p8(c11,X0)
| ~ p8(X0,c12) ),
inference(copy,[status(esa)],[c_149]) ).
cnf(c_73331,plain,
( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(c14)))
| ~ p8(c11,c14)
| ~ p8(c14,c12) ),
inference(instantiation,[status(thm)],[c_169]) ).
cnf(c_13,negated_conjecture,
p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_83) ).
cnf(c_14,negated_conjecture,
p9(c13,c15,c14),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_92) ).
cnf(c_17,negated_conjecture,
p8(c11,c14),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_97) ).
cnf(c_19,negated_conjecture,
p8(c14,c12),
file('/export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p',c_0_99) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_74039,c_73944,c_73761,c_73735,c_73667,c_73533,c_73348,c_73335,c_73333,c_73331,c_13,c_14,c_17,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN569-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 21:05:30 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % Orientation found
% 0.21/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2995eb.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_1250fd.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_219434 | 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.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2995eb.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...% successful
% 0.21/0.44
% 0.21/0.44 % ------ 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.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % ------ Problem Properties
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % EPR false
% 0.21/0.44 % Horn true
% 0.21/0.44 % Has equality false
% 0.21/0.44
% 0.21/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % % ------ Current options:
% 0.21/0.44
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 1.81/2.00 % --inst_prop_sim_new false
% 1.81/2.00 % --inst_orphan_elimination true
% 1.81/2.00 % --inst_learning_loop_flag true
% 1.81/2.00 % --inst_learning_start 3000
% 1.81/2.00 % --inst_learning_factor 2
% 1.81/2.00 % --inst_start_prop_sim_after_learn 3
% 1.81/2.00 % --inst_sel_renew solver
% 1.81/2.00 % --inst_lit_activity_flag true
% 1.81/2.00 % --inst_out_proof true
% 1.81/2.00
% 1.81/2.00 % ------ Resolution Options
% 1.81/2.00
% 1.81/2.00 % --resolution_flag true
% 1.81/2.00 % --res_lit_sel kbo_max
% 1.81/2.00 % --res_to_prop_solver none
% 1.81/2.00 % --res_prop_simpl_new false
% 1.81/2.00 % --res_prop_simpl_given false
% 1.81/2.00 % --res_passive_queue_type priority_queues
% 1.81/2.00 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.81/2.00 % --res_passive_queues_freq [15;5]
% 1.81/2.00 % --res_forward_subs full
% 1.81/2.00 % --res_backward_subs full
% 1.81/2.00 % --res_forward_subs_resolution true
% 1.81/2.00 % --res_backward_subs_resolution true
% 1.81/2.00 % --res_orphan_elimination false
% 1.81/2.00 % --res_time_limit 1000.
% 1.81/2.00 % --res_out_proof true
% 1.81/2.00 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2995eb.s
% 1.81/2.00 % --modulo true
% 1.81/2.00
% 1.81/2.00 % ------ Combination Options
% 1.81/2.00
% 1.81/2.00 % --comb_res_mult 1000
% 1.81/2.00 % --comb_inst_mult 300
% 1.81/2.00 % ------
% 1.81/2.00
% 1.81/2.00
% 1.81/2.00
% 1.81/2.00 % ------ Proving...
% 1.81/2.00 %
% 1.81/2.00
% 1.81/2.00
% 1.81/2.00 % ------ Statistics
% 1.81/2.00
% 1.81/2.00 % ------ General
% 1.81/2.00
% 1.81/2.00 % num_of_input_clauses: 20
% 1.81/2.00 % num_of_input_neg_conjectures: 20
% 1.81/2.00 % num_of_splits: 0
% 1.81/2.00 % num_of_split_atoms: 0
% 1.81/2.00 % num_of_sem_filtered_clauses: 0
% 1.81/2.00 % num_of_subtypes: 0
% 1.81/2.00 % monotx_restored_types: 0
% 1.81/2.00 % sat_num_of_epr_types: 0
% 1.81/2.00 % sat_num_of_non_cyclic_types: 0
% 1.81/2.00 % sat_guarded_non_collapsed_types: 0
% 1.81/2.00 % is_epr: 0
% 1.81/2.00 % is_horn: 1
% 1.81/2.00 % has_eq: 0
% 1.81/2.00 % num_pure_diseq_elim: 0
% 1.81/2.00 % simp_replaced_by: 0
% 1.81/2.00 % res_preprocessed: 40
% 1.81/2.00 % prep_upred: 0
% 1.81/2.00 % prep_unflattend: 0
% 1.81/2.00 % pred_elim_cands: 0
% 1.81/2.00 % pred_elim: 0
% 1.81/2.00 % pred_elim_cl: 0
% 1.81/2.00 % pred_elim_cycles: 0
% 1.81/2.00 % forced_gc_time: 0
% 1.81/2.00 % gc_basic_clause_elim: 0
% 1.81/2.00 % parsing_time: 0.
% 1.81/2.00 % sem_filter_time: 0.
% 1.81/2.00 % pred_elim_time: 0.
% 1.81/2.00 % out_proof_time: 0.001
% 1.81/2.00 % monotx_time: 0.
% 1.81/2.00 % subtype_inf_time: 0.
% 1.81/2.00 % unif_index_cands_time: 0.007
% 1.81/2.00 % unif_index_add_time: 0.001
% 1.81/2.00 % total_time: 1.592
% 1.81/2.00 % num_of_symbols: 39
% 1.81/2.00 % num_of_terms: 57539
% 1.81/2.00
% 1.81/2.00 % ------ Propositional Solver
% 1.81/2.00
% 1.81/2.00 % prop_solver_calls: 12
% 1.81/2.00 % prop_fast_solver_calls: 144
% 1.81/2.00 % prop_num_of_clauses: 343
% 1.81/2.00 % prop_preprocess_simplified: 934
% 1.81/2.00 % prop_fo_subsumed: 0
% 1.81/2.00 % prop_solver_time: 0.
% 1.81/2.00 % prop_fast_solver_time: 0.
% 1.81/2.00 % prop_unsat_core_time: 0.
% 1.81/2.00
% 1.81/2.00 % ------ QBF
% 1.81/2.00
% 1.81/2.00 % qbf_q_res: 0
% 1.81/2.00 % qbf_num_tautologies: 0
% 1.81/2.00 % qbf_prep_cycles: 0
% 1.81/2.00
% 1.81/2.00 % ------ BMC1
% 1.81/2.00
% 1.81/2.00 % bmc1_current_bound: -1
% 1.81/2.00 % bmc1_last_solved_bound: -1
% 1.81/2.00 % bmc1_unsat_core_size: -1
% 1.81/2.00 % bmc1_unsat_core_parents_size: -1
% 1.81/2.00 % bmc1_merge_next_fun: 0
% 1.81/2.00 % bmc1_unsat_core_clauses_time: 0.
% 1.81/2.00
% 1.81/2.00 % ------ Instantiation
% 1.81/2.00
% 1.81/2.00 % inst_num_of_clauses: 275
% 1.81/2.00 % inst_num_in_passive: 48
% 1.81/2.00 % inst_num_in_active: 202
% 1.81/2.00 % inst_num_in_unprocessed: 0
% 1.81/2.00 % inst_num_of_loops: 233
% 1.81/2.01 % inst_num_of_learning_restarts: 0
% 1.81/2.01 % inst_num_moves_active_passive: 0
% 1.81/2.01 % inst_lit_activity: 99
% 1.81/2.01 % inst_lit_activity_moves: 0
% 1.81/2.01 % inst_num_tautologies: 23
% 1.81/2.01 % inst_num_prop_implied: 0
% 1.81/2.01 % inst_num_existing_simplified: 0
% 1.81/2.01 % inst_num_eq_res_simplified: 0
% 1.81/2.01 % inst_num_child_elim: 0
% 1.81/2.01 % inst_num_of_dismatching_blockings: 104
% 1.81/2.01 % inst_num_of_non_proper_insts: 674
% 1.81/2.01 % inst_num_of_duplicates: 201
% 1.81/2.01 % inst_inst_num_from_inst_to_res: 0
% 1.81/2.01 % inst_dismatching_checking_time: 0.
% 1.81/2.01
% 1.81/2.01 % ------ Resolution
% 1.81/2.01
% 1.81/2.01 % res_num_of_clauses: 30739
% 1.81/2.01 % res_num_in_passive: 29751
% 1.81/2.01 % res_num_in_active: 988
% 1.81/2.01 % res_num_of_loops: 1000
% 1.81/2.01 % res_forward_subset_subsumed: 1749
% 1.81/2.01 % res_backward_subset_subsumed: 0
% 1.81/2.01 % res_forward_subsumed: 12
% 1.81/2.01 % res_backward_subsumed: 0
% 1.81/2.01 % res_forward_subsumption_resolution: 0
% 1.81/2.01 % res_backward_subsumption_resolution: 0
% 1.81/2.01 % res_clause_to_clause_subsumption: 25476
% 1.81/2.01 % res_orphan_elimination: 0
% 1.81/2.01 % res_tautology_del: 9
% 1.81/2.01 % res_num_eq_res_simplified: 0
% 1.81/2.01 % res_num_sel_changes: 0
% 1.81/2.01 % res_moves_from_active_to_pass: 0
% 1.81/2.01
% 1.81/2.01 % Status Unsatisfiable
% 1.81/2.01 % SZS status Unsatisfiable
% 1.81/2.01 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------