TSTP Solution File: PUZ016-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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 : Mon Jul 18 18:13:42 EDT 2022
% Result : Unsatisfiable 0.47s 0.87s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 25
% Syntax : Number of formulae : 165 ( 105 unt; 0 def)
% Number of atoms : 225 ( 66 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 131 ( 71 ~; 60 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-8 aty)
% Number of variables : 438 ( 0 sgn 174 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3,X4,X5,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,X5,X4,X3,X2,X1))
| achievable(row(successor(X7)),squares(complement(X8),complement(X9),complement(X6),complement(X5),complement(X4),complement(X3),complement(X2),complement(X1))) ),
file('<stdin>',place_vertical_pieces) ).
fof(c_0_1,axiom,
! [X3,X4,X5,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,X5,X4,X3,not_covered,not_covered))
| achievable(row(X7),squares(X8,X9,X6,X5,X4,X3,covered,covered)) ),
file('<stdin>',cover_columns_7_and_8) ).
fof(c_0_2,axiom,
! [X1,X4,X5,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,X5,X4,not_covered,not_covered,X1))
| achievable(row(X7),squares(X8,X9,X6,X5,X4,covered,covered,X1)) ),
file('<stdin>',cover_columns_6_and_7) ).
fof(c_0_3,axiom,
! [X1,X2,X5,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,X5,not_covered,not_covered,X2,X1))
| achievable(row(X7),squares(X8,X9,X6,X5,covered,covered,X2,X1)) ),
file('<stdin>',cover_columns_5_and_6) ).
fof(c_0_4,axiom,
! [X1,X2,X3,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,not_covered,not_covered,X3,X2,X1))
| achievable(row(X7),squares(X8,X9,X6,covered,covered,X3,X2,X1)) ),
file('<stdin>',cover_columns_4_and_5) ).
fof(c_0_5,axiom,
! [X1,X2,X3,X4,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,not_covered,not_covered,X4,X3,X2,X1))
| achievable(row(X7),squares(X8,X9,covered,covered,X4,X3,X2,X1)) ),
file('<stdin>',cover_columns_3_and_4) ).
fof(c_0_6,axiom,
! [X1,X2,X3,X4,X5,X8,X7] :
( ~ achievable(row(X7),squares(X8,not_covered,not_covered,X5,X4,X3,X2,X1))
| achievable(row(X7),squares(X8,covered,covered,X5,X4,X3,X2,X1)) ),
file('<stdin>',cover_columns_2_and_3) ).
fof(c_0_7,axiom,
! [X1,X2,X3,X4,X5,X6,X7] :
( ~ achievable(row(X7),squares(not_covered,not_covered,X6,X5,X4,X3,X2,X1))
| achievable(row(X7),squares(covered,covered,X6,X5,X4,X3,X2,X1)) ),
file('<stdin>',cover_columns_1_and_2) ).
fof(c_0_8,axiom,
complement(removed) = not_covered,
file('<stdin>',complement_of_removed_is_not_covered) ).
fof(c_0_9,axiom,
complement(not_covered) = covered,
file('<stdin>',complement_of_not_covered_is_covered) ).
fof(c_0_10,axiom,
complement(covered) = not_covered,
file('<stdin>',complement_of_covered_is_not_covered) ).
fof(c_0_11,axiom,
successor(n8) = n9,
file('<stdin>',successor_of_8_is_9) ).
fof(c_0_12,axiom,
successor(n7) = n8,
file('<stdin>',successor_of_7_is_8) ).
fof(c_0_13,axiom,
successor(n6) = n7,
file('<stdin>',successor_of_6_is_7) ).
fof(c_0_14,axiom,
successor(n5) = n6,
file('<stdin>',successor_of_5_is_6) ).
fof(c_0_15,axiom,
successor(n4) = n5,
file('<stdin>',successor_of_4_is_5) ).
fof(c_0_16,axiom,
successor(n3) = n4,
file('<stdin>',successor_of_3_is_4) ).
fof(c_0_17,axiom,
successor(n2) = n3,
file('<stdin>',successor_of_2_is_3) ).
fof(c_0_18,axiom,
successor(n1) = n2,
file('<stdin>',successor_of_1_is_2) ).
fof(c_0_19,plain,
! [X1,X2,X3,X4,X5,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,X5,X4,X3,X2,X1))
| achievable(row(successor(X7)),squares(complement(X8),complement(X9),complement(X6),complement(X5),complement(X4),complement(X3),complement(X2),complement(X1))) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_20,plain,
! [X3,X4,X5,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,X5,X4,X3,not_covered,not_covered))
| achievable(row(X7),squares(X8,X9,X6,X5,X4,X3,covered,covered)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_21,plain,
! [X1,X4,X5,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,X5,X4,not_covered,not_covered,X1))
| achievable(row(X7),squares(X8,X9,X6,X5,X4,covered,covered,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_22,plain,
! [X1,X2,X5,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,X5,not_covered,not_covered,X2,X1))
| achievable(row(X7),squares(X8,X9,X6,X5,covered,covered,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_23,plain,
! [X1,X2,X3,X6,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,X6,not_covered,not_covered,X3,X2,X1))
| achievable(row(X7),squares(X8,X9,X6,covered,covered,X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_24,plain,
! [X1,X2,X3,X4,X9,X8,X7] :
( ~ achievable(row(X7),squares(X8,X9,not_covered,not_covered,X4,X3,X2,X1))
| achievable(row(X7),squares(X8,X9,covered,covered,X4,X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_25,plain,
! [X1,X2,X3,X4,X5,X8,X7] :
( ~ achievable(row(X7),squares(X8,not_covered,not_covered,X5,X4,X3,X2,X1))
| achievable(row(X7),squares(X8,covered,covered,X5,X4,X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_26,plain,
! [X1,X2,X3,X4,X5,X6,X7] :
( ~ achievable(row(X7),squares(not_covered,not_covered,X6,X5,X4,X3,X2,X1))
| achievable(row(X7),squares(covered,covered,X6,X5,X4,X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_27,axiom,
complement(removed) = not_covered,
c_0_8 ).
fof(c_0_28,axiom,
complement(not_covered) = covered,
c_0_9 ).
fof(c_0_29,axiom,
complement(covered) = not_covered,
c_0_10 ).
fof(c_0_30,axiom,
successor(n8) = n9,
c_0_11 ).
fof(c_0_31,axiom,
successor(n7) = n8,
c_0_12 ).
fof(c_0_32,axiom,
successor(n6) = n7,
c_0_13 ).
fof(c_0_33,axiom,
successor(n5) = n6,
c_0_14 ).
fof(c_0_34,axiom,
successor(n4) = n5,
c_0_15 ).
fof(c_0_35,axiom,
successor(n3) = n4,
c_0_16 ).
fof(c_0_36,axiom,
successor(n2) = n3,
c_0_17 ).
fof(c_0_37,axiom,
successor(n1) = n2,
c_0_18 ).
fof(c_0_38,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17,X18] :
( ~ achievable(row(X18),squares(X17,X16,X15,X14,X13,X12,X11,X10))
| achievable(row(successor(X18)),squares(complement(X17),complement(X16),complement(X15),complement(X14),complement(X13),complement(X12),complement(X11),complement(X10))) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_39,plain,
! [X10,X11,X12,X13,X14,X15,X16] :
( ~ achievable(row(X16),squares(X15,X14,X13,X12,X11,X10,not_covered,not_covered))
| achievable(row(X16),squares(X15,X14,X13,X12,X11,X10,covered,covered)) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_40,plain,
! [X10,X11,X12,X13,X14,X15,X16] :
( ~ achievable(row(X16),squares(X15,X14,X13,X12,X11,not_covered,not_covered,X10))
| achievable(row(X16),squares(X15,X14,X13,X12,X11,covered,covered,X10)) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_41,plain,
! [X10,X11,X12,X13,X14,X15,X16] :
( ~ achievable(row(X16),squares(X15,X14,X13,X12,not_covered,not_covered,X11,X10))
| achievable(row(X16),squares(X15,X14,X13,X12,covered,covered,X11,X10)) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_42,plain,
! [X10,X11,X12,X13,X14,X15,X16] :
( ~ achievable(row(X16),squares(X15,X14,X13,not_covered,not_covered,X12,X11,X10))
| achievable(row(X16),squares(X15,X14,X13,covered,covered,X12,X11,X10)) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_43,plain,
! [X10,X11,X12,X13,X14,X15,X16] :
( ~ achievable(row(X16),squares(X15,X14,not_covered,not_covered,X13,X12,X11,X10))
| achievable(row(X16),squares(X15,X14,covered,covered,X13,X12,X11,X10)) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_44,plain,
! [X9,X10,X11,X12,X13,X14,X15] :
( ~ achievable(row(X15),squares(X14,not_covered,not_covered,X13,X12,X11,X10,X9))
| achievable(row(X15),squares(X14,covered,covered,X13,X12,X11,X10,X9)) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_45,plain,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ achievable(row(X14),squares(not_covered,not_covered,X13,X12,X11,X10,X9,X8))
| achievable(row(X14),squares(covered,covered,X13,X12,X11,X10,X9,X8)) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_46,axiom,
complement(removed) = not_covered,
c_0_27 ).
fof(c_0_47,axiom,
complement(not_covered) = covered,
c_0_28 ).
fof(c_0_48,axiom,
complement(covered) = not_covered,
c_0_29 ).
fof(c_0_49,axiom,
successor(n8) = n9,
c_0_30 ).
fof(c_0_50,axiom,
successor(n7) = n8,
c_0_31 ).
fof(c_0_51,axiom,
successor(n6) = n7,
c_0_32 ).
fof(c_0_52,axiom,
successor(n5) = n6,
c_0_33 ).
fof(c_0_53,axiom,
successor(n4) = n5,
c_0_34 ).
fof(c_0_54,axiom,
successor(n3) = n4,
c_0_35 ).
fof(c_0_55,axiom,
successor(n2) = n3,
c_0_36 ).
fof(c_0_56,axiom,
successor(n1) = n2,
c_0_37 ).
cnf(c_0_57,plain,
( achievable(row(successor(X1)),squares(complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8),complement(X9)))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,X8,X9)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_58,plain,
( achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,covered,covered))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,not_covered,not_covered)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_59,plain,
( achievable(row(X1),squares(X2,X3,X4,X5,X6,covered,covered,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,not_covered,not_covered,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_60,plain,
( achievable(row(X1),squares(X2,X3,X4,X5,covered,covered,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,not_covered,not_covered,X6,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_61,plain,
( achievable(row(X1),squares(X2,X3,X4,covered,covered,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,not_covered,not_covered,X5,X6,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_62,plain,
( achievable(row(X1),squares(X2,X3,covered,covered,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,not_covered,not_covered,X4,X5,X6,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_63,plain,
( achievable(row(X1),squares(X2,covered,covered,X3,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,not_covered,not_covered,X3,X4,X5,X6,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_64,plain,
( achievable(row(X1),squares(covered,covered,X2,X3,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(not_covered,not_covered,X2,X3,X4,X5,X6,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_65,plain,
complement(removed) = not_covered,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_66,plain,
complement(not_covered) = covered,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_67,plain,
complement(covered) = not_covered,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_68,plain,
successor(n8) = n9,
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_69,plain,
successor(n7) = n8,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_70,plain,
successor(n6) = n7,
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_71,plain,
successor(n5) = n6,
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_72,plain,
successor(n4) = n5,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_73,plain,
successor(n3) = n4,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_74,plain,
successor(n2) = n3,
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_75,plain,
successor(n1) = n2,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_76,plain,
( achievable(row(successor(X1)),squares(complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8),complement(X9)))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,X8,X9)) ),
c_0_57,
[final] ).
cnf(c_0_77,plain,
( achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,covered,covered))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,not_covered,not_covered)) ),
c_0_58,
[final] ).
cnf(c_0_78,plain,
( achievable(row(X1),squares(X2,X3,X4,X5,X6,covered,covered,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,not_covered,not_covered,X7)) ),
c_0_59,
[final] ).
cnf(c_0_79,plain,
( achievable(row(X1),squares(X2,X3,X4,X5,covered,covered,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,not_covered,not_covered,X6,X7)) ),
c_0_60,
[final] ).
cnf(c_0_80,plain,
( achievable(row(X1),squares(X2,X3,X4,covered,covered,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,not_covered,not_covered,X5,X6,X7)) ),
c_0_61,
[final] ).
cnf(c_0_81,plain,
( achievable(row(X1),squares(X2,X3,covered,covered,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,not_covered,not_covered,X4,X5,X6,X7)) ),
c_0_62,
[final] ).
cnf(c_0_82,plain,
( achievable(row(X1),squares(X2,covered,covered,X3,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,not_covered,not_covered,X3,X4,X5,X6,X7)) ),
c_0_63,
[final] ).
cnf(c_0_83,plain,
( achievable(row(X1),squares(covered,covered,X2,X3,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(not_covered,not_covered,X2,X3,X4,X5,X6,X7)) ),
c_0_64,
[final] ).
cnf(c_0_84,plain,
complement(removed) = not_covered,
c_0_65,
[final] ).
cnf(c_0_85,plain,
complement(not_covered) = covered,
c_0_66,
[final] ).
cnf(c_0_86,plain,
complement(covered) = not_covered,
c_0_67,
[final] ).
cnf(c_0_87,plain,
successor(n8) = n9,
c_0_68,
[final] ).
cnf(c_0_88,plain,
successor(n7) = n8,
c_0_69,
[final] ).
cnf(c_0_89,plain,
successor(n6) = n7,
c_0_70,
[final] ).
cnf(c_0_90,plain,
successor(n5) = n6,
c_0_71,
[final] ).
cnf(c_0_91,plain,
successor(n4) = n5,
c_0_72,
[final] ).
cnf(c_0_92,plain,
successor(n3) = n4,
c_0_73,
[final] ).
cnf(c_0_93,plain,
successor(n2) = n3,
c_0_74,
[final] ).
cnf(c_0_94,plain,
successor(n1) = n2,
c_0_75,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_76_0,axiom,
( achievable(row(successor(X1)),squares(complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8),complement(X9)))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,X8,X9)) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_1,axiom,
( ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,X8,X9))
| achievable(row(successor(X1)),squares(complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8),complement(X9))) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_77_0,axiom,
( achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,covered,covered))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,not_covered,not_covered)) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_1,axiom,
( ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,not_covered,not_covered))
| achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,covered,covered)) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_78_0,axiom,
( achievable(row(X1),squares(X2,X3,X4,X5,X6,covered,covered,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,not_covered,not_covered,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,not_covered,not_covered,X7))
| achievable(row(X1),squares(X2,X3,X4,X5,X6,covered,covered,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( achievable(row(X1),squares(X2,X3,X4,X5,covered,covered,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,not_covered,not_covered,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( ~ achievable(row(X1),squares(X2,X3,X4,X5,not_covered,not_covered,X6,X7))
| achievable(row(X1),squares(X2,X3,X4,X5,covered,covered,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_80_0,axiom,
( achievable(row(X1),squares(X2,X3,X4,covered,covered,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,X4,not_covered,not_covered,X5,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_80_1,axiom,
( ~ achievable(row(X1),squares(X2,X3,X4,not_covered,not_covered,X5,X6,X7))
| achievable(row(X1),squares(X2,X3,X4,covered,covered,X5,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_81_0,axiom,
( achievable(row(X1),squares(X2,X3,covered,covered,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,X3,not_covered,not_covered,X4,X5,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_81_1,axiom,
( ~ achievable(row(X1),squares(X2,X3,not_covered,not_covered,X4,X5,X6,X7))
| achievable(row(X1),squares(X2,X3,covered,covered,X4,X5,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_82_0,axiom,
( achievable(row(X1),squares(X2,covered,covered,X3,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,not_covered,not_covered,X3,X4,X5,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_1,axiom,
( ~ achievable(row(X1),squares(X2,not_covered,not_covered,X3,X4,X5,X6,X7))
| achievable(row(X1),squares(X2,covered,covered,X3,X4,X5,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_83_0,axiom,
( achievable(row(X1),squares(covered,covered,X2,X3,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(not_covered,not_covered,X2,X3,X4,X5,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_1,axiom,
( ~ achievable(row(X1),squares(not_covered,not_covered,X2,X3,X4,X5,X6,X7))
| achievable(row(X1),squares(covered,covered,X2,X3,X4,X5,X6,X7)) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_84_0,axiom,
complement(removed) = not_covered,
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_85_0,axiom,
complement(not_covered) = covered,
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_86_0,axiom,
complement(covered) = not_covered,
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_87_0,axiom,
successor(n8) = n9,
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_88_0,axiom,
successor(n7) = n8,
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_89_0,axiom,
successor(n6) = n7,
inference(literals_permutation,[status(thm)],[c_0_89]) ).
cnf(c_0_90_0,axiom,
successor(n5) = n6,
inference(literals_permutation,[status(thm)],[c_0_90]) ).
cnf(c_0_91_0,axiom,
successor(n4) = n5,
inference(literals_permutation,[status(thm)],[c_0_91]) ).
cnf(c_0_92_0,axiom,
successor(n3) = n4,
inference(literals_permutation,[status(thm)],[c_0_92]) ).
cnf(c_0_93_0,axiom,
successor(n2) = n3,
inference(literals_permutation,[status(thm)],[c_0_93]) ).
cnf(c_0_94_0,axiom,
successor(n1) = n2,
inference(literals_permutation,[status(thm)],[c_0_94]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
file('<stdin>',prove_row_8_can_be_covered) ).
fof(c_0_1_002,hypothesis,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
file('<stdin>',first_row_initially) ).
fof(c_0_2_003,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_004,hypothesis,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
c_0_1 ).
fof(c_0_4_005,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
c_0_2 ).
fof(c_0_5_006,hypothesis,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
c_0_3 ).
cnf(c_0_6_007,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,hypothesis,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
c_0_6,
[final] ).
cnf(c_0_9_010,hypothesis,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_28,plain,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p',c_0_9) ).
cnf(c_37,plain,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_44,plain,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_45,plain,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_48,plain,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_123,plain,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_25,plain,
( achievable(row(successor(X0)),squares(complement(X1),complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8)))
| ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,X7,X8)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p',c_0_76_1) ).
cnf(c_117,plain,
( achievable(row(successor(X0)),squares(complement(X1),complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8)))
| ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,X7,X8)) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_137,plain,
achievable(row(successor(n1)),squares(complement(not_covered),complement(removed),complement(removed),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
inference(resolution,[status(thm)],[c_123,c_117]) ).
cnf(c_138,plain,
achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(rewriting,[status(thm)],[c_137]) ).
cnf(c_13,plain,
( achievable(row(X0),squares(X1,covered,covered,X2,X3,X4,X5,X6))
| ~ achievable(row(X0),squares(X1,not_covered,not_covered,X2,X3,X4,X5,X6)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p',c_0_82_1) ).
cnf(c_93,plain,
( achievable(row(X0),squares(X1,covered,covered,X2,X3,X4,X5,X6))
| ~ achievable(row(X0),squares(X1,not_covered,not_covered,X2,X3,X4,X5,X6)) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_169,plain,
achievable(row(n2),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(resolution,[status(thm)],[c_138,c_93]) ).
cnf(c_170,plain,
achievable(row(n2),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(rewriting,[status(thm)],[c_169]) ).
cnf(c_221,plain,
achievable(row(successor(n2)),squares(complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
inference(resolution,[status(thm)],[c_170,c_117]) ).
cnf(c_222,plain,
achievable(row(n3),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(rewriting,[status(thm)],[c_221]) ).
cnf(c_345,plain,
achievable(row(successor(n3)),squares(complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
inference(resolution,[status(thm)],[c_222,c_117]) ).
cnf(c_346,plain,
achievable(row(n4),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(rewriting,[status(thm)],[c_345]) ).
cnf(c_543,plain,
achievable(row(successor(n4)),squares(complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
inference(resolution,[status(thm)],[c_346,c_117]) ).
cnf(c_544,plain,
achievable(row(n5),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(rewriting,[status(thm)],[c_543]) ).
cnf(c_807,plain,
achievable(row(successor(n5)),squares(complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
inference(resolution,[status(thm)],[c_544,c_117]) ).
cnf(c_808,plain,
achievable(row(n6),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(rewriting,[status(thm)],[c_807]) ).
cnf(c_1141,plain,
achievable(row(successor(n6)),squares(complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
inference(resolution,[status(thm)],[c_808,c_117]) ).
cnf(c_1142,plain,
achievable(row(n7),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(rewriting,[status(thm)],[c_1141]) ).
cnf(c_1529,plain,
achievable(row(successor(n7)),squares(complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
inference(resolution,[status(thm)],[c_1142,c_117]) ).
cnf(c_1530,plain,
achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(rewriting,[status(thm)],[c_1529]) ).
cnf(c_27,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p',c_0_8) ).
cnf(c_39,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_43,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_46,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_47,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_121,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_1970,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1530,c_121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n020.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat May 28 22:33:54 EDT 2022
% 0.14/0.35 % 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_864bb7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_8d3a01 | 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.32/0.55 % --bmc1_dump_unsat_core_tptp false
% 0.32/0.55 % --bmc1_dump_file -
% 0.32/0.55 % --bmc1_ucm_expand_uc_limit 128
% 0.32/0.55 % --bmc1_ucm_n_expand_iterations 6
% 0.32/0.55 % --bmc1_ucm_extend_mode 1
% 0.32/0.55 % --bmc1_ucm_init_mode 2
% 0.32/0.55 % --bmc1_ucm_cone_mode none
% 0.32/0.55 % --bmc1_ucm_reduced_relation_type 0
% 0.32/0.55 % --bmc1_ucm_relax_model 4
% 0.32/0.55 % --bmc1_ucm_full_tr_after_sat true
% 0.32/0.55 % --bmc1_ucm_expand_neg_assumptions false
% 0.32/0.55 % --bmc1_ucm_layered_model none
% 0.32/0.55 % --bmc1_ucm_max_lemma_size 10
% 0.32/0.55
% 0.32/0.55 % ------ AIG Options
% 0.32/0.55
% 0.32/0.55 % --aig_mode false
% 0.32/0.55
% 0.32/0.55 % ------ Instantiation Options
% 0.32/0.55
% 0.32/0.55 % --instantiation_flag true
% 0.32/0.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.32/0.55 % --inst_solver_per_active 750
% 0.32/0.55 % --inst_solver_calls_frac 0.5
% 0.32/0.55 % --inst_passive_queue_type priority_queues
% 0.32/0.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.32/0.55 % --inst_passive_queues_freq [25;2]
% 0.32/0.55 % --inst_dismatching true
% 0.32/0.55 % --inst_eager_unprocessed_to_passive true
% 0.32/0.55 % --inst_prop_sim_given true
% 0.32/0.55 % --inst_prop_sim_new false
% 0.32/0.55 % --inst_orphan_elimination true
% 0.32/0.55 % --inst_learning_loop_flag true
% 0.32/0.55 % --inst_learning_start 3000
% 0.32/0.55 % --inst_learning_factor 2
% 0.32/0.55 % --inst_start_prop_sim_after_learn 3
% 0.32/0.55 % --inst_sel_renew solver
% 0.32/0.55 % --inst_lit_activity_flag true
% 0.32/0.55 % --inst_out_proof true
% 0.32/0.55
% 0.32/0.55 % ------ Resolution Options
% 0.32/0.55
% 0.32/0.55 % --resolution_flag true
% 0.32/0.55 % --res_lit_sel kbo_max
% 0.32/0.55 % --res_to_prop_solver none
% 0.32/0.55 % --res_prop_simpl_new false
% 0.32/0.55 % --res_prop_simpl_given false
% 0.32/0.55 % --res_passive_queue_type priority_queues
% 0.32/0.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.32/0.55 % --res_passive_queues_freq [15;5]
% 0.32/0.55 % --res_forward_subs full
% 0.32/0.55 % --res_backward_subs full
% 0.32/0.55 % --res_forward_subs_resolution true
% 0.32/0.55 % --res_backward_subs_resolution true
% 0.32/0.55 % --res_orphan_elimination false
% 0.32/0.55 % --res_time_limit 1000.
% 0.32/0.55 % --res_out_proof true
% 0.32/0.55 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_864bb7.s
% 0.32/0.55 % --modulo true
% 0.32/0.55
% 0.32/0.55 % ------ Combination Options
% 0.32/0.55
% 0.32/0.55 % --comb_res_mult 1000
% 0.32/0.55 % --comb_inst_mult 300
% 0.32/0.55 % ------
% 0.32/0.55
% 0.32/0.55 % ------ Parsing...% successful
% 0.32/0.55
% 0.32/0.55 % ------ 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.32/0.55
% 0.32/0.55 % ------ Proving...
% 0.32/0.55 % ------ Problem Properties
% 0.32/0.55
% 0.32/0.55 %
% 0.32/0.55 % EPR false
% 0.32/0.55 % Horn true
% 0.32/0.55 % Has equality true
% 0.32/0.55
% 0.32/0.55 % % ------ Input Options Time Limit: Unbounded
% 0.32/0.55
% 0.32/0.55
% 0.32/0.55 Compiling...
% 0.32/0.55 Loading plugin: done.
% 0.32/0.55 % % ------ Current options:
% 0.32/0.55
% 0.32/0.55 % ------ Input Options
% 0.32/0.55
% 0.32/0.55 % --out_options all
% 0.32/0.55 % --tptp_safe_out true
% 0.32/0.55 % --problem_path ""
% 0.32/0.55 % --include_path ""
% 0.32/0.55 % --clausifier .//eprover
% 0.32/0.55 % --clausifier_options --tstp-format
% 0.32/0.55 % --stdin false
% 0.32/0.55 % --dbg_backtrace false
% 0.32/0.55 % --dbg_dump_prop_clauses false
% 0.32/0.55 % --dbg_dump_prop_clauses_file -
% 0.32/0.55 % --dbg_out_stat false
% 0.32/0.55
% 0.32/0.55 % ------ General Options
% 0.32/0.55
% 0.32/0.55 % --fof false
% 0.32/0.55 % --time_out_real 150.
% 0.32/0.55 % --time_out_prep_mult 0.2
% 0.32/0.55 % --time_out_virtual -1.
% 0.32/0.55 % --schedule none
% 0.32/0.55 % --ground_splitting input
% 0.32/0.55 % --splitting_nvd 16
% 0.32/0.55 % --non_eq_to_eq false
% 0.32/0.55 % --prep_gs_sim true
% 0.32/0.55 % --prep_unflatten false
% 0.32/0.55 % --prep_res_sim true
% 0.32/0.55 % --prep_upred true
% 0.32/0.55 % --res_sim_input true
% 0.32/0.55 % --clause_weak_htbl true
% 0.32/0.55 % --gc_record_bc_elim false
% 0.32/0.55 % --symbol_type_check false
% 0.32/0.55 % --clausify_out false
% 0.32/0.55 % --large_theory_mode false
% 0.32/0.55 % --prep_sem_filter none
% 0.32/0.55 % --prep_sem_filter_out false
% 0.32/0.55 % --preprocessed_out false
% 0.32/0.55 % --sub_typing false
% 0.32/0.55 % --brand_transform false
% 0.32/0.55 % --pure_diseq_elim true
% 0.32/0.55 % --min_unsat_core false
% 0.32/0.55 % --pred_elim true
% 0.32/0.55 % --add_important_lit false
% 0.32/0.55 % --soft_assumptions false
% 0.32/0.55 % --reset_solvers false
% 0.32/0.55 % --bc_imp_inh []
% 0.32/0.55 % --conj_cone_tolerance 1.5
% 0.32/0.55 % --prolific_symb_bound 500
% 0.32/0.55 % --lt_threshold 2000
% 0.32/0.55
% 0.32/0.55 % ------ SAT Options
% 0.32/0.55
% 0.32/0.55 % --sat_mode false
% 0.32/0.55 % --sat_fm_restart_options ""
% 0.32/0.55 % --sat_gr_def false
% 0.32/0.55 % --sat_epr_types true
% 0.32/0.55 % --sat_non_cyclic_types false
% 0.32/0.55 % --sat_finite_models false
% 0.32/0.55 % --sat_fm_lemmas false
% 0.32/0.55 % --sat_fm_prep false
% 0.32/0.55 % --sat_fm_uc_incr true
% 0.32/0.55 % --sat_out_model small
% 0.32/0.55 % --sat_out_clauses false
% 0.32/0.55
% 0.32/0.55 % ------ QBF Options
% 0.32/0.55
% 0.32/0.55 % --qbf_mode false
% 0.32/0.55 % --qbf_elim_univ true
% 0.32/0.55 % --qbf_sk_in true
% 0.32/0.55 % --qbf_pred_elim true
% 0.32/0.55 % --qbf_split 32
% 0.32/0.55
% 0.32/0.55 % ------ BMC1 Options
% 0.32/0.55
% 0.32/0.55 % --bmc1_incremental false
% 0.32/0.55 % --bmc1_axioms reachable_all
% 0.32/0.55 % --bmc1_min_bound 0
% 0.32/0.55 % --bmc1_max_bound -1
% 0.32/0.55 % --bmc1_max_bound_default -1
% 0.32/0.55 % --bmc1_symbol_reachability true
% 0.32/0.55 % --bmc1_property_lemmas false
% 0.32/0.55 % --bmc1_k_induction false
% 0.32/0.55 % --bmc1_non_equiv_states false
% 0.32/0.55 % --bmc1_deadlock false
% 0.32/0.55 % --bmc1_ucm false
% 0.32/0.55 % --bmc1_add_unsat_core none
% 0.32/0.55 % --bmc1_unsat_core_children false
% 0.32/0.55 % --bmc1_unsat_core_extrapolate_axioms false
% 0.32/0.55 % --bmc1_out_stat full
% 0.32/0.55 % --bmc1_ground_init false
% 0.32/0.55 % --bmc1_pre_inst_next_state false
% 0.32/0.55 % --bmc1_pre_inst_state false
% 0.32/0.55 % --bmc1_pre_inst_reach_state false
% 0.32/0.55 % --bmc1_out_unsat_core false
% 0.32/0.55 % --bmc1_aig_witness_out false
% 0.32/0.55 % --bmc1_verbose false
% 0.32/0.55 % --bmc1_dump_clauses_tptp false
% 0.32/0.55 % --bmc1_dump_unsat_core_tptp false
% 0.32/0.55 % --bmc1_dump_file -
% 0.32/0.55 % --bmc1_ucm_expand_uc_limit 128
% 0.32/0.55 % --bmc1_ucm_n_expand_iterations 6
% 0.32/0.55 % --bmc1_ucm_extend_mode 1
% 0.32/0.55 % --bmc1_ucm_init_mode 2
% 0.32/0.55 % --bmc1_ucm_cone_mode none
% 0.32/0.55 % --bmc1_ucm_reduced_relation_type 0
% 0.32/0.55 % --bmc1_ucm_relax_model 4
% 0.32/0.55 % --bmc1_ucm_full_tr_after_sat true
% 0.32/0.55 % --bmc1_ucm_expand_neg_assumptions false
% 0.32/0.55 % --bmc1_ucm_layered_model none
% 0.32/0.55 % --bmc1_ucm_max_lemma_size 10
% 0.32/0.55
% 0.32/0.55 % ------ AIG Options
% 0.32/0.55
% 0.32/0.55 % --aig_mode false
% 0.32/0.55
% 0.32/0.55 % ------ Instantiation Options
% 0.32/0.55
% 0.32/0.55 % --instantiation_flag true
% 0.32/0.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.32/0.55 % --inst_solver_per_active 750
% 0.32/0.55 % --inst_solver_calls_frac 0.5
% 0.32/0.55 % --inst_passive_queue_type priority_queues
% 0.32/0.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.32/0.55 % --inst_passive_queues_freq [25;2]
% 0.32/0.55 % --inst_dismatching true
% 0.32/0.55 % --inst_eager_unprocessed_to_passive true
% 0.32/0.56 % --inst_prop_sim_given true
% 0.32/0.56 % --inst_prop_sim_new false
% 0.32/0.56 % --inst_orphan_elimination true
% 0.32/0.56 % --inst_learning_loop_flag true
% 0.32/0.56 % --inst_learning_start 3000
% 0.32/0.56 % --inst_learning_factor 2
% 0.32/0.56 % --inst_start_prop_sim_after_learn 3
% 0.32/0.56 % --inst_sel_renew solver
% 0.32/0.56 % --inst_lit_activity_flag true
% 0.32/0.56 % --inst_out_proof true
% 0.32/0.56
% 0.32/0.56 % ------ Resolution Options
% 0.32/0.56
% 0.32/0.56 % --resolution_flag true
% 0.32/0.56 % --res_lit_sel kbo_max
% 0.32/0.56 % --res_to_prop_solver none
% 0.32/0.56 % --res_prop_simpl_new false
% 0.32/0.56 % --res_prop_simpl_given false
% 0.32/0.56 % --res_passive_queue_type priority_queues
% 0.32/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.32/0.56 % --res_passive_queues_freq [15;5]
% 0.32/0.56 % --res_forward_subs full
% 0.32/0.56 % --res_backward_subs full
% 0.32/0.56 % --res_forward_subs_resolution true
% 0.32/0.56 % --res_backward_subs_resolution true
% 0.32/0.56 % --res_orphan_elimination false
% 0.32/0.56 % --res_time_limit 1000.
% 0.32/0.56 % --res_out_proof true
% 0.32/0.56 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_864bb7.s
% 0.32/0.56 % --modulo true
% 0.32/0.56
% 0.32/0.56 % ------ Combination Options
% 0.32/0.56
% 0.32/0.56 % --comb_res_mult 1000
% 0.32/0.56 % --comb_inst_mult 300
% 0.32/0.56 % ------
% 0.32/0.56
% 0.32/0.56
% 0.32/0.56
% 0.32/0.56 % ------ Proving...
% 0.32/0.56 % warning: shown sat in sat incomplete mode
% 0.32/0.56 %
% 0.32/0.56
% 0.32/0.56
% 0.32/0.56
% 0.32/0.56
% 0.32/0.56 cnf(c_27,negated_conjecture,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_8) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_39,negated_conjecture,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_27]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_43,negated_conjecture,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_39]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_46,negated_conjecture,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_43]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_47,negated_conjecture,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_46]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_121,negated_conjecture,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_47]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_2,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(not_covered,not_covered,X1,X2,X3,X4,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(covered,covered,X1,X2,X3,X4,X5,X6)) ),
% 0.32/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_33_0) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_82,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(not_covered,not_covered,X1,X2,X3,X4,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(covered,covered,X1,X2,X3,X4,X5,X6)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_2]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_83,plain,
% 0.32/0.56 ( achievable(row(X0),squares(covered,covered,X1,X2,X3,X4,X5,X6))
% 0.32/0.56 | ~ achievable(row(X0),squares(not_covered,not_covered,X1,X2,X3,X4,X5,X6)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_82]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_127,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_121,c_83]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_128,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_127]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_6,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,not_covered,not_covered,X3,X4,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,covered,covered,X3,X4,X5,X6)) ),
% 0.32/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_35_0) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_90,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,not_covered,not_covered,X3,X4,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,covered,covered,X3,X4,X5,X6)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_6]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_91,plain,
% 0.32/0.56 ( achievable(row(X0),squares(X1,X2,covered,covered,X3,X4,X5,X6))
% 0.32/0.56 | ~ achievable(row(X0),squares(X1,X2,not_covered,not_covered,X3,X4,X5,X6)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_90]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_143,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_128,c_91]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_144,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_143]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_10,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,X3,X4,not_covered,not_covered,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,X3,X4,covered,covered,X5,X6)) ),
% 0.32/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_37_0) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_98,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,X3,X4,not_covered,not_covered,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,X3,X4,covered,covered,X5,X6)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_10]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_99,plain,
% 0.32/0.56 ( achievable(row(X0),squares(X1,X2,X3,X4,covered,covered,X5,X6))
% 0.32/0.56 | ~ achievable(row(X0),squares(X1,X2,X3,X4,not_covered,not_covered,X5,X6)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_98]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_217,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_144,c_99]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_218,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_217]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_14,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,not_covered,not_covered))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,covered,covered)) ),
% 0.32/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_39_0) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_106,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,not_covered,not_covered))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,covered,covered)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_14]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_107,plain,
% 0.32/0.56 ( achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,covered,covered))
% 0.32/0.56 | ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_106]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_309,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_218,c_107]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_310,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_309]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_131,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_121,c_91]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_132,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_131]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_167,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_132,c_99]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_168,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_167]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_275,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_168,c_107]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_276,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_275]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_4,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,not_covered,not_covered,X2,X3,X4,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,covered,covered,X2,X3,X4,X5,X6)) ),
% 0.32/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_34_0) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_86,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,not_covered,not_covered,X2,X3,X4,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,covered,covered,X2,X3,X4,X5,X6)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_4]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_87,plain,
% 0.32/0.56 ( achievable(row(X0),squares(X1,covered,covered,X2,X3,X4,X5,X6))
% 0.32/0.56 | ~ achievable(row(X0),squares(X1,not_covered,not_covered,X2,X3,X4,X5,X6)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_86]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_129,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_121,c_87]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_130,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_129]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_157,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_130,c_99]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_158,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_157]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_257,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_158,c_107]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_258,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_257]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_8,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,X3,not_covered,not_covered,X4,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,X3,covered,covered,X4,X5,X6)) ),
% 0.32/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_36_0) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_94,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,X3,not_covered,not_covered,X4,X5,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,X3,covered,covered,X4,X5,X6)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_8]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_95,plain,
% 0.32/0.56 ( achievable(row(X0),squares(X1,X2,X3,covered,covered,X4,X5,X6))
% 0.32/0.56 | ~ achievable(row(X0),squares(X1,X2,X3,not_covered,not_covered,X4,X5,X6)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_94]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_155,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,not_covered,not_covered,covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_130,c_95]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_156,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,not_covered,not_covered,covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_155]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_253,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,not_covered,not_covered,covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_156,c_107]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_254,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,not_covered,not_covered,covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_253]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_12,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,not_covered,not_covered,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,X3,X4,X5,covered,covered,X6)) ),
% 0.32/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_38_0) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_102,plain,
% 0.32/0.56 ( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,not_covered,not_covered,X6))
% 0.32/0.56 | achievable(row(X0),squares(X1,X2,X3,X4,X5,covered,covered,X6)) ),
% 0.32/0.56 inference(copy,[status(esa)],[c_12]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_103,plain,
% 0.32/0.56 ( achievable(row(X0),squares(X1,X2,X3,X4,X5,covered,covered,X6))
% 0.32/0.56 | ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,not_covered,not_covered,X6)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_102]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_251,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_156,c_103]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_252,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_251]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_147,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_128,c_99]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_148,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_147]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_233,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_148,c_107]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_234,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_233]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_145,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,not_covered,not_covered,covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_128,c_95]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_146,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,not_covered,not_covered,covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_145]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_227,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,not_covered,not_covered,covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_146,c_107]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_228,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,not_covered,not_covered,covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_227]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_225,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,not_covered,not_covered,not_covered,not_covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_146,c_103]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_226,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,not_covered,not_covered,not_covered,not_covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_225]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_221,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_144,c_107]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_222,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_221]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_219,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_144,c_103]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_220,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(not_covered,not_covered,not_covered,not_covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_219]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_135,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_121,c_99]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_136,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,not_covered,not_covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_135]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_191,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_136,c_107]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_192,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_191]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_133,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,not_covered,not_covered,covered,covered,covered)) ),
% 0.32/0.56 inference(resolution,[status(thm)],[c_121,c_95]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_134,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,not_covered,not_covered,covered,covered,covered)) ),
% 0.32/0.56 inference(rewriting,[status(thm)],[c_133]) ).
% 0.32/0.56
% 0.32/0.56 cnf(c_181,plain,
% 0.32/0.56 ( ~ achievable(row(n8),squares(covered,covered,covered,not_covered,not_covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_134,c_107]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_182,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,covered,not_covered,not_covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_181]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_179,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,covered,not_covered,not_covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_134,c_103]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_180,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,covered,not_covered,not_covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_179]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_171,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_132,c_107]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_172,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_171]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_169,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_132,c_103]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_170,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,not_covered,not_covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_169]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_161,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_130,c_107]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_162,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_161]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_159,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_130,c_103]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_160,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_159]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_151,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_128,c_107]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_152,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_151]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_149,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_128,c_103]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_150,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(not_covered,not_covered,covered,covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_149]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_139,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_121,c_107]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_140,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_139]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_137,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(resolution,[status(thm)],[c_121,c_103]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_138,plain,
% 0.32/0.57 ( ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,not_covered,not_covered,covered)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_137]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_28,plain,
% 0.32/0.57 ( achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.57 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_9) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_37,plain,
% 0.32/0.57 ( achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(copy,[status(esa)],[c_28]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_44,plain,
% 0.32/0.57 ( achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(copy,[status(esa)],[c_37]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_45,plain,
% 0.32/0.57 ( achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(copy,[status(esa)],[c_44]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_48,plain,
% 0.32/0.57 ( achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(copy,[status(esa)],[c_45]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_123,plain,
% 0.32/0.57 ( achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)) ),
% 0.32/0.57 inference(copy,[status(esa)],[c_48]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_0,plain,
% 0.32/0.57 ( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,X7,X8))
% 0.32/0.57 | achievable(row(successor(X0)),squares(complement(X1),complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8))) ),
% 0.32/0.57 file('/export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p', c_0_32_0) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_78,plain,
% 0.32/0.57 ( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,X7,X8))
% 0.32/0.57 | achievable(row(successor(X0)),squares(complement(X1),complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8))) ),
% 0.32/0.57 inference(copy,[status(esa)],[c_0]) ).
% 0.32/0.57
% 0.32/0.57 cnf(c_79,plain,
% 0.32/0.57 ( achievable(row(successor(X0)),squares(complement(X1),complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8)))
% 0.32/0.57 | ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,X7,X8)) ),
% 0.32/0.57 inference(rewriting,[status(thm)],[c_78]) ).
% 0.32/0.57
% 0.32/0.57
% 0.32/0.57
% 0.32/0.57 % ------ Statistics
% 0.32/0.57
% 0.32/0.57 % ------ General
% 0.32/0.57
% 0.32/0.57 % num_of_input_clauses: 29
% 0.32/0.57 % num_of_input_neg_conjectures: 1
% 0.32/0.57 % num_of_splits: 0
% 0.32/0.57 % num_of_split_atoms: 0
% 0.32/0.57 % num_of_sem_filtered_clauses: 0
% 0.32/0.57 % num_of_subtypes: 0
% 0.32/0.57 % monotx_restored_types: 0
% 0.32/0.57 % sat_num_of_epr_types: 0
% 0.32/0.57 % sat_num_of_non_cyclic_types: 0
% 0.32/0.57 % sat_guarded_non_collapsed_types: 0
% 0.32/0.57 % is_epr: 0
% 0.32/0.57 % is_horn: 1
% 0.32/0.57 % has_eq: 1
% 0.32/0.57 % num_pure_diseq_elim: 0
% 0.32/0.57 % simp_replaced_by: 0
% 0.32/0.57 % res_preprocessed: 3
% 0.32/0.57 % prep_upred: 0
% 0.32/0.57 % prep_unflattend: 0
% 0.32/0.57 % pred_elim_cands: 0
% 0.32/0.57 % pred_elim: 0
% 0.32/0.57 % pred_elim_cl: 0
% 0.32/0.57 % pred_elim_cycles: 0
% 0.32/0.57 % forced_gc_time: 0
% 0.32/0.57 % gc_basic_clause_elim: 0
% 0.32/0.57 % parsing_time: 0.002
% 0.32/0.57 % sem_filter_time: 0.
% 0.32/0.57 % pred_elim_time: 0.
% 0.32/0.57 % out_proof_time: 0.
% 0.32/0.57 % monotx_time: 0.
% 0.32/0.57 % subtype_inf_time: 0.
% 0.32/0.57 % unif_index_cands_time: 0.
% 0.32/0.57 % unif_index_add_time: 0.
% 0.32/0.57 % total_time: 0.148
% 0.32/0.57 % num_of_symbols: 42
% 0.32/0.57 % num_of_terms: 230
% 0.32/0.57
% 0.32/0.57 % ------ Propositional Solver
% 0.32/0.57
% 0.32/0.57 % prop_solver_calls: 1
% 0.32/0.57 % prop_fast_solver_calls: 5
% 0.32/0.57 % prop_num_of_clauses: 29
% 0.32/0.57 % prop_preprocess_simplified: 74
% 0.32/0.57 % prop_fo_subsumed: 0
% 0.32/0.57 % prop_solver_time: 0.
% 0.32/0.57 % prop_fast_solver_time: 0.
% 0.32/0.57 % prop_unsat_core_time: 0.
% 0.32/0.57
% 0.32/0.57 % ------ QBF
% 0.32/0.57
% 0.32/0.57 % qbf_q_res: 0
% 0.32/0.57 % qbf_num_tautologies: 0
% 0.32/0.57 % qbf_prep_cycles: 0
% 0.32/0.57
% 0.32/0.57 % ------ BMC1
% 0.32/0.57
% 0.32/0.57 % bmc1_current_bound: -1
% 0.32/0.57 % bmc1_last_solved_bound: -1
% 0.32/0.57 % bmc1_unsat_core_size: -1
% 0.32/0.57 % bmc1_unsat_core_parents_size: -1
% 0.32/0.57 % bmc1_merge_next_fun: 0
% 0.32/0.57 % bmc1_unsat_core_clauses_time: 0.
% 0.32/0.57
% 0.32/0.57 % ------ Instantiation
% 0.32/0.57
% 0.32/0.57 % inst_num_of_clauses: 29
% 0.32/0.57 % inst_num_in_passive: 0
% 0.32/0.57 % inst_num_in_active: 0
% 0.32/0.57 % inst_num_in_unprocessed: 29
% 0.32/0.57 % inst_num_of_loops: 0
% 0.32/0.57 % inst_num_of_learning_restarts: 0
% 0.32/0.57 % inst_num_moves_active_passive: 0
% 0.32/0.57 % inst_lit_activity: 0
% 0.32/0.57 % inst_lit_activity_moves: 0
% 0.32/0.57 % inst_num_tautologies: 0
% 0.32/0.57 % inst_num_prop_implied: 0
% 0.32/0.57 % inst_num_existing_simplified: 0
% 0.32/0.57 % inst_num_eq_res_simplified: 0
% 0.32/0.57 % inst_num_child_elim: 0
% 0.32/0.57 % inst_num_of_dismatching_blockings: 0
% 0.32/0.57 % inst_num_of_non_proper_insts: 0
% 0.32/0.57 % inst_num_of_duplicates: 0
% 0.32/0.57 % inst_inst_num_from_inst_to_res: 0
% 0.32/0.57 % inst_dismatching_checking_time: 0.
% 0.32/0.57
% 0.32/0.57 % ------ Resolution
% 0.32/0.57
% 0.32/0.57 % res_num_of_clauses: 62
% 0.32/0.57 % res_num_in_passive: 0
% 0.32/0.57 % res_num_in_active: 43
% 0.32/0.57 % res_num_of_loops: 36
% 0.32/0.57 % res_forward_subset_subsumed: 46
% 0.32/0.57 % res_backward_subset_subsumed: 0
% 0.32/0.57 % res_forward_subsumed: 0
% 0.32/0.57 % res_backward_subsumed: 0
% 0.32/0.57 % res_forward_subsumption_resolution: 0
% 0.32/0.57 % res_backward_subsumption_resolution: 0
% 0.32/0.57 % res_clause_to_clause_subsumption: 342
% 0.32/0.57 % res_orphan_elimination: 0
% 0.32/0.57 % res_tautology_del: 0
% 0.32/0.57 % res_num_eq_res_simplified: 0
% 0.32/0.57 % res_num_sel_changes: 0
% 0.32/0.57 % res_moves_from_active_to_pass: 0
% 0.32/0.57
% 0.32/0.57 % Status Unknown
% 0.32/0.62 % Orienting using strategy ClausalAll
% 0.32/0.62 % Orientation found
% 0.32/0.62 % 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_864bb7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_ae4d1b.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_435b13 | grep -v "SZS"
% 0.47/0.64
% 0.47/0.64 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.47/0.64
% 0.47/0.64 %
% 0.47/0.64 % ------ iProver source info
% 0.47/0.64
% 0.47/0.64 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.47/0.64 % git: non_committed_changes: true
% 0.47/0.64 % git: last_make_outside_of_git: true
% 0.47/0.64
% 0.47/0.64 %
% 0.47/0.64 % ------ Input Options
% 0.47/0.64
% 0.47/0.64 % --out_options all
% 0.47/0.64 % --tptp_safe_out true
% 0.47/0.64 % --problem_path ""
% 0.47/0.64 % --include_path ""
% 0.47/0.64 % --clausifier .//eprover
% 0.47/0.64 % --clausifier_options --tstp-format
% 0.47/0.64 % --stdin false
% 0.47/0.64 % --dbg_backtrace false
% 0.47/0.64 % --dbg_dump_prop_clauses false
% 0.47/0.64 % --dbg_dump_prop_clauses_file -
% 0.47/0.64 % --dbg_out_stat false
% 0.47/0.64
% 0.47/0.64 % ------ General Options
% 0.47/0.64
% 0.47/0.64 % --fof false
% 0.47/0.64 % --time_out_real 150.
% 0.47/0.64 % --time_out_prep_mult 0.2
% 0.47/0.64 % --time_out_virtual -1.
% 0.47/0.64 % --schedule none
% 0.47/0.64 % --ground_splitting input
% 0.47/0.64 % --splitting_nvd 16
% 0.47/0.64 % --non_eq_to_eq false
% 0.47/0.64 % --prep_gs_sim true
% 0.47/0.64 % --prep_unflatten false
% 0.47/0.64 % --prep_res_sim true
% 0.47/0.64 % --prep_upred true
% 0.47/0.64 % --res_sim_input true
% 0.47/0.64 % --clause_weak_htbl true
% 0.47/0.64 % --gc_record_bc_elim false
% 0.47/0.64 % --symbol_type_check false
% 0.47/0.64 % --clausify_out false
% 0.47/0.64 % --large_theory_mode false
% 0.47/0.64 % --prep_sem_filter none
% 0.47/0.64 % --prep_sem_filter_out false
% 0.47/0.64 % --preprocessed_out false
% 0.47/0.64 % --sub_typing false
% 0.47/0.64 % --brand_transform false
% 0.47/0.64 % --pure_diseq_elim true
% 0.47/0.64 % --min_unsat_core false
% 0.47/0.64 % --pred_elim true
% 0.47/0.64 % --add_important_lit false
% 0.47/0.64 % --soft_assumptions false
% 0.47/0.64 % --reset_solvers false
% 0.47/0.64 % --bc_imp_inh []
% 0.47/0.64 % --conj_cone_tolerance 1.5
% 0.47/0.64 % --prolific_symb_bound 500
% 0.47/0.64 % --lt_threshold 2000
% 0.47/0.64
% 0.47/0.64 % ------ SAT Options
% 0.47/0.64
% 0.47/0.64 % --sat_mode false
% 0.47/0.64 % --sat_fm_restart_options ""
% 0.47/0.64 % --sat_gr_def false
% 0.47/0.64 % --sat_epr_types true
% 0.47/0.64 % --sat_non_cyclic_types false
% 0.47/0.64 % --sat_finite_models false
% 0.47/0.64 % --sat_fm_lemmas false
% 0.47/0.64 % --sat_fm_prep false
% 0.47/0.64 % --sat_fm_uc_incr true
% 0.47/0.64 % --sat_out_model small
% 0.47/0.64 % --sat_out_clauses false
% 0.47/0.64
% 0.47/0.64 % ------ QBF Options
% 0.47/0.64
% 0.47/0.64 % --qbf_mode false
% 0.47/0.64 % --qbf_elim_univ true
% 0.47/0.64 % --qbf_sk_in true
% 0.47/0.64 % --qbf_pred_elim true
% 0.47/0.64 % --qbf_split 32
% 0.47/0.64
% 0.47/0.64 % ------ BMC1 Options
% 0.47/0.64
% 0.47/0.64 % --bmc1_incremental false
% 0.47/0.64 % --bmc1_axioms reachable_all
% 0.47/0.64 % --bmc1_min_bound 0
% 0.47/0.64 % --bmc1_max_bound -1
% 0.47/0.64 % --bmc1_max_bound_default -1
% 0.47/0.64 % --bmc1_symbol_reachability true
% 0.47/0.64 % --bmc1_property_lemmas false
% 0.47/0.64 % --bmc1_k_induction false
% 0.47/0.64 % --bmc1_non_equiv_states false
% 0.47/0.64 % --bmc1_deadlock false
% 0.47/0.64 % --bmc1_ucm false
% 0.47/0.64 % --bmc1_add_unsat_core none
% 0.47/0.64 % --bmc1_unsat_core_children false
% 0.47/0.64 % --bmc1_unsat_core_extrapolate_axioms false
% 0.47/0.64 % --bmc1_out_stat full
% 0.47/0.64 % --bmc1_ground_init false
% 0.47/0.64 % --bmc1_pre_inst_next_state false
% 0.47/0.64 % --bmc1_pre_inst_state false
% 0.47/0.64 % --bmc1_pre_inst_reach_state false
% 0.47/0.64 % --bmc1_out_unsat_core false
% 0.47/0.64 % --bmc1_aig_witness_out false
% 0.47/0.64 % --bmc1_verbose false
% 0.47/0.64 % --bmc1_dump_clauses_tptp false
% 0.47/0.82 % --bmc1_dump_unsat_core_tptp false
% 0.47/0.82 % --bmc1_dump_file -
% 0.47/0.82 % --bmc1_ucm_expand_uc_limit 128
% 0.47/0.82 % --bmc1_ucm_n_expand_iterations 6
% 0.47/0.82 % --bmc1_ucm_extend_mode 1
% 0.47/0.82 % --bmc1_ucm_init_mode 2
% 0.47/0.82 % --bmc1_ucm_cone_mode none
% 0.47/0.82 % --bmc1_ucm_reduced_relation_type 0
% 0.47/0.82 % --bmc1_ucm_relax_model 4
% 0.47/0.82 % --bmc1_ucm_full_tr_after_sat true
% 0.47/0.82 % --bmc1_ucm_expand_neg_assumptions false
% 0.47/0.82 % --bmc1_ucm_layered_model none
% 0.47/0.82 % --bmc1_ucm_max_lemma_size 10
% 0.47/0.82
% 0.47/0.82 % ------ AIG Options
% 0.47/0.82
% 0.47/0.82 % --aig_mode false
% 0.47/0.82
% 0.47/0.82 % ------ Instantiation Options
% 0.47/0.82
% 0.47/0.82 % --instantiation_flag true
% 0.47/0.82 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.47/0.82 % --inst_solver_per_active 750
% 0.47/0.82 % --inst_solver_calls_frac 0.5
% 0.47/0.82 % --inst_passive_queue_type priority_queues
% 0.47/0.82 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.47/0.82 % --inst_passive_queues_freq [25;2]
% 0.47/0.82 % --inst_dismatching true
% 0.47/0.82 % --inst_eager_unprocessed_to_passive true
% 0.47/0.82 % --inst_prop_sim_given true
% 0.47/0.82 % --inst_prop_sim_new false
% 0.47/0.82 % --inst_orphan_elimination true
% 0.47/0.82 % --inst_learning_loop_flag true
% 0.47/0.82 % --inst_learning_start 3000
% 0.47/0.82 % --inst_learning_factor 2
% 0.47/0.82 % --inst_start_prop_sim_after_learn 3
% 0.47/0.82 % --inst_sel_renew solver
% 0.47/0.82 % --inst_lit_activity_flag true
% 0.47/0.82 % --inst_out_proof true
% 0.47/0.82
% 0.47/0.82 % ------ Resolution Options
% 0.47/0.82
% 0.47/0.82 % --resolution_flag true
% 0.47/0.82 % --res_lit_sel kbo_max
% 0.47/0.82 % --res_to_prop_solver none
% 0.47/0.82 % --res_prop_simpl_new false
% 0.47/0.82 % --res_prop_simpl_given false
% 0.47/0.82 % --res_passive_queue_type priority_queues
% 0.47/0.82 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.47/0.82 % --res_passive_queues_freq [15;5]
% 0.47/0.82 % --res_forward_subs full
% 0.47/0.82 % --res_backward_subs full
% 0.47/0.82 % --res_forward_subs_resolution true
% 0.47/0.82 % --res_backward_subs_resolution true
% 0.47/0.82 % --res_orphan_elimination false
% 0.47/0.82 % --res_time_limit 1000.
% 0.47/0.82 % --res_out_proof true
% 0.47/0.82 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_864bb7.s
% 0.47/0.82 % --modulo true
% 0.47/0.82
% 0.47/0.82 % ------ Combination Options
% 0.47/0.82
% 0.47/0.82 % --comb_res_mult 1000
% 0.47/0.82 % --comb_inst_mult 300
% 0.47/0.82 % ------
% 0.47/0.82
% 0.47/0.82 % ------ Parsing...% successful
% 0.47/0.82
% 0.47/0.82 % ------ 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.47/0.82
% 0.47/0.82 % ------ Proving...
% 0.47/0.82 % ------ Problem Properties
% 0.47/0.82
% 0.47/0.82 %
% 0.47/0.82 % EPR false
% 0.47/0.82 % Horn true
% 0.47/0.82 % Has equality true
% 0.47/0.82
% 0.47/0.82 % % ------ Input Options Time Limit: Unbounded
% 0.47/0.82
% 0.47/0.82
% 0.47/0.82 Compiling...
% 0.47/0.82 Loading plugin: done.
% 0.47/0.82 % % ------ Current options:
% 0.47/0.82
% 0.47/0.82 % ------ Input Options
% 0.47/0.82
% 0.47/0.82 % --out_options all
% 0.47/0.82 % --tptp_safe_out true
% 0.47/0.82 % --problem_path ""
% 0.47/0.82 % --include_path ""
% 0.47/0.82 % --clausifier .//eprover
% 0.47/0.82 % --clausifier_options --tstp-format
% 0.47/0.82 % --stdin false
% 0.47/0.82 % --dbg_backtrace false
% 0.47/0.82 % --dbg_dump_prop_clauses false
% 0.47/0.82 % --dbg_dump_prop_clauses_file -
% 0.47/0.82 % --dbg_out_stat false
% 0.47/0.82
% 0.47/0.82 % ------ General Options
% 0.47/0.82
% 0.47/0.82 % --fof false
% 0.47/0.82 % --time_out_real 150.
% 0.47/0.82 % --time_out_prep_mult 0.2
% 0.47/0.82 % --time_out_virtual -1.
% 0.47/0.82 % --schedule none
% 0.47/0.82 % --ground_splitting input
% 0.47/0.82 % --splitting_nvd 16
% 0.47/0.82 % --non_eq_to_eq false
% 0.47/0.82 % --prep_gs_sim true
% 0.47/0.82 % --prep_unflatten false
% 0.47/0.82 % --prep_res_sim true
% 0.47/0.82 % --prep_upred true
% 0.47/0.82 % --res_sim_input true
% 0.47/0.82 % --clause_weak_htbl true
% 0.47/0.82 % --gc_record_bc_elim false
% 0.47/0.82 % --symbol_type_check false
% 0.47/0.82 % --clausify_out false
% 0.47/0.82 % --large_theory_mode false
% 0.47/0.82 % --prep_sem_filter none
% 0.47/0.82 % --prep_sem_filter_out false
% 0.47/0.82 % --preprocessed_out false
% 0.47/0.82 % --sub_typing false
% 0.47/0.82 % --brand_transform false
% 0.47/0.82 % --pure_diseq_elim true
% 0.47/0.82 % --min_unsat_core false
% 0.47/0.82 % --pred_elim true
% 0.47/0.82 % --add_important_lit false
% 0.47/0.82 % --soft_assumptions false
% 0.47/0.82 % --reset_solvers false
% 0.47/0.82 % --bc_imp_inh []
% 0.47/0.82 % --conj_cone_tolerance 1.5
% 0.47/0.82 % --prolific_symb_bound 500
% 0.47/0.82 % --lt_threshold 2000
% 0.47/0.82
% 0.47/0.82 % ------ SAT Options
% 0.47/0.82
% 0.47/0.82 % --sat_mode false
% 0.47/0.82 % --sat_fm_restart_options ""
% 0.47/0.82 % --sat_gr_def false
% 0.47/0.82 % --sat_epr_types true
% 0.47/0.82 % --sat_non_cyclic_types false
% 0.47/0.82 % --sat_finite_models false
% 0.47/0.82 % --sat_fm_lemmas false
% 0.47/0.82 % --sat_fm_prep false
% 0.47/0.82 % --sat_fm_uc_incr true
% 0.47/0.82 % --sat_out_model small
% 0.47/0.82 % --sat_out_clauses false
% 0.47/0.82
% 0.47/0.82 % ------ QBF Options
% 0.47/0.82
% 0.47/0.82 % --qbf_mode false
% 0.47/0.82 % --qbf_elim_univ true
% 0.47/0.82 % --qbf_sk_in true
% 0.47/0.82 % --qbf_pred_elim true
% 0.47/0.82 % --qbf_split 32
% 0.47/0.82
% 0.47/0.82 % ------ BMC1 Options
% 0.47/0.82
% 0.47/0.82 % --bmc1_incremental false
% 0.47/0.82 % --bmc1_axioms reachable_all
% 0.47/0.82 % --bmc1_min_bound 0
% 0.47/0.82 % --bmc1_max_bound -1
% 0.47/0.82 % --bmc1_max_bound_default -1
% 0.47/0.82 % --bmc1_symbol_reachability true
% 0.47/0.82 % --bmc1_property_lemmas false
% 0.47/0.82 % --bmc1_k_induction false
% 0.47/0.82 % --bmc1_non_equiv_states false
% 0.47/0.82 % --bmc1_deadlock false
% 0.47/0.82 % --bmc1_ucm false
% 0.47/0.82 % --bmc1_add_unsat_core none
% 0.47/0.82 % --bmc1_unsat_core_children false
% 0.47/0.82 % --bmc1_unsat_core_extrapolate_axioms false
% 0.47/0.82 % --bmc1_out_stat full
% 0.47/0.82 % --bmc1_ground_init false
% 0.47/0.82 % --bmc1_pre_inst_next_state false
% 0.47/0.82 % --bmc1_pre_inst_state false
% 0.47/0.82 % --bmc1_pre_inst_reach_state false
% 0.47/0.82 % --bmc1_out_unsat_core false
% 0.47/0.82 % --bmc1_aig_witness_out false
% 0.47/0.82 % --bmc1_verbose false
% 0.47/0.82 % --bmc1_dump_clauses_tptp false
% 0.47/0.82 % --bmc1_dump_unsat_core_tptp false
% 0.47/0.82 % --bmc1_dump_file -
% 0.47/0.82 % --bmc1_ucm_expand_uc_limit 128
% 0.47/0.82 % --bmc1_ucm_n_expand_iterations 6
% 0.47/0.82 % --bmc1_ucm_extend_mode 1
% 0.47/0.82 % --bmc1_ucm_init_mode 2
% 0.47/0.82 % --bmc1_ucm_cone_mode none
% 0.47/0.82 % --bmc1_ucm_reduced_relation_type 0
% 0.47/0.82 % --bmc1_ucm_relax_model 4
% 0.47/0.82 % --bmc1_ucm_full_tr_after_sat true
% 0.47/0.82 % --bmc1_ucm_expand_neg_assumptions false
% 0.47/0.82 % --bmc1_ucm_layered_model none
% 0.47/0.82 % --bmc1_ucm_max_lemma_size 10
% 0.47/0.82
% 0.47/0.82 % ------ AIG Options
% 0.47/0.82
% 0.47/0.82 % --aig_mode false
% 0.47/0.82
% 0.47/0.82 % ------ Instantiation Options
% 0.47/0.82
% 0.47/0.82 % --instantiation_flag true
% 0.47/0.82 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.47/0.82 % --inst_solver_per_active 750
% 0.47/0.82 % --inst_solver_calls_frac 0.5
% 0.47/0.82 % --inst_passive_queue_type priority_queues
% 0.47/0.82 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.47/0.82 % --inst_passive_queues_freq [25;2]
% 0.47/0.82 % --inst_dismatching true
% 0.47/0.82 % --inst_eager_unprocessed_to_passive true
% 0.47/0.87 % --inst_prop_sim_given true
% 0.47/0.87 % --inst_prop_sim_new false
% 0.47/0.87 % --inst_orphan_elimination true
% 0.47/0.87 % --inst_learning_loop_flag true
% 0.47/0.87 % --inst_learning_start 3000
% 0.47/0.87 % --inst_learning_factor 2
% 0.47/0.87 % --inst_start_prop_sim_after_learn 3
% 0.47/0.87 % --inst_sel_renew solver
% 0.47/0.87 % --inst_lit_activity_flag true
% 0.47/0.87 % --inst_out_proof true
% 0.47/0.87
% 0.47/0.87 % ------ Resolution Options
% 0.47/0.87
% 0.47/0.87 % --resolution_flag true
% 0.47/0.87 % --res_lit_sel kbo_max
% 0.47/0.87 % --res_to_prop_solver none
% 0.47/0.87 % --res_prop_simpl_new false
% 0.47/0.87 % --res_prop_simpl_given false
% 0.47/0.87 % --res_passive_queue_type priority_queues
% 0.47/0.87 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.47/0.87 % --res_passive_queues_freq [15;5]
% 0.47/0.87 % --res_forward_subs full
% 0.47/0.87 % --res_backward_subs full
% 0.47/0.87 % --res_forward_subs_resolution true
% 0.47/0.87 % --res_backward_subs_resolution true
% 0.47/0.87 % --res_orphan_elimination false
% 0.47/0.87 % --res_time_limit 1000.
% 0.47/0.87 % --res_out_proof true
% 0.47/0.87 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_864bb7.s
% 0.47/0.87 % --modulo true
% 0.47/0.87
% 0.47/0.87 % ------ Combination Options
% 0.47/0.87
% 0.47/0.87 % --comb_res_mult 1000
% 0.47/0.87 % --comb_inst_mult 300
% 0.47/0.87 % ------
% 0.47/0.87
% 0.47/0.87
% 0.47/0.87
% 0.47/0.87 % ------ Proving...
% 0.47/0.87 %
% 0.47/0.87
% 0.47/0.87
% 0.47/0.87 % Resolution empty clause
% 0.47/0.87
% 0.47/0.87 % ------ Statistics
% 0.47/0.87
% 0.47/0.87 % ------ General
% 0.47/0.87
% 0.47/0.87 % num_of_input_clauses: 29
% 0.47/0.87 % num_of_input_neg_conjectures: 1
% 0.47/0.87 % num_of_splits: 0
% 0.47/0.87 % num_of_split_atoms: 0
% 0.47/0.87 % num_of_sem_filtered_clauses: 0
% 0.47/0.87 % num_of_subtypes: 0
% 0.47/0.87 % monotx_restored_types: 0
% 0.47/0.87 % sat_num_of_epr_types: 0
% 0.47/0.87 % sat_num_of_non_cyclic_types: 0
% 0.47/0.87 % sat_guarded_non_collapsed_types: 0
% 0.47/0.87 % is_epr: 0
% 0.47/0.87 % is_horn: 1
% 0.47/0.87 % has_eq: 1
% 0.47/0.87 % num_pure_diseq_elim: 0
% 0.47/0.87 % simp_replaced_by: 0
% 0.47/0.87 % res_preprocessed: 3
% 0.47/0.87 % prep_upred: 0
% 0.47/0.87 % prep_unflattend: 0
% 0.47/0.87 % pred_elim_cands: 0
% 0.47/0.87 % pred_elim: 0
% 0.47/0.87 % pred_elim_cl: 0
% 0.47/0.87 % pred_elim_cycles: 0
% 0.47/0.87 % forced_gc_time: 0
% 0.47/0.87 % gc_basic_clause_elim: 0
% 0.47/0.87 % parsing_time: 0.001
% 0.47/0.87 % sem_filter_time: 0.
% 0.47/0.87 % pred_elim_time: 0.
% 0.47/0.87 % out_proof_time: 0.001
% 0.47/0.87 % monotx_time: 0.
% 0.47/0.87 % subtype_inf_time: 0.
% 0.47/0.87 % unif_index_cands_time: 0.
% 0.47/0.87 % unif_index_add_time: 0.
% 0.47/0.87 % total_time: 0.244
% 0.47/0.87 % num_of_symbols: 42
% 0.47/0.87 % num_of_terms: 1035
% 0.47/0.87
% 0.47/0.87 % ------ Propositional Solver
% 0.47/0.87
% 0.47/0.87 % prop_solver_calls: 1
% 0.47/0.87 % prop_fast_solver_calls: 5
% 0.47/0.87 % prop_num_of_clauses: 29
% 0.47/0.87 % prop_preprocess_simplified: 74
% 0.47/0.87 % prop_fo_subsumed: 0
% 0.47/0.87 % prop_solver_time: 0.
% 0.47/0.87 % prop_fast_solver_time: 0.
% 0.47/0.87 % prop_unsat_core_time: 0.
% 0.47/0.87
% 0.47/0.87 % ------ QBF
% 0.47/0.87
% 0.47/0.87 % qbf_q_res: 0
% 0.47/0.87 % qbf_num_tautologies: 0
% 0.47/0.87 % qbf_prep_cycles: 0
% 0.47/0.87
% 0.47/0.87 % ------ BMC1
% 0.47/0.87
% 0.47/0.87 % bmc1_current_bound: -1
% 0.47/0.87 % bmc1_last_solved_bound: -1
% 0.47/0.87 % bmc1_unsat_core_size: -1
% 0.47/0.87 % bmc1_unsat_core_parents_size: -1
% 0.47/0.87 % bmc1_merge_next_fun: 0
% 0.47/0.87 % bmc1_unsat_core_clauses_time: 0.
% 0.47/0.87
% 0.47/0.87 % ------ Instantiation
% 0.47/0.87
% 0.47/0.87 % inst_num_of_clauses: 29
% 0.47/0.87 % inst_num_in_passive: 0
% 0.47/0.87 % inst_num_in_active: 0
% 0.47/0.87 % inst_num_in_unprocessed: 29
% 0.47/0.87 % inst_num_of_loops: 0
% 0.47/0.87 % inst_num_of_learning_restarts: 0
% 0.47/0.87 % inst_num_moves_active_passive: 0
% 0.47/0.87 % inst_lit_activity: 0
% 0.47/0.87 % inst_lit_activity_moves: 0
% 0.47/0.87 % inst_num_tautologies: 0
% 0.47/0.87 % inst_num_prop_implied: 0
% 0.47/0.87 % inst_num_existing_simplified: 0
% 0.47/0.87 % inst_num_eq_res_simplified: 0
% 0.47/0.87 % inst_num_child_elim: 0
% 0.47/0.87 % inst_num_of_dismatching_blockings: 0
% 0.47/0.87 % inst_num_of_non_proper_insts: 0
% 0.47/0.87 % inst_num_of_duplicates: 0
% 0.47/0.87 % inst_inst_num_from_inst_to_res: 0
% 0.47/0.87 % inst_dismatching_checking_time: 0.
% 0.47/0.87
% 0.47/0.87 % ------ Resolution
% 0.47/0.87
% 0.47/0.87 % res_num_of_clauses: 313
% 0.47/0.87 % res_num_in_passive: 57
% 0.47/0.87 % res_num_in_active: 236
% 0.47/0.87 % res_num_of_loops: 229
% 0.47/0.87 % res_forward_subset_subsumed: 418
% 0.47/0.87 % res_backward_subset_subsumed: 0
% 0.47/0.87 % res_forward_subsumed: 0
% 0.47/0.87 % res_backward_subsumed: 0
% 0.47/0.87 % res_forward_subsumption_resolution: 1
% 0.47/0.87 % res_backward_subsumption_resolution: 0
% 0.47/0.87 % res_clause_to_clause_subsumption: 3013
% 0.47/0.87 % res_orphan_elimination: 0
% 0.47/0.87 % res_tautology_del: 0
% 0.47/0.87 % res_num_eq_res_simplified: 0
% 0.47/0.87 % res_num_sel_changes: 0
% 0.47/0.87 % res_moves_from_active_to_pass: 0
% 0.47/0.87
% 0.47/0.87 % Status Unsatisfiable
% 0.47/0.87 % SZS status Unsatisfiable
% 0.47/0.87 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------