TSTP Solution File: SYN556-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN556-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.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:29:55 EDT 2022
% Result : Unsatisfiable 3.02s 3.21s
% Output : CNFRefutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of formulae : 120 ( 45 unt; 0 def)
% Number of atoms : 272 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 310 ( 158 ~; 152 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 267 ( 0 sgn 78 !; 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,
~ p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)),
file('<stdin>',not_p3_9) ).
fof(c_0_1,negated_conjecture,
! [X19,X20,X21,X22,X23,X24] :
( p3(f4(X24,X23,X22),f4(X21,X20,X19))
| ~ p2(X23,X20)
| ~ p3(X22,X19)
| ~ p2(X24,X21) ),
file('<stdin>',p3_12) ).
fof(c_0_2,negated_conjecture,
p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11)),
file('<stdin>',p3_8) ).
fof(c_0_3,negated_conjecture,
! [X15,X16,X17,X18] :
( p2(f8(X18,X17),f8(X16,X15))
| ~ p2(X17,X15)
| ~ p3(X18,X16) ),
file('<stdin>',p2_11) ).
fof(c_0_4,negated_conjecture,
! [X11,X12,X13,X14] :
( p2(f5(X14,X13),f5(X12,X11))
| ~ p2(X14,X12)
| ~ p2(X13,X11) ),
file('<stdin>',p2_10) ).
fof(c_0_5,negated_conjecture,
! [X9,X10,X2] :
( p3(X10,X9)
| ~ p3(X2,X10)
| ~ p3(X2,X9) ),
file('<stdin>',p3_7) ).
fof(c_0_6,negated_conjecture,
! [X7,X8,X1] :
( p2(X8,X7)
| ~ p2(X1,X8)
| ~ p2(X1,X7) ),
file('<stdin>',p2_6) ).
fof(c_0_7,negated_conjecture,
! [X5,X6] :
( p2(f6(X6),f6(X5))
| ~ p2(X6,X5) ),
file('<stdin>',p2_5) ).
fof(c_0_8,negated_conjecture,
! [X3,X4] :
( p2(f7(X3),f7(X4))
| ~ p2(X3,X4) ),
file('<stdin>',p2_4) ).
fof(c_0_9,negated_conjecture,
! [X2] : p3(X2,X2),
file('<stdin>',p3_2) ).
fof(c_0_10,negated_conjecture,
! [X1] : p2(X1,X1),
file('<stdin>',p2_1) ).
fof(c_0_11,negated_conjecture,
p2(c10,c13),
file('<stdin>',p2_3) ).
fof(c_0_12,negated_conjecture,
~ p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_13,negated_conjecture,
! [X19,X20,X21,X22,X23,X24] :
( p3(f4(X24,X23,X22),f4(X21,X20,X19))
| ~ p2(X23,X20)
| ~ p3(X22,X19)
| ~ p2(X24,X21) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_14,negated_conjecture,
p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11)),
c_0_2 ).
fof(c_0_15,negated_conjecture,
! [X15,X16,X17,X18] :
( p2(f8(X18,X17),f8(X16,X15))
| ~ p2(X17,X15)
| ~ p3(X18,X16) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_16,negated_conjecture,
! [X11,X12,X13,X14] :
( p2(f5(X14,X13),f5(X12,X11))
| ~ p2(X14,X12)
| ~ p2(X13,X11) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_17,negated_conjecture,
! [X9,X10,X2] :
( p3(X10,X9)
| ~ p3(X2,X10)
| ~ p3(X2,X9) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_18,negated_conjecture,
! [X7,X8,X1] :
( p2(X8,X7)
| ~ p2(X1,X8)
| ~ p2(X1,X7) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_19,negated_conjecture,
! [X5,X6] :
( p2(f6(X6),f6(X5))
| ~ p2(X6,X5) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_20,negated_conjecture,
! [X3,X4] :
( p2(f7(X3),f7(X4))
| ~ p2(X3,X4) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_21,negated_conjecture,
! [X2] : p3(X2,X2),
c_0_9 ).
fof(c_0_22,negated_conjecture,
! [X1] : p2(X1,X1),
c_0_10 ).
fof(c_0_23,negated_conjecture,
p2(c10,c13),
c_0_11 ).
fof(c_0_24,negated_conjecture,
~ p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)),
c_0_12 ).
fof(c_0_25,negated_conjecture,
! [X25,X26,X27,X28,X29,X30] :
( p3(f4(X30,X29,X28),f4(X27,X26,X25))
| ~ p2(X29,X26)
| ~ p3(X28,X25)
| ~ p2(X30,X27) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_26,negated_conjecture,
p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11)),
c_0_14 ).
fof(c_0_27,negated_conjecture,
! [X19,X20,X21,X22] :
( p2(f8(X22,X21),f8(X20,X19))
| ~ p2(X21,X19)
| ~ p3(X22,X20) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_28,negated_conjecture,
! [X15,X16,X17,X18] :
( p2(f5(X18,X17),f5(X16,X15))
| ~ p2(X18,X16)
| ~ p2(X17,X15) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_29,negated_conjecture,
! [X11,X12,X13] :
( p3(X12,X11)
| ~ p3(X13,X12)
| ~ p3(X13,X11) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_17])])]) ).
fof(c_0_30,negated_conjecture,
! [X9,X10,X11] :
( p2(X10,X9)
| ~ p2(X11,X10)
| ~ p2(X11,X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_18])])]) ).
fof(c_0_31,negated_conjecture,
! [X7,X8] :
( p2(f6(X8),f6(X7))
| ~ p2(X8,X7) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_32,negated_conjecture,
! [X5,X6] :
( p2(f7(X5),f7(X6))
| ~ p2(X5,X6) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_33,negated_conjecture,
! [X3] : p3(X3,X3),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_34,negated_conjecture,
! [X2] : p2(X2,X2),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_35,negated_conjecture,
p2(c10,c13),
c_0_23 ).
cnf(c_0_36,negated_conjecture,
~ p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,negated_conjecture,
( p3(f4(X1,X5,X3),f4(X2,X6,X4))
| ~ p2(X1,X2)
| ~ p3(X3,X4)
| ~ p2(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,negated_conjecture,
p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,negated_conjecture,
( p2(f8(X1,X3),f8(X2,X4))
| ~ p3(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( p2(f5(X3,X1),f5(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,negated_conjecture,
( p2(f6(X1),f6(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,negated_conjecture,
( p2(f7(X1),f7(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,negated_conjecture,
p3(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_46,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,negated_conjecture,
p2(c10,c13),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_48,negated_conjecture,
~ p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)),
c_0_36,
[final] ).
cnf(c_0_49,negated_conjecture,
( p3(f4(X1,X5,X3),f4(X2,X6,X4))
| ~ p2(X1,X2)
| ~ p3(X3,X4)
| ~ p2(X5,X6) ),
c_0_37,
[final] ).
cnf(c_0_50,negated_conjecture,
p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11)),
c_0_38,
[final] ).
cnf(c_0_51,negated_conjecture,
( p2(f8(X1,X3),f8(X2,X4))
| ~ p3(X1,X2)
| ~ p2(X3,X4) ),
c_0_39,
[final] ).
cnf(c_0_52,negated_conjecture,
( p2(f5(X3,X1),f5(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_40,
[final] ).
cnf(c_0_53,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
c_0_41,
[final] ).
cnf(c_0_54,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_42,
[final] ).
cnf(c_0_55,negated_conjecture,
( p2(f6(X1),f6(X2))
| ~ p2(X1,X2) ),
c_0_43,
[final] ).
cnf(c_0_56,negated_conjecture,
( p2(f7(X1),f7(X2))
| ~ p2(X1,X2) ),
c_0_44,
[final] ).
cnf(c_0_57,negated_conjecture,
p3(X1,X1),
c_0_45,
[final] ).
cnf(c_0_58,negated_conjecture,
p2(X1,X1),
c_0_46,
[final] ).
cnf(c_0_59,negated_conjecture,
p2(c10,c13),
c_0_47,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_10,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_58) ).
cnf(c_39,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_77,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_80,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_101,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_113,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_158731,plain,
p2(f6(f7(c12)),f6(f7(c12))),
inference(instantiation,[status(thm)],[c_113]) ).
cnf(c_1,negated_conjecture,
( ~ p3(X0,X1)
| p2(f8(X0,X2),f8(X1,X3))
| ~ p2(X2,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_51) ).
cnf(c_21,negated_conjecture,
( ~ p3(X0,X1)
| p2(f8(X0,X2),f8(X1,X3))
| ~ p2(X2,X3) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_68,negated_conjecture,
( ~ p3(X0,X1)
| p2(f8(X0,X2),f8(X1,X3))
| ~ p2(X2,X3) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_89,negated_conjecture,
( ~ p3(X0,X1)
| p2(f8(X0,X2),f8(X1,X3))
| ~ p2(X2,X3) ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_92,negated_conjecture,
( ~ p3(X0,X1)
| p2(f8(X0,X2),f8(X1,X3))
| ~ p2(X2,X3) ),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_104,negated_conjecture,
( ~ p3(X0,X1)
| p2(f8(X0,X2),f8(X1,X3))
| ~ p2(X2,X3) ),
inference(copy,[status(esa)],[c_92]) ).
cnf(c_158705,plain,
( ~ p3(c11,c11)
| p2(f8(c11,c13),f8(c11,c10))
| ~ p2(c13,c10) ),
inference(instantiation,[status(thm)],[c_104]) ).
cnf(c_2,negated_conjecture,
( p2(f5(X0,X1),f5(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_52) ).
cnf(c_23,negated_conjecture,
( p2(f5(X0,X1),f5(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_69,negated_conjecture,
( p2(f5(X0,X1),f5(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_88,negated_conjecture,
( p2(f5(X0,X1),f5(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_93,negated_conjecture,
( p2(f5(X0,X1),f5(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_105,negated_conjecture,
( p2(f5(X0,X1),f5(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_158639,plain,
( ~ p2(f8(c11,c13),f8(c11,c10))
| p2(f5(f8(c11,c13),f6(f7(c12))),f5(f8(c11,c10),f6(f7(c12))))
| ~ p2(f6(f7(c12)),f6(f7(c12))) ),
inference(instantiation,[status(thm)],[c_105]) ).
cnf(c_158614,plain,
p2(c10,c10),
inference(instantiation,[status(thm)],[c_113]) ).
cnf(c_4,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_54) ).
cnf(c_27,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_71,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_86,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_95,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_107,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X0,X2)
| p2(X1,X2) ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_158604,plain,
( p2(c13,c10)
| ~ p2(X0,c10)
| ~ p2(X0,c13) ),
inference(instantiation,[status(thm)],[c_107]) ).
cnf(c_158613,plain,
( ~ p2(c10,c10)
| ~ p2(c10,c13)
| p2(c13,c10) ),
inference(instantiation,[status(thm)],[c_158604]) ).
cnf(c_0,negated_conjecture,
( p3(f4(X0,X1,X2),f4(X3,X4,X5))
| ~ p3(X2,X5)
| ~ p2(X1,X4)
| ~ p2(X0,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_49) ).
cnf(c_19,negated_conjecture,
( p3(f4(X0,X1,X2),f4(X3,X4,X5))
| ~ p3(X2,X5)
| ~ p2(X1,X4)
| ~ p2(X0,X3) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_67,negated_conjecture,
( p3(f4(X0,X1,X2),f4(X3,X4,X5))
| ~ p3(X2,X5)
| ~ p2(X1,X4)
| ~ p2(X0,X3) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_90,negated_conjecture,
( p3(f4(X0,X1,X2),f4(X3,X4,X5))
| ~ p3(X2,X5)
| ~ p2(X1,X4)
| ~ p2(X0,X3) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_91,negated_conjecture,
( p3(f4(X0,X1,X2),f4(X3,X4,X5))
| ~ p3(X2,X5)
| ~ p2(X1,X4)
| ~ p2(X0,X3) ),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_103,negated_conjecture,
( p3(f4(X0,X1,X2),f4(X3,X4,X5))
| ~ p3(X2,X5)
| ~ p2(X1,X4)
| ~ p2(X0,X3) ),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_158589,plain,
( p3(f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11),f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11))
| ~ p3(c11,c11)
| ~ p2(f5(f8(c11,c13),f6(f7(c12))),f5(f8(c11,c10),f6(f7(c12))))
| ~ p2(c13,c10) ),
inference(instantiation,[status(thm)],[c_103]) ).
cnf(c_3,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_53) ).
cnf(c_25,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_70,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_87,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_94,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_106,negated_conjecture,
( ~ p3(X0,X1)
| ~ p3(X0,X2)
| p3(X1,X2) ),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_158565,plain,
( p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11))
| ~ p3(X0,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11))
| ~ p3(X0,c9) ),
inference(instantiation,[status(thm)],[c_106]) ).
cnf(c_158581,plain,
( ~ p3(f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11),f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11))
| ~ p3(f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11),c9)
| p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)) ),
inference(instantiation,[status(thm)],[c_158565]) ).
cnf(c_158567,plain,
( ~ p3(X0,c9)
| p3(X1,c9)
| ~ p3(X0,X1) ),
inference(instantiation,[status(thm)],[c_106]) ).
cnf(c_158571,plain,
( ~ p3(c9,c9)
| ~ p3(c9,X0)
| p3(X0,c9) ),
inference(instantiation,[status(thm)],[c_158567]) ).
cnf(c_158576,plain,
( p3(f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11),c9)
| ~ p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11))
| ~ p3(c9,c9) ),
inference(instantiation,[status(thm)],[c_158571]) ).
cnf(c_9,negated_conjecture,
p3(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_57) ).
cnf(c_37,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_76,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_81,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_100,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_112,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_158569,plain,
p3(c9,c9),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_7,negated_conjecture,
~ p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_48) ).
cnf(c_8,negated_conjecture,
p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_50) ).
cnf(c_13,plain,
p3(c11,c11),
inference(instantiation,[status(thm)],[c_9]) ).
cnf(c_11,negated_conjecture,
p2(c10,c13),
file('/export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p',c_0_59) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_158731,c_158705,c_158639,c_158614,c_158613,c_158589,c_158581,c_158576,c_158569,c_7,c_8,c_13,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN556-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Tue Jul 12 07:56:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/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/sandbox2/tmp/iprover_proof_c9f5a6.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_efddc1.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_e9f0a2 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c9f5a6.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn true
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 0.20/0.42
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 3.02/3.21 % --inst_prop_sim_new false
% 3.02/3.21 % --inst_orphan_elimination true
% 3.02/3.21 % --inst_learning_loop_flag true
% 3.02/3.21 % --inst_learning_start 3000
% 3.02/3.21 % --inst_learning_factor 2
% 3.02/3.21 % --inst_start_prop_sim_after_learn 3
% 3.02/3.21 % --inst_sel_renew solver
% 3.02/3.21 % --inst_lit_activity_flag true
% 3.02/3.21 % --inst_out_proof true
% 3.02/3.21
% 3.02/3.21 % ------ Resolution Options
% 3.02/3.21
% 3.02/3.21 % --resolution_flag true
% 3.02/3.21 % --res_lit_sel kbo_max
% 3.02/3.21 % --res_to_prop_solver none
% 3.02/3.21 % --res_prop_simpl_new false
% 3.02/3.21 % --res_prop_simpl_given false
% 3.02/3.21 % --res_passive_queue_type priority_queues
% 3.02/3.21 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.02/3.21 % --res_passive_queues_freq [15;5]
% 3.02/3.21 % --res_forward_subs full
% 3.02/3.21 % --res_backward_subs full
% 3.02/3.21 % --res_forward_subs_resolution true
% 3.02/3.21 % --res_backward_subs_resolution true
% 3.02/3.21 % --res_orphan_elimination false
% 3.02/3.21 % --res_time_limit 1000.
% 3.02/3.21 % --res_out_proof true
% 3.02/3.21 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c9f5a6.s
% 3.02/3.21 % --modulo true
% 3.02/3.21
% 3.02/3.21 % ------ Combination Options
% 3.02/3.21
% 3.02/3.21 % --comb_res_mult 1000
% 3.02/3.21 % --comb_inst_mult 300
% 3.02/3.21 % ------
% 3.02/3.21
% 3.02/3.21
% 3.02/3.21
% 3.02/3.21 % ------ Proving...
% 3.02/3.21 %
% 3.02/3.21
% 3.02/3.21
% 3.02/3.21 % ------ Statistics
% 3.02/3.21
% 3.02/3.21 % ------ General
% 3.02/3.21
% 3.02/3.21 % num_of_input_clauses: 12
% 3.02/3.21 % num_of_input_neg_conjectures: 12
% 3.02/3.21 % num_of_splits: 0
% 3.02/3.21 % num_of_split_atoms: 0
% 3.02/3.21 % num_of_sem_filtered_clauses: 0
% 3.02/3.21 % num_of_subtypes: 0
% 3.02/3.21 % monotx_restored_types: 0
% 3.02/3.21 % sat_num_of_epr_types: 0
% 3.02/3.21 % sat_num_of_non_cyclic_types: 0
% 3.02/3.21 % sat_guarded_non_collapsed_types: 0
% 3.02/3.21 % is_epr: 0
% 3.02/3.21 % is_horn: 1
% 3.02/3.21 % has_eq: 0
% 3.02/3.21 % num_pure_diseq_elim: 0
% 3.02/3.21 % simp_replaced_by: 0
% 3.02/3.21 % res_preprocessed: 24
% 3.02/3.21 % prep_upred: 0
% 3.02/3.21 % prep_unflattend: 0
% 3.02/3.21 % pred_elim_cands: 0
% 3.02/3.21 % pred_elim: 0
% 3.02/3.21 % pred_elim_cl: 0
% 3.02/3.21 % pred_elim_cycles: 0
% 3.02/3.21 % forced_gc_time: 0
% 3.02/3.21 % gc_basic_clause_elim: 0
% 3.02/3.21 % parsing_time: 0.
% 3.02/3.21 % sem_filter_time: 0.
% 3.02/3.21 % pred_elim_time: 0.
% 3.02/3.21 % out_proof_time: 0.001
% 3.02/3.21 % monotx_time: 0.
% 3.02/3.21 % subtype_inf_time: 0.
% 3.02/3.21 % unif_index_cands_time: 0.014
% 3.02/3.21 % unif_index_add_time: 0.002
% 3.02/3.21 % total_time: 2.801
% 3.02/3.21 % num_of_symbols: 37
% 3.02/3.21 % num_of_terms: 84341
% 3.02/3.21
% 3.02/3.21 % ------ Propositional Solver
% 3.02/3.21
% 3.02/3.21 % prop_solver_calls: 9
% 3.02/3.21 % prop_fast_solver_calls: 75
% 3.02/3.21 % prop_num_of_clauses: 116
% 3.02/3.21 % prop_preprocess_simplified: 343
% 3.02/3.21 % prop_fo_subsumed: 0
% 3.02/3.21 % prop_solver_time: 0.
% 3.02/3.21 % prop_fast_solver_time: 0.
% 3.02/3.21 % prop_unsat_core_time: 0.
% 3.02/3.21
% 3.02/3.21 % ------ QBF
% 3.02/3.21
% 3.02/3.21 % qbf_q_res: 0
% 3.02/3.21 % qbf_num_tautologies: 0
% 3.02/3.21 % qbf_prep_cycles: 0
% 3.02/3.21
% 3.02/3.21 % ------ BMC1
% 3.02/3.21
% 3.02/3.21 % bmc1_current_bound: -1
% 3.02/3.21 % bmc1_last_solved_bound: -1
% 3.02/3.21 % bmc1_unsat_core_size: -1
% 3.02/3.21 % bmc1_unsat_core_parents_size: -1
% 3.02/3.21 % bmc1_merge_next_fun: 0
% 3.02/3.21 % bmc1_unsat_core_clauses_time: 0.
% 3.02/3.21
% 3.02/3.21 % ------ Instantiation
% 3.02/3.21
% 3.02/3.21 % inst_num_of_clauses: 82
% 3.02/3.21 % inst_num_in_passive: 20
% 3.02/3.21 % inst_num_in_active: 51
% 3.02/3.21 % inst_num_in_unprocessed: 4
% 3.02/3.21 % inst_num_of_loops: 70
% 3.02/3.21 % inst_num_of_learning_restarts: 0
% 3.02/3.21 % inst_num_moves_active_passive: 4
% 3.02/3.21 % inst_lit_activity: 19
% 3.02/3.21 % inst_lit_activity_moves: 0
% 3.02/3.21 % inst_num_tautologies: 5
% 3.02/3.21 % inst_num_prop_implied: 0
% 3.02/3.21 % inst_num_existing_simplified: 0
% 3.02/3.21 % inst_num_eq_res_simplified: 0
% 3.02/3.21 % inst_num_child_elim: 0
% 3.02/3.21 % inst_num_of_dismatching_blockings: 18
% 3.02/3.21 % inst_num_of_non_proper_insts: 111
% 3.02/3.21 % inst_num_of_duplicates: 32
% 3.02/3.21 % inst_inst_num_from_inst_to_res: 0
% 3.02/3.21 % inst_dismatching_checking_time: 0.
% 3.02/3.21
% 3.02/3.21 % ------ Resolution
% 3.02/3.21
% 3.02/3.21 % res_num_of_clauses: 71297
% 3.02/3.21 % res_num_in_passive: 70392
% 3.02/3.21 % res_num_in_active: 954
% 3.02/3.21 % res_num_of_loops: 1000
% 3.02/3.21 % res_forward_subset_subsumed: 4919
% 3.02/3.21 % res_backward_subset_subsumed: 49
% 3.02/3.21 % res_forward_subsumed: 43
% 3.02/3.21 % res_backward_subsumed: 0
% 3.02/3.21 % res_forward_subsumption_resolution: 8
% 3.02/3.21 % res_backward_subsumption_resolution: 0
% 3.02/3.21 % res_clause_to_clause_subsumption: 16757
% 3.02/3.21 % res_orphan_elimination: 0
% 3.02/3.21 % res_tautology_del: 8
% 3.02/3.21 % res_num_eq_res_simplified: 0
% 3.02/3.21 % res_num_sel_changes: 0
% 3.02/3.21 % res_moves_from_active_to_pass: 0
% 3.02/3.21
% 3.02/3.21 % Status Unsatisfiable
% 3.02/3.21 % SZS status Unsatisfiable
% 3.02/3.21 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------