TSTP Solution File: SYN563-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN563-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.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:58 EDT 2022
% Result : Unsatisfiable 1.01s 1.21s
% Output : CNFRefutation 1.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 27
% Syntax : Number of formulae : 140 ( 39 unt; 0 def)
% Number of atoms : 306 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 343 ( 177 ~; 166 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 249 ( 0 sgn 93 !; 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,
! [X25,X26,X27,X28] :
( p5(X28,X27)
| ~ p2(X25,X27)
| ~ p5(X26,X25)
| ~ p2(X26,X28) ),
file('<stdin>',p5_17) ).
fof(c_0_1,negated_conjecture,
! [X21,X22,X23,X24] :
( p6(X24,X23)
| ~ p2(X21,X24)
| ~ p6(X21,X22)
| ~ p2(X22,X23) ),
file('<stdin>',p6_16) ).
fof(c_0_2,negated_conjecture,
! [X18,X19,X20] :
( p5(X20,X19)
| ~ p5(X18,X19)
| ~ p6(X20,X18) ),
file('<stdin>',p5_15) ).
fof(c_0_3,negated_conjecture,
! [X15,X16,X17] :
( p6(X17,X16)
| ~ p6(X17,X15)
| ~ p6(X15,X16) ),
file('<stdin>',p6_14) ).
fof(c_0_4,negated_conjecture,
! [X13,X14,X1] :
( p2(X14,X13)
| ~ p2(X1,X14)
| ~ p2(X1,X13) ),
file('<stdin>',p2_13) ).
fof(c_0_5,negated_conjecture,
! [X5] : p5(f3(f3(X5)),f3(f4(X5))),
file('<stdin>',p5_7) ).
fof(c_0_6,negated_conjecture,
! [X11,X12] :
( p2(f4(X12),f4(X11))
| ~ p2(X12,X11) ),
file('<stdin>',p2_12) ).
fof(c_0_7,negated_conjecture,
! [X9,X10] :
( p2(f3(X10),f3(X9))
| ~ p2(X10,X9) ),
file('<stdin>',p2_11) ).
fof(c_0_8,negated_conjecture,
! [X6,X7] :
( p5(X7,X6)
| ~ p6(f4(X7),X6) ),
file('<stdin>',p5_8) ).
fof(c_0_9,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
file('<stdin>',not_p6_5) ).
fof(c_0_10,negated_conjecture,
! [X6,X7] :
( p6(f4(X7),X6)
| ~ p5(X7,X6) ),
file('<stdin>',p6_10) ).
fof(c_0_11,negated_conjecture,
! [X8] :
( p6(c7,f3(X8))
| ~ p6(c7,X8) ),
file('<stdin>',p6_9) ).
fof(c_0_12,negated_conjecture,
! [X3,X4] :
( p6(X4,X3)
| ~ p5(X4,X3) ),
file('<stdin>',p6_6) ).
fof(c_0_13,negated_conjecture,
~ p6(f4(c7),c8),
file('<stdin>',not_p6_3) ).
fof(c_0_14,negated_conjecture,
p2(f4(c7),f4(c8)),
file('<stdin>',p2_4) ).
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,
! [X25,X26,X27,X28] :
( p5(X28,X27)
| ~ p2(X25,X27)
| ~ p5(X26,X25)
| ~ p2(X26,X28) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_18,negated_conjecture,
! [X21,X22,X23,X24] :
( p6(X24,X23)
| ~ p2(X21,X24)
| ~ p6(X21,X22)
| ~ p2(X22,X23) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_19,negated_conjecture,
! [X18,X19,X20] :
( p5(X20,X19)
| ~ p5(X18,X19)
| ~ p6(X20,X18) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_20,negated_conjecture,
! [X15,X16,X17] :
( p6(X17,X16)
| ~ p6(X17,X15)
| ~ p6(X15,X16) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_21,negated_conjecture,
! [X13,X14,X1] :
( p2(X14,X13)
| ~ p2(X1,X14)
| ~ p2(X1,X13) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_22,negated_conjecture,
! [X5] : p5(f3(f3(X5)),f3(f4(X5))),
c_0_5 ).
fof(c_0_23,negated_conjecture,
! [X11,X12] :
( p2(f4(X12),f4(X11))
| ~ p2(X12,X11) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_24,negated_conjecture,
! [X9,X10] :
( p2(f3(X10),f3(X9))
| ~ p2(X10,X9) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_25,negated_conjecture,
! [X6,X7] :
( p5(X7,X6)
| ~ p6(f4(X7),X6) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_26,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_27,negated_conjecture,
! [X6,X7] :
( p6(f4(X7),X6)
| ~ p5(X7,X6) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_28,negated_conjecture,
! [X8] :
( p6(c7,f3(X8))
| ~ p6(c7,X8) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_29,negated_conjecture,
! [X3,X4] :
( p6(X4,X3)
| ~ p5(X4,X3) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_30,negated_conjecture,
~ p6(f4(c7),c8),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_31,negated_conjecture,
p2(f4(c7),f4(c8)),
c_0_14 ).
fof(c_0_32,negated_conjecture,
! [X2] : p6(X2,X2),
c_0_15 ).
fof(c_0_33,negated_conjecture,
! [X1] : p2(X1,X1),
c_0_16 ).
fof(c_0_34,negated_conjecture,
! [X29,X30,X31,X32] :
( p5(X32,X31)
| ~ p2(X29,X31)
| ~ p5(X30,X29)
| ~ p2(X30,X32) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_35,negated_conjecture,
! [X25,X26,X27,X28] :
( p6(X28,X27)
| ~ p2(X25,X28)
| ~ p6(X25,X26)
| ~ p2(X26,X27) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_36,negated_conjecture,
! [X21,X22,X23] :
( p5(X23,X22)
| ~ p5(X21,X22)
| ~ p6(X23,X21) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_37,negated_conjecture,
! [X18,X19,X20] :
( p6(X20,X19)
| ~ p6(X20,X18)
| ~ p6(X18,X19) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_38,negated_conjecture,
! [X15,X16,X17] :
( p2(X16,X15)
| ~ p2(X17,X16)
| ~ p2(X17,X15) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_21])])]) ).
fof(c_0_39,negated_conjecture,
! [X6] : p5(f3(f3(X6)),f3(f4(X6))),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_40,negated_conjecture,
! [X13,X14] :
( p2(f4(X14),f4(X13))
| ~ p2(X14,X13) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_41,negated_conjecture,
! [X11,X12] :
( p2(f3(X12),f3(X11))
| ~ p2(X12,X11) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_42,negated_conjecture,
! [X8,X9] :
( p5(X9,X8)
| ~ p6(f4(X9),X8) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_43,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
c_0_26 ).
fof(c_0_44,negated_conjecture,
! [X8,X9] :
( p6(f4(X9),X8)
| ~ p5(X9,X8) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_45,negated_conjecture,
! [X9] :
( p6(c7,f3(X9))
| ~ p6(c7,X9) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_46,negated_conjecture,
! [X5,X6] :
( p6(X6,X5)
| ~ p5(X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_47,negated_conjecture,
~ p6(f4(c7),c8),
c_0_30 ).
fof(c_0_48,negated_conjecture,
p2(f4(c7),f4(c8)),
c_0_31 ).
fof(c_0_49,negated_conjecture,
! [X3] : p6(X3,X3),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_50,negated_conjecture,
! [X2] : p2(X2,X2),
inference(variable_rename,[status(thm)],[c_0_33]) ).
cnf(c_0_51,negated_conjecture,
( p5(X2,X4)
| ~ p2(X1,X2)
| ~ p5(X1,X3)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,negated_conjecture,
( p6(X4,X2)
| ~ p2(X1,X2)
| ~ p6(X3,X1)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,negated_conjecture,
( p5(X1,X3)
| ~ p6(X1,X2)
| ~ p5(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_54,negated_conjecture,
( p6(X3,X2)
| ~ p6(X1,X2)
| ~ p6(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_55,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_56,negated_conjecture,
p5(f3(f3(X1)),f3(f4(X1))),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_57,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_58,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_59,negated_conjecture,
( p5(X1,X2)
| ~ p6(f4(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_60,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_61,negated_conjecture,
( p6(f4(X1),X2)
| ~ p5(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_62,negated_conjecture,
( p6(c7,f3(X1))
| ~ p6(c7,X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_63,negated_conjecture,
( p6(X1,X2)
| ~ p5(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_64,negated_conjecture,
~ p6(f4(c7),c8),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_65,negated_conjecture,
p2(f4(c7),f4(c8)),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_66,negated_conjecture,
p6(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_67,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_68,negated_conjecture,
( p5(X2,X4)
| ~ p2(X1,X2)
| ~ p5(X1,X3)
| ~ p2(X3,X4) ),
c_0_51,
[final] ).
cnf(c_0_69,negated_conjecture,
( p6(X4,X2)
| ~ p2(X1,X2)
| ~ p6(X3,X1)
| ~ p2(X3,X4) ),
c_0_52,
[final] ).
cnf(c_0_70,negated_conjecture,
( p5(X1,X3)
| ~ p6(X1,X2)
| ~ p5(X2,X3) ),
c_0_53,
[final] ).
cnf(c_0_71,negated_conjecture,
( p6(X3,X2)
| ~ p6(X1,X2)
| ~ p6(X3,X1) ),
c_0_54,
[final] ).
cnf(c_0_72,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_55,
[final] ).
cnf(c_0_73,negated_conjecture,
p5(f3(f3(X1)),f3(f4(X1))),
c_0_56,
[final] ).
cnf(c_0_74,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_57,
[final] ).
cnf(c_0_75,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
c_0_58,
[final] ).
cnf(c_0_76,negated_conjecture,
( p5(X1,X2)
| ~ p6(f4(X1),X2) ),
c_0_59,
[final] ).
cnf(c_0_77,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
c_0_60,
[final] ).
cnf(c_0_78,negated_conjecture,
( p6(f4(X1),X2)
| ~ p5(X1,X2) ),
c_0_61,
[final] ).
cnf(c_0_79,negated_conjecture,
( p6(c7,f3(X1))
| ~ p6(c7,X1) ),
c_0_62,
[final] ).
cnf(c_0_80,negated_conjecture,
( p6(X1,X2)
| ~ p5(X1,X2) ),
c_0_63,
[final] ).
cnf(c_0_81,negated_conjecture,
~ p6(f4(c7),c8),
c_0_64,
[final] ).
cnf(c_0_82,negated_conjecture,
p2(f4(c7),f4(c8)),
c_0_65,
[final] ).
cnf(c_0_83,negated_conjecture,
p6(X1,X1),
c_0_66,
[final] ).
cnf(c_0_84,negated_conjecture,
p2(X1,X1),
c_0_67,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_6,negated_conjecture,
( p2(f3(X0),f3(X1))
| ~ p2(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_75) ).
cnf(c_37,negated_conjecture,
( p2(f3(X0),f3(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_99,negated_conjecture,
( p2(f3(X0),f3(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_120,negated_conjecture,
( p2(f3(X0),f3(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_133,negated_conjecture,
( p2(f3(X0),f3(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_120]) ).
cnf(c_150,negated_conjecture,
( p2(f3(X0),f3(X1))
| ~ p2(X0,X1) ),
inference(copy,[status(esa)],[c_133]) ).
cnf(c_49753,plain,
( ~ p2(f4(X0),X1)
| p2(f3(f4(X0)),f3(X1)) ),
inference(instantiation,[status(thm)],[c_150]) ).
cnf(c_49834,plain,
( ~ p2(f4(X0),f4(X1))
| p2(f3(f4(X0)),f3(f4(X1))) ),
inference(instantiation,[status(thm)],[c_49753]) ).
cnf(c_50736,plain,
( ~ p2(f4(X0),f4(c8))
| p2(f3(f4(X0)),f3(f4(c8))) ),
inference(instantiation,[status(thm)],[c_49834]) ).
cnf(c_50737,plain,
( ~ p2(f4(c7),f4(c8))
| p2(f3(f4(c7)),f3(f4(c8))) ),
inference(instantiation,[status(thm)],[c_50736]) ).
cnf(c_0,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X3)
| ~ p2(X1,X3)
| ~ p2(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_68) ).
cnf(c_25,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X3)
| ~ p2(X1,X3)
| ~ p2(X0,X2) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_93,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X3)
| ~ p2(X1,X3)
| ~ p2(X0,X2) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_126,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X3)
| ~ p2(X1,X3)
| ~ p2(X0,X2) ),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_127,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X3)
| ~ p2(X1,X3)
| ~ p2(X0,X2) ),
inference(copy,[status(esa)],[c_126]) ).
cnf(c_144,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X3)
| ~ p2(X1,X3)
| ~ p2(X0,X2) ),
inference(copy,[status(esa)],[c_127]) ).
cnf(c_49763,plain,
( ~ p5(c7,f3(f4(X0)))
| p5(X1,X2)
| ~ p2(f3(f4(X0)),X2)
| ~ p2(c7,X1) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_49863,plain,
( ~ p5(c7,f3(f4(X0)))
| p5(X1,f3(X2))
| ~ p2(f3(f4(X0)),f3(X2))
| ~ p2(c7,X1) ),
inference(instantiation,[status(thm)],[c_49763]) ).
cnf(c_50039,plain,
( ~ p5(c7,f3(f4(X0)))
| p5(X1,f3(f4(X2)))
| ~ p2(f3(f4(X0)),f3(f4(X2)))
| ~ p2(c7,X1) ),
inference(instantiation,[status(thm)],[c_49863]) ).
cnf(c_50383,plain,
( p5(c7,f3(f4(c8)))
| ~ p5(c7,f3(f4(X0)))
| ~ p2(f3(f4(X0)),f3(f4(c8)))
| ~ p2(c7,c7) ),
inference(instantiation,[status(thm)],[c_50039]) ).
cnf(c_50384,plain,
( ~ p5(c7,f3(f4(c7)))
| p5(c7,f3(f4(c8)))
| ~ p2(f3(f4(c7)),f3(f4(c8)))
| ~ p2(c7,c7) ),
inference(instantiation,[status(thm)],[c_50383]) ).
cnf(c_8,negated_conjecture,
( ~ p5(X0,X1)
| p6(f4(X0),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_78) ).
cnf(c_41,negated_conjecture,
( ~ p5(X0,X1)
| p6(f4(X0),X1) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_101,negated_conjecture,
( ~ p5(X0,X1)
| p6(f4(X0),X1) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_118,negated_conjecture,
( ~ p5(X0,X1)
| p6(f4(X0),X1) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_135,negated_conjecture,
( ~ p5(X0,X1)
| p6(f4(X0),X1) ),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_152,negated_conjecture,
( ~ p5(X0,X1)
| p6(f4(X0),X1) ),
inference(copy,[status(esa)],[c_135]) ).
cnf(c_49765,plain,
( ~ p5(c7,f3(f4(X0)))
| p6(f4(c7),f3(f4(X0))) ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_49832,plain,
( ~ p5(c7,f3(f4(c8)))
| p6(f4(c7),f3(f4(c8))) ),
inference(instantiation,[status(thm)],[c_49765]) ).
cnf(c_9,negated_conjecture,
( p6(c7,f3(X0))
| ~ p6(c7,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_79) ).
cnf(c_43,negated_conjecture,
( p6(c7,f3(X0))
| ~ p6(c7,X0) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_102,negated_conjecture,
( p6(c7,f3(X0))
| ~ p6(c7,X0) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_117,negated_conjecture,
( p6(c7,f3(X0))
| ~ p6(c7,X0) ),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_136,negated_conjecture,
( p6(c7,f3(X0))
| ~ p6(c7,X0) ),
inference(copy,[status(esa)],[c_117]) ).
cnf(c_153,negated_conjecture,
( p6(c7,f3(X0))
| ~ p6(c7,X0) ),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_49735,plain,
( p6(c7,f3(f3(X0)))
| ~ p6(c7,f3(X0)) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_49736,plain,
( p6(c7,f3(f3(c7)))
| ~ p6(c7,f3(c7)) ),
inference(instantiation,[status(thm)],[c_49735]) ).
cnf(c_2,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X1)
| ~ p6(X2,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_70) ).
cnf(c_29,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X1)
| ~ p6(X2,X0) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_95,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X1)
| ~ p6(X2,X0) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_124,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X1)
| ~ p6(X2,X0) ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_129,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X1)
| ~ p6(X2,X0) ),
inference(copy,[status(esa)],[c_124]) ).
cnf(c_146,negated_conjecture,
( ~ p5(X0,X1)
| p5(X2,X1)
| ~ p6(X2,X0) ),
inference(copy,[status(esa)],[c_129]) ).
cnf(c_49708,plain,
( ~ p5(f3(f3(X0)),f3(f4(X0)))
| p5(X1,f3(f4(X0)))
| ~ p6(X1,f3(f3(X0))) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_49709,plain,
( ~ p5(f3(f3(c7)),f3(f4(c7)))
| p5(c7,f3(f4(c7)))
| ~ p6(c7,f3(f3(c7))) ),
inference(instantiation,[status(thm)],[c_49708]) ).
cnf(c_20,plain,
( p6(c7,f3(c7))
| ~ p6(c7,c7) ),
inference(instantiation,[status(thm)],[c_9]) ).
cnf(c_11,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_77) ).
cnf(c_13,negated_conjecture,
p5(f3(f3(X0)),f3(f4(X0))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_73) ).
cnf(c_19,plain,
p5(f3(f3(c7)),f3(f4(c7))),
inference(instantiation,[status(thm)],[c_13]) ).
cnf(c_14,negated_conjecture,
p2(f4(c7),f4(c8)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_82) ).
cnf(c_15,negated_conjecture,
p6(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_83) ).
cnf(c_18,plain,
p6(c7,c7),
inference(instantiation,[status(thm)],[c_15]) ).
cnf(c_16,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p',c_0_84) ).
cnf(c_17,plain,
p2(c7,c7),
inference(instantiation,[status(thm)],[c_16]) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_50737,c_50384,c_49832,c_49736,c_49709,c_20,c_11,c_19,c_14,c_18,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN563-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 17:10:19 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_4d013a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_cb7975.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_9343e5 | 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_4d013a.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.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
% 1.01/1.21 % --inst_prop_sim_new false
% 1.01/1.21 % --inst_orphan_elimination true
% 1.01/1.21 % --inst_learning_loop_flag true
% 1.01/1.21 % --inst_learning_start 3000
% 1.01/1.21 % --inst_learning_factor 2
% 1.01/1.21 % --inst_start_prop_sim_after_learn 3
% 1.01/1.21 % --inst_sel_renew solver
% 1.01/1.21 % --inst_lit_activity_flag true
% 1.01/1.21 % --inst_out_proof true
% 1.01/1.21
% 1.01/1.21 % ------ Resolution Options
% 1.01/1.21
% 1.01/1.21 % --resolution_flag true
% 1.01/1.21 % --res_lit_sel kbo_max
% 1.01/1.21 % --res_to_prop_solver none
% 1.01/1.21 % --res_prop_simpl_new false
% 1.01/1.21 % --res_prop_simpl_given false
% 1.01/1.21 % --res_passive_queue_type priority_queues
% 1.01/1.21 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.01/1.21 % --res_passive_queues_freq [15;5]
% 1.01/1.21 % --res_forward_subs full
% 1.01/1.21 % --res_backward_subs full
% 1.01/1.21 % --res_forward_subs_resolution true
% 1.01/1.21 % --res_backward_subs_resolution true
% 1.01/1.21 % --res_orphan_elimination false
% 1.01/1.21 % --res_time_limit 1000.
% 1.01/1.21 % --res_out_proof true
% 1.01/1.21 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_4d013a.s
% 1.01/1.21 % --modulo true
% 1.01/1.21
% 1.01/1.21 % ------ Combination Options
% 1.01/1.21
% 1.01/1.21 % --comb_res_mult 1000
% 1.01/1.21 % --comb_inst_mult 300
% 1.01/1.21 % ------
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21 % ------ Proving...
% 1.01/1.21 %
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21 % ------ Statistics
% 1.01/1.21
% 1.01/1.21 % ------ General
% 1.01/1.21
% 1.01/1.21 % num_of_input_clauses: 17
% 1.01/1.21 % num_of_input_neg_conjectures: 17
% 1.01/1.21 % num_of_splits: 0
% 1.01/1.21 % num_of_split_atoms: 0
% 1.01/1.21 % num_of_sem_filtered_clauses: 0
% 1.01/1.21 % num_of_subtypes: 0
% 1.01/1.21 % monotx_restored_types: 0
% 1.01/1.21 % sat_num_of_epr_types: 0
% 1.01/1.21 % sat_num_of_non_cyclic_types: 0
% 1.01/1.21 % sat_guarded_non_collapsed_types: 0
% 1.01/1.21 % is_epr: 0
% 1.01/1.21 % is_horn: 1
% 1.01/1.21 % has_eq: 0
% 1.01/1.21 % num_pure_diseq_elim: 0
% 1.01/1.21 % simp_replaced_by: 0
% 1.01/1.21 % res_preprocessed: 34
% 1.01/1.21 % prep_upred: 0
% 1.01/1.21 % prep_unflattend: 0
% 1.01/1.21 % pred_elim_cands: 0
% 1.01/1.21 % pred_elim: 0
% 1.01/1.21 % pred_elim_cl: 0
% 1.01/1.21 % pred_elim_cycles: 0
% 1.01/1.21 % forced_gc_time: 0
% 1.01/1.21 % gc_basic_clause_elim: 0
% 1.01/1.21 % parsing_time: 0.
% 1.01/1.21 % sem_filter_time: 0.
% 1.01/1.21 % pred_elim_time: 0.
% 1.01/1.21 % out_proof_time: 0.001
% 1.01/1.21 % monotx_time: 0.
% 1.01/1.21 % subtype_inf_time: 0.
% 1.01/1.21 % unif_index_cands_time: 0.004
% 1.01/1.21 % unif_index_add_time: 0.001
% 1.01/1.21 % total_time: 0.806
% 1.01/1.21 % num_of_symbols: 32
% 1.01/1.21 % num_of_terms: 9986
% 1.01/1.21
% 1.01/1.21 % ------ Propositional Solver
% 1.01/1.21
% 1.01/1.21 % prop_solver_calls: 9
% 1.01/1.21 % prop_fast_solver_calls: 105
% 1.01/1.21 % prop_num_of_clauses: 423
% 1.01/1.21 % prop_preprocess_simplified: 915
% 1.01/1.21 % prop_fo_subsumed: 0
% 1.01/1.21 % prop_solver_time: 0.
% 1.01/1.21 % prop_fast_solver_time: 0.
% 1.01/1.21 % prop_unsat_core_time: 0.
% 1.01/1.21
% 1.01/1.21 % ------ QBF
% 1.01/1.21
% 1.01/1.21 % qbf_q_res: 0
% 1.01/1.21 % qbf_num_tautologies: 0
% 1.01/1.21 % qbf_prep_cycles: 0
% 1.01/1.21
% 1.01/1.21 % ------ BMC1
% 1.01/1.21
% 1.01/1.21 % bmc1_current_bound: -1
% 1.01/1.21 % bmc1_last_solved_bound: -1
% 1.01/1.21 % bmc1_unsat_core_size: -1
% 1.01/1.21 % bmc1_unsat_core_parents_size: -1
% 1.01/1.21 % bmc1_merge_next_fun: 0
% 1.01/1.21 % bmc1_unsat_core_clauses_time: 0.
% 1.01/1.21
% 1.01/1.21 % ------ Instantiation
% 1.01/1.21
% 1.01/1.21 % inst_num_of_clauses: 304
% 1.01/1.21 % inst_num_in_passive: 59
% 1.01/1.21 % inst_num_in_active: 174
% 1.01/1.21 % inst_num_in_unprocessed: 56
% 1.01/1.21 % inst_num_of_loops: 196
% 1.01/1.21 % inst_num_of_learning_restarts: 0
% 1.01/1.21 % inst_num_moves_active_passive: 6
% 1.01/1.21 % inst_lit_activity: 36
% 1.01/1.21 % inst_lit_activity_moves: 0
% 1.01/1.21 % inst_num_tautologies: 13
% 1.01/1.21 % inst_num_prop_implied: 0
% 1.01/1.21 % inst_num_existing_simplified: 0
% 1.01/1.21 % inst_num_eq_res_simplified: 0
% 1.01/1.21 % inst_num_child_elim: 0
% 1.01/1.21 % inst_num_of_dismatching_blockings: 253
% 1.01/1.21 % inst_num_of_non_proper_insts: 675
% 1.01/1.21 % inst_num_of_duplicates: 303
% 1.01/1.21 % inst_inst_num_from_inst_to_res: 0
% 1.01/1.21 % inst_dismatching_checking_time: 0.
% 1.01/1.21
% 1.01/1.21 % ------ Resolution
% 1.01/1.21
% 1.01/1.21 % res_num_of_clauses: 19411
% 1.01/1.21 % res_num_in_passive: 18494
% 1.01/1.21 % res_num_in_active: 959
% 1.01/1.21 % res_num_of_loops: 1000
% 1.01/1.21 % res_forward_subset_subsumed: 2328
% 1.01/1.21 % res_backward_subset_subsumed: 43
% 1.01/1.21 % res_forward_subsumed: 40
% 1.01/1.21 % res_backward_subsumed: 1
% 1.01/1.21 % res_forward_subsumption_resolution: 1
% 1.01/1.21 % res_backward_subsumption_resolution: 0
% 1.01/1.21 % res_clause_to_clause_subsumption: 19026
% 1.01/1.21 % res_orphan_elimination: 0
% 1.01/1.21 % res_tautology_del: 110
% 1.01/1.21 % res_num_eq_res_simplified: 0
% 1.01/1.21 % res_num_sel_changes: 0
% 1.01/1.21 % res_moves_from_active_to_pass: 0
% 1.01/1.21
% 1.01/1.21 % Status Unsatisfiable
% 1.01/1.21 % SZS status Unsatisfiable
% 1.01/1.21 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------