%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT052-1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:12:34 AM UTC 2026
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of formulae : 164 ( 14 unt; 0 def)
% Number of atoms : 440 ( 38 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 493 ( 217 ~; 276 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 365 ( 20 sgn 132 !; 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,
! [X3,X1,X2] :
( ~ dissimilar(X2,X1,X3)
| ~ is_aligned(X2,X1)
| ~ is_aligned(X2,X3) ),
file('<stdin>',definition_2_31) ).
fof(c_0_1,axiom,
! [X3,X1,X2] :
( ~ dissimilar(X2,X1,X3)
| is_aligned(X2,X1)
| is_aligned(X2,X3) ),
file('<stdin>',definition_2_30) ).
fof(c_0_2,axiom,
! [X3,X1,X2] :
( ~ organization(X2)
| ~ is_aligned(X2,X1)
| is_aligned(X2,X1)
| dissimilar(X2,X3,X1) ),
file('<stdin>',definition_2_35) ).
fof(c_0_3,axiom,
! [X3,X1,X2] :
( ~ organization(X2)
| ~ is_aligned(X2,X1)
| is_aligned(X2,X3)
| dissimilar(X2,X3,X1) ),
file('<stdin>',definition_2_34) ).
fof(c_0_4,axiom,
! [X3,X1,X2] :
( ~ organization(X2)
| ~ is_aligned(X2,X1)
| is_aligned(X2,X3)
| dissimilar(X2,X1,X3) ),
file('<stdin>',definition_2_33) ).
fof(c_0_5,axiom,
! [X3,X1,X2] :
( ~ organization(X2)
| ~ is_aligned(X2,X1)
| is_aligned(X2,X1)
| dissimilar(X2,X1,X3) ),
file('<stdin>',definition_2_32) ).
fof(c_0_6,axiom,
! [X3,X1,X2] :
( ~ dissimilar(X2,X1,X3)
| organization(X2) ),
file('<stdin>',definition_2_29) ).
fof(c_0_7,axiom,
! [X3,X1,X2] :
( ~ greater(X2,X1)
| ~ greater(X1,X3)
| greater(X2,X3) ),
file('<stdin>',meaning_postulate_greater_transitive_10) ).
fof(c_0_8,axiom,
! [X1,X2] :
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
file('<stdin>',meaning_postulate_greater_strict_9) ).
fof(c_0_9,axiom,
! [X1,X2] :
( ~ greater_or_equal(X2,X1)
| greater(X2,X1)
| X2 = X1 ),
file('<stdin>',definition_greater_or_equal_4) ).
fof(c_0_10,axiom,
! [X1,X2] :
( ~ smaller_or_equal(X2,X1)
| smaller(X2,X1)
| X2 = X1 ),
file('<stdin>',definition_smaller_or_equal_1) ).
fof(c_0_11,axiom,
! [X1,X2] :
( ~ greater(X2,X1)
| smaller(X1,X2) ),
file('<stdin>',definition_smaller_8) ).
fof(c_0_12,axiom,
! [X1,X2] :
( ~ smaller(X2,X1)
| greater(X1,X2) ),
file('<stdin>',definition_smaller_7) ).
fof(c_0_13,axiom,
! [X1,X2] :
( ~ greater(X2,X1)
| greater_or_equal(X2,X1) ),
file('<stdin>',definition_greater_or_equal_5) ).
fof(c_0_14,axiom,
! [X1,X2] :
( ~ smaller(X2,X1)
| smaller_or_equal(X2,X1) ),
file('<stdin>',definition_smaller_or_equal_2) ).
fof(c_0_15,axiom,
! [X1,X2] :
( smaller(X2,X1)
| X2 = X1
| greater(X2,X1) ),
file('<stdin>',meaning_postulate_greater_comparable_11) ).
fof(c_0_16,axiom,
! [X1,X2] :
( X2 != X1
| greater_or_equal(X2,X1) ),
file('<stdin>',definition_greater_or_equal_6) ).
fof(c_0_17,axiom,
! [X1,X2] :
( X2 != X1
| smaller_or_equal(X2,X1) ),
file('<stdin>',definition_smaller_or_equal_3) ).
fof(c_0_18,plain,
! [X3,X1,X2] :
( ~ dissimilar(X2,X1,X3)
| ~ is_aligned(X2,X1)
| ~ is_aligned(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_19,plain,
! [X3,X1,X2] :
( ~ dissimilar(X2,X1,X3)
| is_aligned(X2,X1)
| is_aligned(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_20,plain,
! [X3,X1,X2] :
( ~ organization(X2)
| ~ is_aligned(X2,X1)
| is_aligned(X2,X1)
| dissimilar(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_21,plain,
! [X3,X1,X2] :
( ~ organization(X2)
| ~ is_aligned(X2,X1)
| is_aligned(X2,X3)
| dissimilar(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_22,plain,
! [X3,X1,X2] :
( ~ organization(X2)
| ~ is_aligned(X2,X1)
| is_aligned(X2,X3)
| dissimilar(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_23,plain,
! [X3,X1,X2] :
( ~ organization(X2)
| ~ is_aligned(X2,X1)
| is_aligned(X2,X1)
| dissimilar(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_24,plain,
! [X3,X1,X2] :
( ~ dissimilar(X2,X1,X3)
| organization(X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_25,plain,
! [X3,X1,X2] :
( ~ greater(X2,X1)
| ~ greater(X1,X3)
| greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_26,plain,
! [X1,X2] :
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_27,plain,
! [X1,X2] :
( ~ greater_or_equal(X2,X1)
| greater(X2,X1)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_28,plain,
! [X1,X2] :
( ~ smaller_or_equal(X2,X1)
| smaller(X2,X1)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_29,plain,
! [X1,X2] :
( ~ greater(X2,X1)
| smaller(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_30,plain,
! [X1,X2] :
( ~ smaller(X2,X1)
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_31,plain,
! [X1,X2] :
( ~ greater(X2,X1)
| greater_or_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_32,plain,
! [X1,X2] :
( ~ smaller(X2,X1)
| smaller_or_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_33,axiom,
! [X1,X2] :
( smaller(X2,X1)
| X2 = X1
| greater(X2,X1) ),
c_0_15 ).
fof(c_0_34,axiom,
! [X1,X2] :
( X2 != X1
| greater_or_equal(X2,X1) ),
c_0_16 ).
fof(c_0_35,axiom,
! [X1,X2] :
( X2 != X1
| smaller_or_equal(X2,X1) ),
c_0_17 ).
fof(c_0_36,plain,
! [X4,X5,X6] :
( ~ dissimilar(X6,X5,X4)
| ~ is_aligned(X6,X5)
| ~ is_aligned(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_37,plain,
! [X4,X5,X6] :
( ~ dissimilar(X6,X5,X4)
| is_aligned(X6,X5)
| is_aligned(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_38,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| ~ is_aligned(X6,X5)
| is_aligned(X6,X5)
| dissimilar(X6,X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_39,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| ~ is_aligned(X6,X5)
| is_aligned(X6,X4)
| dissimilar(X6,X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_40,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| ~ is_aligned(X6,X5)
| is_aligned(X6,X4)
| dissimilar(X6,X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_41,plain,
! [X4,X5,X6] :
( ~ organization(X6)
| ~ is_aligned(X6,X5)
| is_aligned(X6,X5)
| dissimilar(X6,X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_42,plain,
! [X4,X5,X6] :
( ~ dissimilar(X6,X5,X4)
| organization(X6) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_43,plain,
! [X4,X5,X6] :
( ~ greater(X6,X5)
| ~ greater(X5,X4)
| greater(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_44,plain,
! [X3,X4] :
( ~ greater(X4,X3)
| ~ greater(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ~ greater_or_equal(X4,X3)
| greater(X4,X3)
| X4 = X3 ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_46,plain,
! [X3,X4] :
( ~ smaller_or_equal(X4,X3)
| smaller(X4,X3)
| X4 = X3 ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_47,plain,
! [X3,X4] :
( ~ greater(X4,X3)
| smaller(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_48,plain,
! [X3,X4] :
( ~ smaller(X4,X3)
| greater(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_49,plain,
! [X3,X4] :
( ~ greater(X4,X3)
| greater_or_equal(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_50,plain,
! [X3,X4] :
( ~ smaller(X4,X3)
| smaller_or_equal(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_51,plain,
! [X3,X4] :
( smaller(X4,X3)
| X4 = X3
| greater(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_52,plain,
! [X3,X4] :
( X4 != X3
| greater_or_equal(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_53,plain,
! [X3,X4] :
( X4 != X3
| smaller_or_equal(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
cnf(c_0_54,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_55,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_56,plain,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X3)
| ~ is_aligned(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_57,plain,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_58,plain,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X3)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_59,plain,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X2)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_60,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_61,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_62,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_63,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_64,plain,
( X1 = X2
| smaller(X1,X2)
| ~ smaller_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_65,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_66,plain,
( greater(X1,X2)
| ~ smaller(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_67,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_68,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_69,plain,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_70,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_71,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_72,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
c_0_54,
[final] ).
cnf(c_0_73,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
c_0_55,
[final] ).
cnf(c_0_74,plain,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X3)
| ~ is_aligned(X1,X3)
| ~ organization(X1) ),
c_0_56,
[final] ).
cnf(c_0_75,plain,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ organization(X1) ),
c_0_57,
[final] ).
cnf(c_0_76,plain,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X3)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
c_0_58,
[final] ).
cnf(c_0_77,plain,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X2)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
c_0_59,
[final] ).
cnf(c_0_78,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
c_0_60,
[final] ).
cnf(c_0_79,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
c_0_61,
[final] ).
cnf(c_0_80,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
c_0_62,
[final] ).
cnf(c_0_81,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
c_0_63,
[final] ).
cnf(c_0_82,plain,
( X1 = X2
| smaller(X1,X2)
| ~ smaller_or_equal(X1,X2) ),
c_0_64,
[final] ).
cnf(c_0_83,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
c_0_65,
[final] ).
cnf(c_0_84,plain,
( greater(X1,X2)
| ~ smaller(X2,X1) ),
c_0_66,
[final] ).
cnf(c_0_85,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
c_0_67,
[final] ).
cnf(c_0_86,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
c_0_68,
[final] ).
cnf(c_0_87,plain,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
c_0_69,
[final] ).
cnf(c_0_88,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
c_0_70,
[final] ).
cnf(c_0_89,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
c_0_71,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_72_0,axiom,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_1,axiom,
( ~ is_aligned(X1,X3)
| ~ is_aligned(X1,X2)
| ~ dissimilar(X1,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_2,axiom,
( ~ dissimilar(X1,X3,X2)
| ~ is_aligned(X1,X3)
| ~ is_aligned(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_73_0,axiom,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_1,axiom,
( is_aligned(X1,X3)
| is_aligned(X1,X2)
| ~ dissimilar(X1,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_2,axiom,
( ~ dissimilar(X1,X3,X2)
| is_aligned(X1,X3)
| is_aligned(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_74_0,axiom,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X3)
| ~ is_aligned(X1,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_1,axiom,
( is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_2,axiom,
( ~ is_aligned(X1,X3)
| is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_3,axiom,
( ~ organization(X1)
| ~ is_aligned(X1,X3)
| is_aligned(X1,X3)
| dissimilar(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_75_0,axiom,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_1,axiom,
( is_aligned(X1,X2)
| dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_2,axiom,
( ~ is_aligned(X1,X3)
| is_aligned(X1,X2)
| dissimilar(X1,X2,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_3,axiom,
( ~ organization(X1)
| ~ is_aligned(X1,X3)
| is_aligned(X1,X2)
| dissimilar(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_76_0,axiom,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X3)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_1,axiom,
( is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_2,axiom,
( ~ is_aligned(X1,X2)
| is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_3,axiom,
( ~ organization(X1)
| ~ is_aligned(X1,X2)
| is_aligned(X1,X3)
| dissimilar(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_77_0,axiom,
( dissimilar(X1,X2,X3)
| is_aligned(X1,X2)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_1,axiom,
( is_aligned(X1,X2)
| dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_2,axiom,
( ~ is_aligned(X1,X2)
| is_aligned(X1,X2)
| dissimilar(X1,X2,X3)
| ~ organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_3,axiom,
( ~ organization(X1)
| ~ is_aligned(X1,X2)
| is_aligned(X1,X2)
| dissimilar(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_78_0,axiom,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( ~ dissimilar(X1,X2,X3)
| organization(X1) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( ~ greater(X3,X2)
| greater(X1,X2)
| ~ greater(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_2,axiom,
( ~ greater(X1,X3)
| ~ greater(X3,X2)
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_80_0,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_80_1,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_81_0,axiom,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_81_1,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_81_2,axiom,
( ~ greater_or_equal(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_82_0,axiom,
( X1 = X2
| smaller(X1,X2)
| ~ smaller_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_1,axiom,
( smaller(X1,X2)
| X1 = X2
| ~ smaller_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_2,axiom,
( ~ smaller_or_equal(X1,X2)
| smaller(X1,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_83_0,axiom,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_1,axiom,
( ~ greater(X2,X1)
| smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_84_0,axiom,
( greater(X1,X2)
| ~ smaller(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_84_1,axiom,
( ~ smaller(X2,X1)
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_85_0,axiom,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_85_1,axiom,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_86_0,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_86_1,axiom,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_87_0,axiom,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_87_1,axiom,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_87_2,axiom,
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_88_0,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_88_1,axiom,
( X1 != X2
| greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_89_0,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
cnf(c_0_89_1,axiom,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
dissimilar(sk1,sk2,sk2),
file('<stdin>',background_assumption_1_36) ).
fof(c_0_1_002,negated_conjecture,
dissimilar(sk1,sk2,sk2),
c_0_0 ).
fof(c_0_2_003,negated_conjecture,
dissimilar(sk1,sk2,sk2),
c_0_1 ).
cnf(c_0_3_004,negated_conjecture,
dissimilar(sk1,sk2,sk2),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
dissimilar(sk1,sk2,sk2),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_50,negated_conjecture,
dissimilar(sk1,sk2,sk2),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p',c_0_4) ).
cnf(c_62,negated_conjecture,
dissimilar(sk1,sk2,sk2),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_66,negated_conjecture,
dissimilar(sk1,sk2,sk2),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_67,negated_conjecture,
dissimilar(sk1,sk2,sk2),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_68,negated_conjecture,
dissimilar(sk1,sk2,sk2),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_220,negated_conjecture,
dissimilar(sk1,sk2,sk2),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_47,plain,
( ~ is_aligned(X0,X1)
| ~ is_aligned(X0,X2)
| ~ dissimilar(X0,X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p',c_0_72_2) ).
cnf(c_214,plain,
( ~ is_aligned(X0,X1)
| ~ is_aligned(X0,X2)
| ~ dissimilar(X0,X2,X1) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_215,plain,
( ~ dissimilar(X0,X1,X2)
| ~ is_aligned(X0,X2)
| ~ is_aligned(X0,X1) ),
inference(rewriting,[status(thm)],[c_214]) ).
cnf(c_226,plain,
( ~ dissimilar(sk1,sk2,sk2)
| ~ is_aligned(sk1,sk2) ),
inference(resolution,[status(thm)],[c_220,c_215]) ).
cnf(c_229,plain,
( ~ dissimilar(sk1,sk2,sk2)
| ~ is_aligned(sk1,sk2) ),
inference(rewriting,[status(thm)],[c_226]) ).
cnf(c_44,plain,
( is_aligned(X0,X1)
| is_aligned(X0,X2)
| ~ dissimilar(X0,X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p',c_0_73_2) ).
cnf(c_208,plain,
( is_aligned(X0,X1)
| is_aligned(X0,X2)
| ~ dissimilar(X0,X2,X1) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_209,plain,
( ~ dissimilar(X0,X1,X2)
| is_aligned(X0,X2)
| is_aligned(X0,X1) ),
inference(rewriting,[status(thm)],[c_208]) ).
cnf(c_227,plain,
( ~ dissimilar(sk1,sk2,sk2)
| is_aligned(sk1,sk2) ),
inference(resolution,[status(thm)],[c_220,c_209]) ).
cnf(c_228,plain,
( ~ dissimilar(sk1,sk2,sk2)
| is_aligned(sk1,sk2) ),
inference(rewriting,[status(thm)],[c_227]) ).
cnf(c_238,plain,
is_aligned(sk1,sk2),
inference(forward_subsumption_resolution,[status(thm)],[c_228,c_220]) ).
cnf(c_239,plain,
is_aligned(sk1,sk2),
inference(rewriting,[status(thm)],[c_238]) ).
cnf(c_245,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_229,c_239,c_220]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT052-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : iprover_modulo %s %d
% 0.09/0.35 % Computer : n008.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 13:23:08 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.36 % Running in mono-core mode
% 0.14/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.14/0.42 % Orientation found
% 0.14/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_df0078.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_4e7f34 | grep -v "SZS"
% 0.14/0.44
% 0.14/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.14/0.44
% 0.14/0.44 %
% 0.14/0.44 % ------ iProver source info
% 0.14/0.44
% 0.14/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.14/0.44 % git: non_committed_changes: true
% 0.14/0.44 % git: last_make_outside_of_git: true
% 0.14/0.44
% 0.14/0.44 %
% 0.14/0.44 % ------ Input Options
% 0.14/0.44
% 0.14/0.44 % --out_options all
% 0.14/0.44 % --tptp_safe_out true
% 0.14/0.44 % --problem_path ""
% 0.14/0.44 % --include_path ""
% 0.14/0.44 % --clausifier .//eprover
% 0.14/0.44 % --clausifier_options --tstp-format
% 0.14/0.44 % --stdin false
% 0.14/0.44 % --dbg_backtrace false
% 0.14/0.44 % --dbg_dump_prop_clauses false
% 0.14/0.44 % --dbg_dump_prop_clauses_file -
% 0.14/0.44 % --dbg_out_stat false
% 0.14/0.44
% 0.14/0.44 % ------ General Options
% 0.14/0.44
% 0.14/0.44 % --fof false
% 0.14/0.44 % --time_out_real 150.
% 0.14/0.44 % --time_out_prep_mult 0.2
% 0.14/0.44 % --time_out_virtual -1.
% 0.14/0.44 % --schedule none
% 0.14/0.44 % --ground_splitting input
% 0.14/0.44 % --splitting_nvd 16
% 0.14/0.44 % --non_eq_to_eq false
% 0.14/0.44 % --prep_gs_sim true
% 0.14/0.44 % --prep_unflatten false
% 0.14/0.44 % --prep_res_sim true
% 0.14/0.44 % --prep_upred true
% 0.14/0.44 % --res_sim_input true
% 0.14/0.44 % --clause_weak_htbl true
% 0.14/0.44 % --gc_record_bc_elim false
% 0.14/0.44 % --symbol_type_check false
% 0.14/0.44 % --clausify_out false
% 0.14/0.44 % --large_theory_mode false
% 0.14/0.44 % --prep_sem_filter none
% 0.14/0.44 % --prep_sem_filter_out false
% 0.14/0.44 % --preprocessed_out false
% 0.14/0.44 % --sub_typing false
% 0.14/0.44 % --brand_transform false
% 0.14/0.44 % --pure_diseq_elim true
% 0.14/0.44 % --min_unsat_core false
% 0.14/0.44 % --pred_elim true
% 0.14/0.44 % --add_important_lit false
% 0.14/0.44 % --soft_assumptions false
% 0.14/0.44 % --reset_solvers false
% 0.14/0.44 % --bc_imp_inh []
% 0.14/0.44 % --conj_cone_tolerance 1.5
% 0.14/0.44 % --prolific_symb_bound 500
% 0.14/0.44 % --lt_threshold 2000
% 0.14/0.44
% 0.14/0.44 % ------ SAT Options
% 0.14/0.44
% 0.14/0.44 % --sat_mode false
% 0.14/0.44 % --sat_fm_restart_options ""
% 0.14/0.44 % --sat_gr_def false
% 0.14/0.44 % --sat_epr_types true
% 0.14/0.44 % --sat_non_cyclic_types false
% 0.14/0.44 % --sat_finite_models false
% 0.14/0.44 % --sat_fm_lemmas false
% 0.14/0.44 % --sat_fm_prep false
% 0.14/0.44 % --sat_fm_uc_incr true
% 0.14/0.44 % --sat_out_model small
% 0.14/0.44 % --sat_out_clauses false
% 0.14/0.44
% 0.14/0.44 % ------ QBF Options
% 0.14/0.44
% 0.14/0.44 % --qbf_mode false
% 0.14/0.44 % --qbf_elim_univ true
% 0.14/0.44 % --qbf_sk_in true
% 0.14/0.44 % --qbf_pred_elim true
% 0.14/0.44 % --qbf_split 32
% 0.14/0.44
% 0.14/0.44 % ------ BMC1 Options
% 0.14/0.44
% 0.14/0.44 % --bmc1_incremental false
% 0.14/0.44 % --bmc1_axioms reachable_all
% 0.14/0.44 % --bmc1_min_bound 0
% 0.14/0.44 % --bmc1_max_bound -1
% 0.14/0.44 % --bmc1_max_bound_default -1
% 0.14/0.44 % --bmc1_symbol_reachability true
% 0.14/0.44 % --bmc1_property_lemmas false
% 0.14/0.44 % --bmc1_k_induction false
% 0.14/0.44 % --bmc1_non_equiv_states false
% 0.14/0.44 % --bmc1_deadlock false
% 0.14/0.44 % --bmc1_ucm false
% 0.14/0.44 % --bmc1_add_unsat_core none
% 0.14/0.44 % --bmc1_unsat_core_children false
% 0.14/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.44 % --bmc1_out_stat full
% 0.14/0.44 % --bmc1_ground_init false
% 0.14/0.44 % --bmc1_pre_inst_next_state false
% 0.14/0.44 % --bmc1_pre_inst_state false
% 0.14/0.44 % --bmc1_pre_inst_reach_state false
% 0.14/0.44 % --bmc1_out_unsat_core false
% 0.14/0.44 % --bmc1_aig_witness_out false
% 0.14/0.44 % --bmc1_verbose false
% 0.14/0.44 % --bmc1_dump_clauses_tptp false
% 0.14/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.44 % --bmc1_dump_file -
% 0.14/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.44 % --bmc1_ucm_extend_mode 1
% 0.14/0.44 % --bmc1_ucm_init_mode 2
% 0.14/0.44 % --bmc1_ucm_cone_mode none
% 0.14/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.44 % --bmc1_ucm_relax_model 4
% 0.14/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.44 % --bmc1_ucm_layered_model none
% 0.14/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.44
% 0.14/0.44 % ------ AIG Options
% 0.14/0.44
% 0.14/0.44 % --aig_mode false
% 0.14/0.44
% 0.14/0.44 % ------ Instantiation Options
% 0.14/0.44
% 0.14/0.44 % --instantiation_flag true
% 0.14/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.44 % --inst_solver_per_active 750
% 0.14/0.44 % --inst_solver_calls_frac 0.5
% 0.14/0.44 % --inst_passive_queue_type priority_queues
% 0.14/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.44 % --inst_passive_queues_freq [25;2]
% 0.14/0.44 % --inst_dismatching true
% 0.14/0.44 % --inst_eager_unprocessed_to_passive true
% 0.14/0.44 % --inst_prop_sim_given true
% 0.14/0.44 % --inst_prop_sim_new false
% 0.14/0.44 % --inst_orphan_elimination true
% 0.14/0.44 % --inst_learning_loop_flag true
% 0.14/0.44 % --inst_learning_start 3000
% 0.14/0.44 % --inst_learning_factor 2
% 0.14/0.44 % --inst_start_prop_sim_after_learn 3
% 0.14/0.44 % --inst_sel_renew solver
% 0.14/0.44 % --inst_lit_activity_flag true
% 0.14/0.44 % --inst_out_proof true
% 0.14/0.44
% 0.14/0.44 % ------ Resolution Options
% 0.14/0.44
% 0.14/0.44 % --resolution_flag true
% 0.14/0.44 % --res_lit_sel kbo_max
% 0.14/0.44 % --res_to_prop_solver none
% 0.14/0.44 % --res_prop_simpl_new false
% 0.14/0.44 % --res_prop_simpl_given false
% 0.14/0.44 % --res_passive_queue_type priority_queues
% 0.14/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.44 % --res_passive_queues_freq [15;5]
% 0.14/0.44 % --res_forward_subs full
% 0.14/0.44 % --res_backward_subs full
% 0.14/0.44 % --res_forward_subs_resolution true
% 0.14/0.44 % --res_backward_subs_resolution true
% 0.14/0.44 % --res_orphan_elimination false
% 0.14/0.44 % --res_time_limit 1000.
% 0.14/0.44 % --res_out_proof true
% 0.14/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_df0078.s
% 0.14/0.44 % --modulo true
% 0.14/0.44
% 0.14/0.44 % ------ Combination Options
% 0.14/0.44
% 0.14/0.44 % --comb_res_mult 1000
% 0.14/0.44 % --comb_inst_mult 300
% 0.14/0.44 % ------
% 0.14/0.44
% 0.14/0.44 % ------ Parsing...% successful
% 0.14/0.44
% 0.14/0.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.14/0.44
% 0.14/0.44 % ------ Proving...
% 0.14/0.44 % ------ Problem Properties
% 0.14/0.44
% 0.14/0.44 %
% 0.14/0.44 % EPR true
% 0.14/0.44 % Horn false
% 0.14/0.44 % Has equality true
% 0.14/0.44
% 0.14/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.14/0.44
% 0.14/0.44
% 0.14/0.44 % % ------ Current options:
% 0.14/0.44
% 0.14/0.44 % ------ Input Options
% 0.14/0.44
% 0.14/0.44 % --out_options all
% 0.14/0.44 % --tptp_safe_out true
% 0.14/0.44 % --problem_path ""
% 0.14/0.44 % --include_path ""
% 0.14/0.44 % --clausifier .//eprover
% 0.14/0.44 % --clausifier_options --tstp-format
% 0.14/0.44 % --stdin false
% 0.14/0.44 % --dbg_backtrace false
% 0.14/0.44 % --dbg_dump_prop_clauses false
% 0.14/0.44 % --dbg_dump_prop_clauses_file -
% 0.14/0.44 % --dbg_out_stat false
% 0.14/0.44
% 0.14/0.44 % ------ General Options
% 0.14/0.44
% 0.14/0.44 % --fof false
% 0.14/0.44 % --time_out_real 150.
% 0.14/0.44 % --time_out_prep_mult 0.2
% 0.14/0.44 % --time_out_virtual -1.
% 0.14/0.44 % --schedule none
% 0.14/0.44 % --ground_splitting input
% 0.14/0.44 % --splitting_nvd 16
% 0.14/0.44 % --non_eq_to_eq false
% 0.14/0.44 % --prep_gs_sim true
% 0.14/0.44 % --prep_unflatten false
% 0.14/0.44 % --prep_res_sim true
% 0.14/0.44 % --prep_upred true
% 0.14/0.44 % --res_sim_input true
% 0.14/0.44 % --clause_weak_htbl true
% 0.14/0.44 % --gc_record_bc_elim false
% 0.14/0.44 % --symbol_type_check false
% 0.14/0.44 % --clausify_out false
% 0.14/0.44 % --large_theory_mode false
% 0.14/0.44 % --prep_sem_filter none
% 0.14/0.44 % --prep_sem_filter_out false
% 0.14/0.44 % --preprocessed_out false
% 0.14/0.44 % --sub_typing false
% 0.14/0.44 % --brand_transform false
% 0.14/0.44 % --pure_diseq_elim true
% 0.14/0.44 % --min_unsat_core false
% 0.14/0.44 % --pred_elim true
% 0.14/0.44 % --add_important_lit false
% 0.14/0.44 % --soft_assumptions false
% 0.14/0.44 % --reset_solvers false
% 0.14/0.44 % --bc_imp_inh []
% 0.14/0.44 % --conj_cone_tolerance 1.5
% 0.14/0.44 % --prolific_symb_bound 500
% 0.14/0.44 % --lt_threshold 2000
% 0.14/0.44
% 0.14/0.44 % ------ SAT Options
% 0.14/0.44
% 0.14/0.44 % --sat_mode false
% 0.14/0.44 % --sat_fm_restart_options ""
% 0.14/0.44 % --sat_gr_def false
% 0.14/0.44 % --sat_epr_types true
% 0.14/0.44 % --sat_non_cyclic_types false
% 0.14/0.44 % --sat_finite_models false
% 0.14/0.44 % --sat_fm_lemmas false
% 0.14/0.44 % --sat_fm_prep false
% 0.14/0.44 % --sat_fm_uc_incr true
% 0.14/0.44 % --sat_out_model small
% 0.14/0.44 % --sat_out_clauses false
% 0.14/0.44
% 0.14/0.44 % ------ QBF Options
% 0.14/0.44
% 0.14/0.44 % --qbf_mode false
% 0.14/0.44 % --qbf_elim_univ true
% 0.14/0.44 % --qbf_sk_in true
% 0.14/0.44 % --qbf_pred_elim true
% 0.14/0.44 % --qbf_split 32
% 0.14/0.44
% 0.14/0.44 % ------ BMC1 Options
% 0.14/0.44
% 0.14/0.44 % --bmc1_incremental false
% 0.14/0.44 % --bmc1_axioms reachable_all
% 0.14/0.44 % --bmc1_min_bound 0
% 0.14/0.44 % --bmc1_max_bound -1
% 0.14/0.44 % --bmc1_max_bound_default -1
% 0.14/0.44 % --bmc1_symbol_reachability true
% 0.14/0.44 % --bmc1_property_lemmas false
% 0.14/0.44 % --bmc1_k_induction false
% 0.14/0.44 % --bmc1_non_equiv_states false
% 0.14/0.44 % --bmc1_deadlock false
% 0.14/0.44 % --bmc1_ucm false
% 0.14/0.44 % --bmc1_add_unsat_core none
% 0.14/0.44 % --bmc1_unsat_core_children false
% 0.14/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.44 % --bmc1_out_stat full
% 0.14/0.44 % --bmc1_ground_init false
% 0.14/0.44 % --bmc1_pre_inst_next_state false
% 0.14/0.44 % --bmc1_pre_inst_state false
% 0.14/0.44 % --bmc1_pre_inst_reach_state false
% 0.14/0.44 % --bmc1_out_unsat_core false
% 0.14/0.44 % --bmc1_aig_witness_out false
% 0.14/0.44 % --bmc1_verbose false
% 0.14/0.44 % --bmc1_dump_clauses_tptp false
% 0.14/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.44 % --bmc1_dump_file -
% 0.14/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.44 % --bmc1_ucm_extend_mode 1
% 0.14/0.44 % --bmc1_ucm_init_mode 2
% 0.14/0.44 % --bmc1_ucm_cone_mode none
% 0.14/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.44 % --bmc1_ucm_relax_model 4
% 0.14/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.44 % --bmc1_ucm_layered_model none
% 0.14/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.44
% 0.14/0.44 % ------ AIG Options
% 0.14/0.44
% 0.14/0.44 % --aig_mode false
% 0.14/0.44
% 0.14/0.44 % ------ Instantiation Options
% 0.14/0.44
% 0.14/0.44 % --instantiation_flag true
% 0.14/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.44 % --inst_solver_per_active 750
% 0.14/0.44 % --inst_solver_calls_frac 0.5
% 0.14/0.44 % --inst_passive_queue_type priority_queues
% 0.14/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.44 % --inst_passive_queues_freq [25;2]
% 0.14/0.44 % --inst_dismatching true
% 0.14/0.44 % --inst_eager_unprocessed_to_passive true
% 0.14/0.44 % --inst_prop_sim_given true
% 0.14/0.44 % --inst_prop_sim_new false
% 0.14/0.44 % --inst_orphan_elimination true
% 0.14/0.44 % --inst_learning_loop_flag true
% 0.14/0.44 % --inst_learning_start 3000
% 0.14/0.44 % --inst_learning_factor 2
% 0.14/0.44 % --inst_start_prop_sim_after_learn 3
% 0.14/0.44 % --inst_sel_renew solver
% 0.14/0.44 % --inst_lit_activity_flag true
% 0.14/0.44 % --inst_out_proof true
% 0.14/0.44
% 0.14/0.44 % ------ Resolution Options
% 0.14/0.44
% 0.14/0.44 % --resolution_flag true
% 0.14/0.44 % --res_lit_sel kbo_max
% 0.14/0.44 % --res_to_prop_solver none
% 0.14/0.44 % --res_prop_simpl_new false
% 0.14/0.44 % --res_prop_simpl_given false
% 0.14/0.44 % --res_passive_queue_type priority_queues
% 0.14/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.44 % --res_passive_queues_freq [15;5]
% 0.14/0.44 % --res_forward_subs full
% 0.14/0.44 % --res_backward_subs full
% 0.14/0.44 % --res_forward_subs_resolution true
% 0.14/0.44 % --res_backward_subs_resolution true
% 0.14/0.44 % --res_orphan_elimination false
% 0.14/0.44 % --res_time_limit 1000.
% 0.14/0.44 % --res_out_proof true
% 0.14/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_df0078.s
% 0.14/0.44 % --modulo true
% 0.14/0.44
% 0.14/0.44 % ------ Combination Options
% 0.14/0.44
% 0.14/0.44 % --comb_res_mult 1000
% 0.14/0.44 % --comb_inst_mult 300
% 0.14/0.44 % ------
% 0.14/0.44
% 0.14/0.44
% 0.14/0.44
% 0.14/0.44 % ------ Proving...
% 0.14/0.44 % warning: shown sat in sat incomplete mode
% 0.14/0.44 %
% 0.14/0.44
% 0.14/0.44
% 0.14/0.44
% 0.14/0.44
% 0.14/0.44 cnf(c_43,plain,
% 0.14/0.44 ( smaller(X0,X1) | X0 = X1 | greater(X0,X1) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_87_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_208,plain,
% 0.14/0.44 ( smaller(X0,X1) | X0 = X1 | greater(X0,X1) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_43]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_209,plain,
% 0.14/0.44 ( greater(X0,X1) | smaller(X0,X1) | X0 = X1 ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_208]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_32,plain,
% 0.14/0.44 ( ~ greater_or_equal(X0,X1) | greater(X0,X1) | X0 = X1 ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_82_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_186,plain,
% 0.14/0.44 ( ~ greater_or_equal(X0,X1) | greater(X0,X1) | X0 = X1 ),
% 0.14/0.44 inference(copy,[status(esa)],[c_32]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_187,plain,
% 0.14/0.44 ( greater(X0,X1) | ~ greater_or_equal(X0,X1) | X0 = X1 ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_186]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_29,plain,
% 0.14/0.44 ( ~ smaller_or_equal(X0,X1) | smaller(X0,X1) | X0 = X1 ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_81_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_180,plain,
% 0.14/0.44 ( ~ smaller_or_equal(X0,X1) | smaller(X0,X1) | X0 = X1 ),
% 0.14/0.44 inference(copy,[status(esa)],[c_29]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_181,plain,
% 0.14/0.44 ( smaller(X0,X1) | ~ smaller_or_equal(X0,X1) | X0 = X1 ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_180]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_16,plain,
% 0.14/0.44 ( ~ organization(X0)
% 0.14/0.44 | dissimilar(X0,X1,X2)
% 0.14/0.44 | is_aligned(X0,X1)
% 0.14/0.44 | ~ is_aligned(X0,X2) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_76_2) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_154,plain,
% 0.14/0.44 ( ~ organization(X0)
% 0.14/0.44 | dissimilar(X0,X1,X2)
% 0.14/0.44 | is_aligned(X0,X1)
% 0.14/0.44 | ~ is_aligned(X0,X2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_16]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_155,plain,
% 0.14/0.44 ( is_aligned(X0,X1)
% 0.14/0.44 | ~ is_aligned(X0,X2)
% 0.14/0.44 | dissimilar(X0,X1,X2)
% 0.14/0.44 | ~ organization(X0) ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_154]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_14,plain,
% 0.14/0.44 ( ~ organization(X0)
% 0.14/0.44 | ~ is_aligned(X0,X1)
% 0.14/0.44 | is_aligned(X0,X2)
% 0.14/0.44 | dissimilar(X0,X2,X1) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_76_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_150,plain,
% 0.14/0.44 ( ~ organization(X0)
% 0.14/0.44 | ~ is_aligned(X0,X1)
% 0.14/0.44 | is_aligned(X0,X2)
% 0.14/0.44 | dissimilar(X0,X2,X1) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_14]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_151,plain,
% 0.14/0.44 ( ~ is_aligned(X0,X1)
% 0.14/0.44 | is_aligned(X0,X2)
% 0.14/0.44 | dissimilar(X0,X2,X1)
% 0.14/0.44 | ~ organization(X0) ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_150]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_12,plain,
% 0.14/0.44 ( ~ organization(X0)
% 0.14/0.44 | dissimilar(X0,X1,X2)
% 0.14/0.44 | is_aligned(X0,X2)
% 0.14/0.44 | ~ is_aligned(X0,X1) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_75_2) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_146,plain,
% 0.14/0.44 ( ~ organization(X0)
% 0.14/0.44 | dissimilar(X0,X1,X2)
% 0.14/0.44 | is_aligned(X0,X2)
% 0.14/0.44 | ~ is_aligned(X0,X1) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_12]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_147,plain,
% 0.14/0.44 ( is_aligned(X0,X1)
% 0.14/0.44 | ~ is_aligned(X0,X2)
% 0.14/0.44 | dissimilar(X0,X2,X1)
% 0.14/0.44 | ~ organization(X0) ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_146]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_10,plain,
% 0.14/0.44 ( ~ organization(X0)
% 0.14/0.44 | ~ is_aligned(X0,X1)
% 0.14/0.44 | is_aligned(X0,X2)
% 0.14/0.44 | dissimilar(X0,X1,X2) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_75_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_142,plain,
% 0.14/0.44 ( ~ organization(X0)
% 0.14/0.44 | ~ is_aligned(X0,X1)
% 0.14/0.44 | is_aligned(X0,X2)
% 0.14/0.44 | dissimilar(X0,X1,X2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_10]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_143,plain,
% 0.14/0.44 ( ~ is_aligned(X0,X1)
% 0.14/0.44 | is_aligned(X0,X2)
% 0.14/0.44 | dissimilar(X0,X1,X2)
% 0.14/0.44 | ~ organization(X0) ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_142]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_3,plain,
% 0.14/0.44 ( ~ dissimilar(X0,X1,X2) | is_aligned(X0,X1) | is_aligned(X0,X2) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_73_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_128,plain,
% 0.14/0.44 ( ~ dissimilar(X0,X1,X2) | is_aligned(X0,X1) | is_aligned(X0,X2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_3]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_129,plain,
% 0.14/0.44 ( is_aligned(X0,X1) | is_aligned(X0,X2) | ~ dissimilar(X0,X1,X2) ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_128]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_0,plain,
% 0.14/0.44 ( ~ dissimilar(X0,X1,X2) | ~ is_aligned(X0,X1) | ~ is_aligned(X0,X2) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_72_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_122,plain,
% 0.14/0.44 ( ~ dissimilar(X0,X1,X2) | ~ is_aligned(X0,X1) | ~ is_aligned(X0,X2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_0]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_123,plain,
% 0.14/0.44 ( ~ is_aligned(X0,X1) | ~ is_aligned(X0,X2) | ~ dissimilar(X0,X1,X2) ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_122]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_50,negated_conjecture,
% 0.14/0.44 ( dissimilar(sk1,sk2,sk2) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_4) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_64,negated_conjecture,
% 0.14/0.44 ( dissimilar(sk1,sk2,sk2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_50]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_68,negated_conjecture,
% 0.14/0.44 ( dissimilar(sk1,sk2,sk2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_64]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_69,negated_conjecture,
% 0.14/0.44 ( dissimilar(sk1,sk2,sk2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_68]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_70,negated_conjecture,
% 0.14/0.44 ( dissimilar(sk1,sk2,sk2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_69]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_222,negated_conjecture,
% 0.14/0.44 ( dissimilar(sk1,sk2,sk2) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_70]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_48,plain,
% 0.14/0.44 ( X0 != X1 | greater_or_equal(X0,X1) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_89_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_218,plain,
% 0.14/0.44 ( X0 != X1 | greater_or_equal(X0,X1) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_48]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_219,plain,
% 0.14/0.44 ( greater_or_equal(X0,X1) | X0 != X1 ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_218]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_46,plain,
% 0.14/0.44 ( X0 != X1 | smaller_or_equal(X0,X1) ),
% 0.14/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_88_0) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_214,plain,
% 0.14/0.44 ( X0 != X1 | smaller_or_equal(X0,X1) ),
% 0.14/0.44 inference(copy,[status(esa)],[c_46]) ).
% 0.14/0.44
% 0.14/0.44 cnf(c_215,plain,
% 0.14/0.44 ( smaller_or_equal(X0,X1) | X0 != X1 ),
% 0.14/0.44 inference(rewriting,[status(thm)],[c_214]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_41,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | smaller(X1,X0) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_86_0) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_204,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | smaller(X1,X0) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_41]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_39,plain,
% 0.14/0.45 ( ~ smaller(X0,X1) | greater(X1,X0) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_85_0) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_200,plain,
% 0.14/0.45 ( ~ smaller(X0,X1) | greater(X1,X0) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_39]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_201,plain,
% 0.14/0.45 ( greater(X0,X1) | ~ smaller(X1,X0) ),
% 0.14/0.45 inference(rewriting,[status(thm)],[c_200]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_37,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | greater_or_equal(X0,X1) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_84_0) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_196,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | greater_or_equal(X0,X1) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_37]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_35,plain,
% 0.14/0.45 ( ~ smaller(X0,X1) | smaller_or_equal(X0,X1) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_83_0) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_192,plain,
% 0.14/0.45 ( ~ smaller(X0,X1) | smaller_or_equal(X0,X1) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_35]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_27,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | ~ greater(X1,X0) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_80_0) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_176,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | ~ greater(X1,X0) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_27]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_26,plain,
% 0.14/0.45 ( greater(X0,X1) | ~ greater(X2,X1) | ~ greater(X0,X2) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_79_2) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_174,plain,
% 0.14/0.45 ( greater(X0,X1) | ~ greater(X2,X1) | ~ greater(X0,X2) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_26]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_25,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | greater(X0,X2) | ~ greater(X1,X2) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_79_1) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_172,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | greater(X0,X2) | ~ greater(X1,X2) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_25]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_24,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_79_0) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_170,plain,
% 0.14/0.45 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_24]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_22,plain,
% 0.14/0.45 ( ~ dissimilar(X0,X1,X2) | organization(X0) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_78_0) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_166,plain,
% 0.14/0.45 ( ~ dissimilar(X0,X1,X2) | organization(X0) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_22]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_4,plain,
% 0.14/0.45 ( ~ dissimilar(X0,X1,X2) | is_aligned(X0,X2) | is_aligned(X0,X1) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_73_1) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_130,plain,
% 0.14/0.45 ( ~ dissimilar(X0,X1,X2) | is_aligned(X0,X2) | is_aligned(X0,X1) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_4]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_131,plain,
% 0.14/0.45 ( is_aligned(X0,X1) | is_aligned(X0,X2) | ~ dissimilar(X0,X2,X1) ),
% 0.14/0.45 inference(rewriting,[status(thm)],[c_130]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_1,plain,
% 0.14/0.45 ( ~ dissimilar(X0,X1,X2) | ~ is_aligned(X0,X2) | ~ is_aligned(X0,X1) ),
% 0.14/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p', c_0_72_1) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_124,plain,
% 0.14/0.45 ( ~ dissimilar(X0,X1,X2) | ~ is_aligned(X0,X2) | ~ is_aligned(X0,X1) ),
% 0.14/0.45 inference(copy,[status(esa)],[c_1]) ).
% 0.14/0.45
% 0.14/0.45 cnf(c_125,plain,
% 0.14/0.45 ( ~ is_aligned(X0,X1) | ~ is_aligned(X0,X2) | ~ dissimilar(X0,X2,X1) ),
% 0.14/0.45 inference(rewriting,[status(thm)],[c_124]) ).
% 0.14/0.45
% 0.14/0.45
% 0.14/0.45
% 0.14/0.45 % ------ Statistics
% 0.14/0.45
% 0.14/0.45 % ------ General
% 0.14/0.45
% 0.14/0.45 % num_of_input_clauses: 51
% 0.14/0.45 % num_of_input_neg_conjectures: 1
% 0.14/0.45 % num_of_splits: 0
% 0.14/0.45 % num_of_split_atoms: 0
% 0.14/0.45 % num_of_sem_filtered_clauses: 0
% 0.14/0.45 % num_of_subtypes: 0
% 0.14/0.45 % monotx_restored_types: 0
% 0.14/0.45 % sat_num_of_epr_types: 0
% 0.14/0.45 % sat_num_of_non_cyclic_types: 0
% 0.14/0.45 % sat_guarded_non_collapsed_types: 0
% 0.14/0.45 % is_epr: 1
% 0.14/0.45 % is_horn: 0
% 0.14/0.45 % has_eq: 1
% 0.14/0.45 % num_pure_diseq_elim: 0
% 0.14/0.45 % simp_replaced_by: 0
% 0.14/0.45 % res_preprocessed: 2
% 0.14/0.45 % prep_upred: 0
% 0.14/0.45 % prep_unflattend: 0
% 0.14/0.45 % pred_elim_cands: 0
% 0.14/0.45 % pred_elim: 0
% 0.14/0.45 % pred_elim_cl: 0
% 0.14/0.45 % pred_elim_cycles: 0
% 0.14/0.45 % forced_gc_time: 0
% 0.14/0.45 % gc_basic_clause_elim: 0
% 0.14/0.45 % parsing_time: 0.001
% 0.14/0.45 % sem_filter_time: 0.
% 0.14/0.45 % pred_elim_time: 0.
% 0.14/0.45 % out_proof_time: 0.
% 0.14/0.45 % monotx_time: 0.
% 0.14/0.45 % subtype_inf_time: 0.
% 0.14/0.45 % unif_index_cands_time: 0.
% 0.14/0.45 % unif_index_add_time: 0.
% 0.14/0.45 % total_time: 0.02
% 0.14/0.45 % num_of_symbols: 34
% 0.14/0.45 % num_of_terms: 61
% 0.14/0.45
% 0.14/0.45 % ------ Propositional Solver
% 0.14/0.45
% 0.14/0.45 % prop_solver_calls: 1
% 0.14/0.45 % prop_fast_solver_calls: 3
% 0.14/0.45 % prop_num_of_clauses: 36
% 0.14/0.45 % prop_preprocess_simplified: 174
% 0.14/0.45 % prop_fo_subsumed: 0
% 0.14/0.45 % prop_solver_time: 0.
% 0.14/0.45 % prop_fast_solver_time: 0.
% 0.14/0.45 % prop_unsat_core_time: 0.
% 0.14/0.45
% 0.14/0.45 % ------ QBF
% 0.14/0.45
% 0.14/0.45 % qbf_q_res: 0
% 0.14/0.45 % qbf_num_tautologies: 0
% 0.14/0.45 % qbf_prep_cycles: 0
% 0.14/0.45
% 0.14/0.45 % ------ BMC1
% 0.14/0.45
% 0.14/0.45 % bmc1_current_bound: -1
% 0.14/0.45 % bmc1_last_solved_bound: -1
% 0.14/0.45 % bmc1_unsat_core_size: -1
% 0.14/0.45 % bmc1_unsat_core_parents_size: -1
% 0.14/0.45 % bmc1_merge_next_fun: 0
% 0.14/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.14/0.45
% 0.14/0.45 % ------ Instantiation
% 0.14/0.45
% 0.14/0.45 % inst_num_of_clauses: 50
% 0.14/0.45 % inst_num_in_passive: 0
% 0.14/0.45 % inst_num_in_active: 0
% 0.14/0.45 % inst_num_in_unprocessed: 51
% 0.14/0.45 % inst_num_of_loops: 0
% 0.14/0.45 % inst_num_of_learning_restarts: 0
% 0.14/0.45 % inst_num_moves_active_passive: 0
% 0.14/0.45 % inst_lit_activity: 0
% 0.14/0.45 % inst_lit_activity_moves: 0
% 0.14/0.45 % inst_num_tautologies: 0
% 0.14/0.45 % inst_num_prop_implied: 0
% 0.14/0.45 % inst_num_existing_simplified: 0
% 0.14/0.45 % inst_num_eq_res_simplified: 0
% 0.14/0.45 % inst_num_child_elim: 0
% 0.14/0.45 % inst_num_of_dismatching_blockings: 0
% 0.14/0.45 % inst_num_of_non_proper_insts: 0
% 0.14/0.45 % inst_num_of_duplicates: 0
% 0.14/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.14/0.45 % inst_dismatching_checking_time: 0.
% 0.14/0.45
% 0.14/0.45 % ------ Resolution
% 0.14/0.45
% 0.14/0.45 % res_num_of_clauses: 59
% 0.14/0.45 % res_num_in_passive: 0
% 0.14/0.45 % res_num_in_active: 23
% 0.14/0.45 % res_num_of_loops: 2
% 0.14/0.45 % res_forward_subset_subsumed: 20
% 0.14/0.45 % res_backward_subset_subsumed: 0
% 0.14/0.45 % res_forward_subsumed: 0
% 0.14/0.45 % res_backward_subsumed: 0
% 0.14/0.45 % res_forward_subsumption_resolution: 0
% 0.14/0.45 % res_backward_subsumption_resolution: 0
% 0.14/0.45 % res_clause_to_clause_subsumption: 0
% 0.14/0.45 % res_orphan_elimination: 0
% 0.14/0.45 % res_tautology_del: 8
% 0.14/0.45 % res_num_eq_res_simplified: 0
% 0.14/0.45 % res_num_sel_changes: 0
% 0.14/0.45 % res_moves_from_active_to_pass: 0
% 0.14/0.45
% 0.14/0.45 % Status Unknown
% 0.22/0.49 % Orienting using strategy ClausalAll
% 0.22/0.49 % Orientation found
% 0.22/0.49 % 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_df0078.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_b91be9.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_57e99a | grep -v "SZS"
% 0.22/0.50
% 0.22/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.50
% 0.22/0.50 %
% 0.22/0.50 % ------ iProver source info
% 0.22/0.50
% 0.22/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.50 % git: non_committed_changes: true
% 0.22/0.50 % git: last_make_outside_of_git: true
% 0.22/0.50
% 0.22/0.50 %
% 0.22/0.50 % ------ Input Options
% 0.22/0.50
% 0.22/0.50 % --out_options all
% 0.22/0.50 % --tptp_safe_out true
% 0.22/0.50 % --problem_path ""
% 0.22/0.50 % --include_path ""
% 0.22/0.50 % --clausifier .//eprover
% 0.22/0.50 % --clausifier_options --tstp-format
% 0.22/0.50 % --stdin false
% 0.22/0.50 % --dbg_backtrace false
% 0.22/0.50 % --dbg_dump_prop_clauses false
% 0.22/0.50 % --dbg_dump_prop_clauses_file -
% 0.22/0.50 % --dbg_out_stat false
% 0.22/0.50
% 0.22/0.50 % ------ General Options
% 0.22/0.50
% 0.22/0.50 % --fof false
% 0.22/0.50 % --time_out_real 150.
% 0.22/0.50 % --time_out_prep_mult 0.2
% 0.22/0.50 % --time_out_virtual -1.
% 0.22/0.50 % --schedule none
% 0.22/0.50 % --ground_splitting input
% 0.22/0.50 % --splitting_nvd 16
% 0.22/0.50 % --non_eq_to_eq false
% 0.22/0.50 % --prep_gs_sim true
% 0.22/0.50 % --prep_unflatten false
% 0.22/0.50 % --prep_res_sim true
% 0.22/0.50 % --prep_upred true
% 0.22/0.50 % --res_sim_input true
% 0.22/0.50 % --clause_weak_htbl true
% 0.22/0.50 % --gc_record_bc_elim false
% 0.22/0.50 % --symbol_type_check false
% 0.22/0.50 % --clausify_out false
% 0.22/0.50 % --large_theory_mode false
% 0.22/0.50 % --prep_sem_filter none
% 0.22/0.50 % --prep_sem_filter_out false
% 0.22/0.50 % --preprocessed_out false
% 0.22/0.50 % --sub_typing false
% 0.22/0.50 % --brand_transform false
% 0.22/0.50 % --pure_diseq_elim true
% 0.22/0.50 % --min_unsat_core false
% 0.22/0.50 % --pred_elim true
% 0.22/0.50 % --add_important_lit false
% 0.22/0.50 % --soft_assumptions false
% 0.22/0.50 % --reset_solvers false
% 0.22/0.50 % --bc_imp_inh []
% 0.22/0.50 % --conj_cone_tolerance 1.5
% 0.22/0.50 % --prolific_symb_bound 500
% 0.22/0.50 % --lt_threshold 2000
% 0.22/0.50
% 0.22/0.50 % ------ SAT Options
% 0.22/0.50
% 0.22/0.50 % --sat_mode false
% 0.22/0.50 % --sat_fm_restart_options ""
% 0.22/0.50 % --sat_gr_def false
% 0.22/0.50 % --sat_epr_types true
% 0.22/0.50 % --sat_non_cyclic_types false
% 0.22/0.50 % --sat_finite_models false
% 0.22/0.50 % --sat_fm_lemmas false
% 0.22/0.50 % --sat_fm_prep false
% 0.22/0.50 % --sat_fm_uc_incr true
% 0.22/0.50 % --sat_out_model small
% 0.22/0.50 % --sat_out_clauses false
% 0.22/0.50
% 0.22/0.50 % ------ QBF Options
% 0.22/0.50
% 0.22/0.50 % --qbf_mode false
% 0.22/0.50 % --qbf_elim_univ true
% 0.22/0.50 % --qbf_sk_in true
% 0.22/0.50 % --qbf_pred_elim true
% 0.22/0.50 % --qbf_split 32
% 0.22/0.50
% 0.22/0.50 % ------ BMC1 Options
% 0.22/0.50
% 0.22/0.50 % --bmc1_incremental false
% 0.22/0.50 % --bmc1_axioms reachable_all
% 0.22/0.50 % --bmc1_min_bound 0
% 0.22/0.50 % --bmc1_max_bound -1
% 0.22/0.50 % --bmc1_max_bound_default -1
% 0.22/0.50 % --bmc1_symbol_reachability true
% 0.22/0.50 % --bmc1_property_lemmas false
% 0.22/0.50 % --bmc1_k_induction false
% 0.22/0.50 % --bmc1_non_equiv_states false
% 0.22/0.50 % --bmc1_deadlock false
% 0.22/0.50 % --bmc1_ucm false
% 0.22/0.50 % --bmc1_add_unsat_core none
% 0.22/0.50 % --bmc1_unsat_core_children false
% 0.22/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.50 % --bmc1_out_stat full
% 0.22/0.50 % --bmc1_ground_init false
% 0.22/0.50 % --bmc1_pre_inst_next_state false
% 0.22/0.50 % --bmc1_pre_inst_state false
% 0.22/0.50 % --bmc1_pre_inst_reach_state false
% 0.22/0.50 % --bmc1_out_unsat_core false
% 0.22/0.50 % --bmc1_aig_witness_out false
% 0.22/0.50 % --bmc1_verbose false
% 0.22/0.50 % --bmc1_dump_clauses_tptp false
% 0.22/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.51 % --bmc1_dump_file -
% 0.22/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.51 % --bmc1_ucm_extend_mode 1
% 0.22/0.51 % --bmc1_ucm_init_mode 2
% 0.22/0.51 % --bmc1_ucm_cone_mode none
% 0.22/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.51 % --bmc1_ucm_relax_model 4
% 0.22/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.51 % --bmc1_ucm_layered_model none
% 0.22/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.51
% 0.22/0.51 % ------ AIG Options
% 0.22/0.51
% 0.22/0.51 % --aig_mode false
% 0.22/0.51
% 0.22/0.51 % ------ Instantiation Options
% 0.22/0.51
% 0.22/0.51 % --instantiation_flag true
% 0.22/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.51 % --inst_solver_per_active 750
% 0.22/0.51 % --inst_solver_calls_frac 0.5
% 0.22/0.51 % --inst_passive_queue_type priority_queues
% 0.22/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.51 % --inst_passive_queues_freq [25;2]
% 0.22/0.51 % --inst_dismatching true
% 0.22/0.51 % --inst_eager_unprocessed_to_passive true
% 0.22/0.51 % --inst_prop_sim_given true
% 0.22/0.51 % --inst_prop_sim_new false
% 0.22/0.51 % --inst_orphan_elimination true
% 0.22/0.51 % --inst_learning_loop_flag true
% 0.22/0.51 % --inst_learning_start 3000
% 0.22/0.51 % --inst_learning_factor 2
% 0.22/0.51 % --inst_start_prop_sim_after_learn 3
% 0.22/0.51 % --inst_sel_renew solver
% 0.22/0.51 % --inst_lit_activity_flag true
% 0.22/0.51 % --inst_out_proof true
% 0.22/0.51
% 0.22/0.51 % ------ Resolution Options
% 0.22/0.51
% 0.22/0.51 % --resolution_flag true
% 0.22/0.51 % --res_lit_sel kbo_max
% 0.22/0.51 % --res_to_prop_solver none
% 0.22/0.51 % --res_prop_simpl_new false
% 0.22/0.51 % --res_prop_simpl_given false
% 0.22/0.51 % --res_passive_queue_type priority_queues
% 0.22/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.51 % --res_passive_queues_freq [15;5]
% 0.22/0.51 % --res_forward_subs full
% 0.22/0.51 % --res_backward_subs full
% 0.22/0.51 % --res_forward_subs_resolution true
% 0.22/0.51 % --res_backward_subs_resolution true
% 0.22/0.51 % --res_orphan_elimination false
% 0.22/0.51 % --res_time_limit 1000.
% 0.22/0.51 % --res_out_proof true
% 0.22/0.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_df0078.s
% 0.22/0.51 % --modulo true
% 0.22/0.51
% 0.22/0.51 % ------ Combination Options
% 0.22/0.51
% 0.22/0.51 % --comb_res_mult 1000
% 0.22/0.51 % --comb_inst_mult 300
% 0.22/0.51 % ------
% 0.22/0.51
% 0.22/0.51 % ------ Parsing...% successful
% 0.22/0.51
% 0.22/0.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.22/0.51
% 0.22/0.51 % ------ Proving...
% 0.22/0.51 % ------ Problem Properties
% 0.22/0.51
% 0.22/0.51 %
% 0.22/0.51 % EPR true
% 0.22/0.51 % Horn false
% 0.22/0.51 % Has equality true
% 0.22/0.51
% 0.22/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 % % ------ Current options:
% 0.22/0.51
% 0.22/0.51 % ------ Input Options
% 0.22/0.51
% 0.22/0.51 % --out_options all
% 0.22/0.51 % --tptp_safe_out true
% 0.22/0.51 % --problem_path ""
% 0.22/0.51 % --include_path ""
% 0.22/0.51 % --clausifier .//eprover
% 0.22/0.51 % --clausifier_options --tstp-format
% 0.22/0.51 % --stdin false
% 0.22/0.51 % --dbg_backtrace false
% 0.22/0.51 % --dbg_dump_prop_clauses false
% 0.22/0.51 % --dbg_dump_prop_clauses_file -
% 0.22/0.51 % --dbg_out_stat false
% 0.22/0.51
% 0.22/0.51 % ------ General Options
% 0.22/0.51
% 0.22/0.51 % --fof false
% 0.22/0.51 % --time_out_real 150.
% 0.22/0.51 % --time_out_prep_mult 0.2
% 0.22/0.51 % --time_out_virtual -1.
% 0.22/0.51 % --schedule none
% 0.22/0.51 % --ground_splitting input
% 0.22/0.51 % --splitting_nvd 16
% 0.22/0.51 % --non_eq_to_eq false
% 0.22/0.51 % --prep_gs_sim true
% 0.22/0.51 % --prep_unflatten false
% 0.22/0.51 % --prep_res_sim true
% 0.22/0.51 % --prep_upred true
% 0.22/0.51 % --res_sim_input true
% 0.22/0.51 % --clause_weak_htbl true
% 0.22/0.51 % --gc_record_bc_elim false
% 0.22/0.51 % --symbol_type_check false
% 0.22/0.51 % --clausify_out false
% 0.22/0.51 % --large_theory_mode false
% 0.22/0.51 % --prep_sem_filter none
% 0.22/0.51 % --prep_sem_filter_out false
% 0.22/0.51 % --preprocessed_out false
% 0.22/0.51 % --sub_typing false
% 0.22/0.51 % --brand_transform false
% 0.22/0.51 % --pure_diseq_elim true
% 0.22/0.51 % --min_unsat_core false
% 0.22/0.51 % --pred_elim true
% 0.22/0.51 % --add_important_lit false
% 0.22/0.51 % --soft_assumptions false
% 0.22/0.51 % --reset_solvers false
% 0.22/0.51 % --bc_imp_inh []
% 0.22/0.51 % --conj_cone_tolerance 1.5
% 0.22/0.51 % --prolific_symb_bound 500
% 0.22/0.51 % --lt_threshold 2000
% 0.22/0.51
% 0.22/0.51 % ------ SAT Options
% 0.22/0.51
% 0.22/0.51 % --sat_mode false
% 0.22/0.51 % --sat_fm_restart_options ""
% 0.22/0.51 % --sat_gr_def false
% 0.22/0.51 % --sat_epr_types true
% 0.22/0.51 % --sat_non_cyclic_types false
% 0.22/0.51 % --sat_finite_models false
% 0.22/0.51 % --sat_fm_lemmas false
% 0.22/0.51 % --sat_fm_prep false
% 0.22/0.51 % --sat_fm_uc_incr true
% 0.22/0.51 % --sat_out_model small
% 0.22/0.51 % --sat_out_clauses false
% 0.22/0.51
% 0.22/0.51 % ------ QBF Options
% 0.22/0.51
% 0.22/0.51 % --qbf_mode false
% 0.22/0.51 % --qbf_elim_univ true
% 0.22/0.51 % --qbf_sk_in true
% 0.22/0.51 % --qbf_pred_elim true
% 0.22/0.51 % --qbf_split 32
% 0.22/0.51
% 0.22/0.51 % ------ BMC1 Options
% 0.22/0.51
% 0.22/0.51 % --bmc1_incremental false
% 0.22/0.51 % --bmc1_axioms reachable_all
% 0.22/0.51 % --bmc1_min_bound 0
% 0.22/0.51 % --bmc1_max_bound -1
% 0.22/0.51 % --bmc1_max_bound_default -1
% 0.22/0.51 % --bmc1_symbol_reachability true
% 0.22/0.51 % --bmc1_property_lemmas false
% 0.22/0.51 % --bmc1_k_induction false
% 0.22/0.51 % --bmc1_non_equiv_states false
% 0.22/0.51 % --bmc1_deadlock false
% 0.22/0.51 % --bmc1_ucm false
% 0.22/0.51 % --bmc1_add_unsat_core none
% 0.22/0.51 % --bmc1_unsat_core_children false
% 0.22/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.51 % --bmc1_out_stat full
% 0.22/0.51 % --bmc1_ground_init false
% 0.22/0.51 % --bmc1_pre_inst_next_state false
% 0.22/0.51 % --bmc1_pre_inst_state false
% 0.22/0.51 % --bmc1_pre_inst_reach_state false
% 0.22/0.51 % --bmc1_out_unsat_core false
% 0.22/0.51 % --bmc1_aig_witness_out false
% 0.22/0.51 % --bmc1_verbose false
% 0.22/0.51 % --bmc1_dump_clauses_tptp false
% 0.22/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.51 % --bmc1_dump_file -
% 0.22/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.51 % --bmc1_ucm_extend_mode 1
% 0.22/0.51 % --bmc1_ucm_init_mode 2
% 0.22/0.51 % --bmc1_ucm_cone_mode none
% 0.22/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.51 % --bmc1_ucm_relax_model 4
% 0.22/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.51 % --bmc1_ucm_layered_model none
% 0.22/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.51
% 0.22/0.51 % ------ AIG Options
% 0.22/0.51
% 0.22/0.51 % --aig_mode false
% 0.22/0.51
% 0.22/0.51 % ------ Instantiation Options
% 0.22/0.51
% 0.22/0.51 % --instantiation_flag true
% 0.22/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.51 % --inst_solver_per_active 750
% 0.22/0.51 % --inst_solver_calls_frac 0.5
% 0.22/0.51 % --inst_passive_queue_type priority_queues
% 0.22/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.51 % --inst_passive_queues_freq [25;2]
% 0.22/0.51 % --inst_dismatching true
% 0.22/0.51 % --inst_eager_unprocessed_to_passive true
% 0.22/0.51 % --inst_prop_sim_given true
% 0.22/0.51 % --inst_prop_sim_new false
% 0.22/0.51 % --inst_orphan_elimination true
% 0.22/0.51 % --inst_learning_loop_flag true
% 0.22/0.51 % --inst_learning_start 3000
% 0.22/0.51 % --inst_learning_factor 2
% 0.22/0.51 % --inst_start_prop_sim_after_learn 3
% 0.22/0.51 % --inst_sel_renew solver
% 0.22/0.51 % --inst_lit_activity_flag true
% 0.22/0.51 % --inst_out_proof true
% 0.22/0.51
% 0.22/0.51 % ------ Resolution Options
% 0.22/0.51
% 0.22/0.51 % --resolution_flag true
% 0.22/0.51 % --res_lit_sel kbo_max
% 0.22/0.51 % --res_to_prop_solver none
% 0.22/0.51 % --res_prop_simpl_new false
% 0.22/0.51 % --res_prop_simpl_given false
% 0.22/0.51 % --res_passive_queue_type priority_queues
% 0.22/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.51 % --res_passive_queues_freq [15;5]
% 0.22/0.51 % --res_forward_subs full
% 0.22/0.51 % --res_backward_subs full
% 0.22/0.51 % --res_forward_subs_resolution true
% 0.22/0.51 % --res_backward_subs_resolution true
% 0.22/0.51 % --res_orphan_elimination false
% 0.22/0.51 % --res_time_limit 1000.
% 0.22/0.51 % --res_out_proof true
% 0.22/0.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_df0078.s
% 0.22/0.51 % --modulo true
% 0.22/0.51
% 0.22/0.51 % ------ Combination Options
% 0.22/0.51
% 0.22/0.51 % --comb_res_mult 1000
% 0.22/0.51 % --comb_inst_mult 300
% 0.22/0.51 % ------
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 % ------ Proving...
% 0.22/0.51 %
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 % Resolution empty clause
% 0.22/0.51
% 0.22/0.51 % ------ Statistics
% 0.22/0.51
% 0.22/0.51 % ------ General
% 0.22/0.51
% 0.22/0.51 % num_of_input_clauses: 51
% 0.22/0.51 % num_of_input_neg_conjectures: 1
% 0.22/0.51 % num_of_splits: 0
% 0.22/0.51 % num_of_split_atoms: 0
% 0.22/0.51 % num_of_sem_filtered_clauses: 0
% 0.22/0.51 % num_of_subtypes: 0
% 0.22/0.51 % monotx_restored_types: 0
% 0.22/0.51 % sat_num_of_epr_types: 0
% 0.22/0.51 % sat_num_of_non_cyclic_types: 0
% 0.22/0.51 % sat_guarded_non_collapsed_types: 0
% 0.22/0.51 % is_epr: 1
% 0.22/0.51 % is_horn: 0
% 0.22/0.51 % has_eq: 1
% 0.22/0.51 % num_pure_diseq_elim: 0
% 0.22/0.51 % simp_replaced_by: 0
% 0.22/0.51 % res_preprocessed: 2
% 0.22/0.51 % prep_upred: 0
% 0.22/0.51 % prep_unflattend: 0
% 0.22/0.51 % pred_elim_cands: 0
% 0.22/0.51 % pred_elim: 0
% 0.22/0.51 % pred_elim_cl: 0
% 0.22/0.51 % pred_elim_cycles: 0
% 0.22/0.51 % forced_gc_time: 0
% 0.22/0.51 % gc_basic_clause_elim: 0
% 0.22/0.51 % parsing_time: 0.001
% 0.22/0.51 % sem_filter_time: 0.
% 0.22/0.51 % pred_elim_time: 0.
% 0.22/0.51 % out_proof_time: 0.
% 0.22/0.51 % monotx_time: 0.
% 0.22/0.51 % subtype_inf_time: 0.
% 0.22/0.51 % unif_index_cands_time: 0.
% 0.22/0.51 % unif_index_add_time: 0.
% 0.22/0.51 % total_time: 0.017
% 0.22/0.51 % num_of_symbols: 34
% 0.22/0.51 % num_of_terms: 72
% 0.22/0.51
% 0.22/0.51 % ------ Propositional Solver
% 0.22/0.51
% 0.22/0.51 % prop_solver_calls: 1
% 0.22/0.51 % prop_fast_solver_calls: 3
% 0.22/0.51 % prop_num_of_clauses: 34
% 0.22/0.51 % prop_preprocess_simplified: 176
% 0.22/0.51 % prop_fo_subsumed: 0
% 0.22/0.51 % prop_solver_time: 0.
% 0.22/0.51 % prop_fast_solver_time: 0.
% 0.22/0.51 % prop_unsat_core_time: 0.
% 0.22/0.51
% 0.22/0.51 % ------ QBF
% 0.22/0.51
% 0.22/0.51 % qbf_q_res: 0
% 0.22/0.51 % qbf_num_tautologies: 0
% 0.22/0.51 % qbf_prep_cycles: 0
% 0.22/0.51
% 0.22/0.51 % ------ BMC1
% 0.22/0.51
% 0.22/0.51 % bmc1_current_bound: -1
% 0.22/0.51 % bmc1_last_solved_bound: -1
% 0.22/0.51 % bmc1_unsat_core_size: -1
% 0.22/0.51 % bmc1_unsat_core_parents_size: -1
% 0.22/0.51 % bmc1_merge_next_fun: 0
% 0.22/0.51 % bmc1_unsat_core_clauses_time: 0.
% 0.22/0.51
% 0.22/0.51 % ------ Instantiation
% 0.22/0.51
% 0.22/0.51 % inst_num_of_clauses: 50
% 0.22/0.51 % inst_num_in_passive: 0
% 0.22/0.51 % inst_num_in_active: 0
% 0.22/0.51 % inst_num_in_unprocessed: 51
% 0.22/0.51 % inst_num_of_loops: 0
% 0.22/0.51 % inst_num_of_learning_restarts: 0
% 0.22/0.51 % inst_num_moves_active_passive: 0
% 0.22/0.51 % inst_lit_activity: 0
% 0.22/0.51 % inst_lit_activity_moves: 0
% 0.22/0.51 % inst_num_tautologies: 0
% 0.22/0.51 % inst_num_prop_implied: 0
% 0.22/0.51 % inst_num_existing_simplified: 0
% 0.22/0.51 % inst_num_eq_res_simplified: 0
% 0.22/0.51 % inst_num_child_elim: 0
% 0.22/0.51 % inst_num_of_dismatching_blockings: 0
% 0.22/0.51 % inst_num_of_non_proper_insts: 0
% 0.22/0.51 % inst_num_of_duplicates: 0
% 0.22/0.51 % inst_inst_num_from_inst_to_res: 0
% 0.22/0.51 % inst_dismatching_checking_time: 0.
% 0.22/0.51
% 0.22/0.51 % ------ Resolution
% 0.22/0.51
% 0.22/0.51 % res_num_of_clauses: 60
% 0.22/0.51 % res_num_in_passive: 3
% 0.22/0.51 % res_num_in_active: 25
% 0.22/0.51 % res_num_of_loops: 4
% 0.22/0.51 % res_forward_subset_subsumed: 20
% 0.22/0.51 % res_backward_subset_subsumed: 0
% 0.22/0.51 % res_forward_subsumed: 0
% 0.22/0.51 % res_backward_subsumed: 0
% 0.22/0.51 % res_forward_subsumption_resolution: 3
% 0.22/0.51 % res_backward_subsumption_resolution: 0
% 0.22/0.51 % res_clause_to_clause_subsumption: 3
% 0.22/0.51 % res_orphan_elimination: 0
% 0.22/0.51 % res_tautology_del: 8
% 0.22/0.51 % res_num_eq_res_simplified: 0
% 0.22/0.51 % res_num_sel_changes: 0
% 0.22/0.51 % res_moves_from_active_to_pass: 0
% 0.22/0.51
% 0.22/0.51 % Status Unsatisfiable
% 0.22/0.51 % SZS status Unsatisfiable
% 0.22/0.51 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------