TSTP Solution File: MSC008-2.002 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MSC008-2.002 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:47:50 EDT 2022
% Result : Unsatisfiable 6.10s 6.31s
% Output : CNFRefutation 6.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(reflexivity,axiom,
eq(A,A),
input ).
fof(reflexivity_0,plain,
! [A] :
( eq(A,A)
| $false ),
inference(orientation,[status(thm)],[reflexivity]) ).
cnf(p1_is_not_p2,axiom,
~ eq(p1,p2),
input ).
fof(p1_is_not_p2_0,plain,
( ~ eq(p1,p2)
| $false ),
inference(orientation,[status(thm)],[p1_is_not_p2]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> ~ eq(p1,p2) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[p1_is_not_p2_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [A] :
( lhs_atom2(A)
<=> eq(A,A) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [A] :
( lhs_atom2(A)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_2,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5,plain,
lhs_atom1,
c_0_3 ).
cnf(c_0_6,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
lhs_atom2(X1),
c_0_6,
[final] ).
cnf(c_0_9,plain,
lhs_atom1,
c_0_7,
[final] ).
% End CNF derivation
cnf(c_0_8_0,axiom,
eq(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_8,def_lhs_atom2]) ).
cnf(c_0_9_0,axiom,
~ eq(p1,p2),
inference(unfold_definition,[status(thm)],[c_0_9,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X13,X14,X15,X16] :
( ~ latin(X16,X15,X14)
| ~ latin(X16,X15,X13)
| eq(X13,X14) ),
file('<stdin>',latin_element_is_unique) ).
fof(c_0_1_002,axiom,
! [X13,X14,X15,X16] :
( ~ latin(X16,X15,X14)
| ~ latin(X16,X13,X14)
| eq(X13,X15) ),
file('<stdin>',latin_column_is_unique) ).
fof(c_0_2_003,axiom,
! [X13,X14,X15,X16] :
( ~ latin(X16,X15,X14)
| ~ latin(X13,X15,X14)
| eq(X13,X16) ),
file('<stdin>',latin_row_is_unique) ).
fof(c_0_3_004,axiom,
! [X13,X14,X15,X16] :
( ~ greek(X16,X15,X14)
| ~ greek(X16,X15,X13)
| eq(X13,X14) ),
file('<stdin>',greek_element_is_unique) ).
fof(c_0_4_005,axiom,
! [X13,X14,X15,X16] :
( ~ greek(X16,X15,X14)
| ~ greek(X16,X13,X14)
| eq(X13,X15) ),
file('<stdin>',greek_column_is_unique) ).
fof(c_0_5_006,axiom,
! [X13,X14,X15,X16] :
( ~ greek(X16,X15,X14)
| ~ greek(X13,X15,X14)
| eq(X13,X16) ),
file('<stdin>',greek_row_is_unique) ).
fof(c_0_6_007,axiom,
! [X11,X12] :
( latin(X12,X11,p1)
| latin(X12,X11,p2) ),
file('<stdin>',latin_cell_element) ).
fof(c_0_7_008,axiom,
! [X9,X10] :
( latin(X10,p1,X9)
| latin(X10,p2,X9) ),
file('<stdin>',latin_column_required) ).
fof(c_0_8_009,axiom,
! [X7,X8] :
( latin(p1,X8,X7)
| latin(p2,X8,X7) ),
file('<stdin>',latin_row_required) ).
fof(c_0_9_010,axiom,
! [X5,X6] :
( greek(X6,X5,p1)
| greek(X6,X5,p2) ),
file('<stdin>',greek_cell_element) ).
fof(c_0_10,axiom,
! [X3,X4] :
( greek(X4,p1,X3)
| greek(X4,p2,X3) ),
file('<stdin>',greek_column_required) ).
fof(c_0_11,axiom,
! [X1,X2] :
( greek(p1,X2,X1)
| greek(p2,X2,X1) ),
file('<stdin>',greek_row_required) ).
fof(c_0_12,axiom,
! [X15,X16] :
( ~ eq(X16,X15)
| eq(X15,X16) ),
file('<stdin>',symmetry) ).
fof(c_0_13,plain,
! [X13,X14,X15,X16] :
( ~ latin(X16,X15,X14)
| ~ latin(X16,X15,X13)
| eq(X13,X14) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_14,plain,
! [X13,X14,X15,X16] :
( ~ latin(X16,X15,X14)
| ~ latin(X16,X13,X14)
| eq(X13,X15) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_15,plain,
! [X13,X14,X15,X16] :
( ~ latin(X16,X15,X14)
| ~ latin(X13,X15,X14)
| eq(X13,X16) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_16,plain,
! [X13,X14,X15,X16] :
( ~ greek(X16,X15,X14)
| ~ greek(X16,X15,X13)
| eq(X13,X14) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_17,plain,
! [X13,X14,X15,X16] :
( ~ greek(X16,X15,X14)
| ~ greek(X16,X13,X14)
| eq(X13,X15) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_18,plain,
! [X13,X14,X15,X16] :
( ~ greek(X16,X15,X14)
| ~ greek(X13,X15,X14)
| eq(X13,X16) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_19,axiom,
! [X11,X12] :
( latin(X12,X11,p1)
| latin(X12,X11,p2) ),
c_0_6 ).
fof(c_0_20,axiom,
! [X9,X10] :
( latin(X10,p1,X9)
| latin(X10,p2,X9) ),
c_0_7 ).
fof(c_0_21,axiom,
! [X7,X8] :
( latin(p1,X8,X7)
| latin(p2,X8,X7) ),
c_0_8 ).
fof(c_0_22,axiom,
! [X5,X6] :
( greek(X6,X5,p1)
| greek(X6,X5,p2) ),
c_0_9 ).
fof(c_0_23,axiom,
! [X3,X4] :
( greek(X4,p1,X3)
| greek(X4,p2,X3) ),
c_0_10 ).
fof(c_0_24,axiom,
! [X1,X2] :
( greek(p1,X2,X1)
| greek(p2,X2,X1) ),
c_0_11 ).
fof(c_0_25,plain,
! [X15,X16] :
( ~ eq(X16,X15)
| eq(X15,X16) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X17,X18,X19,X20] :
( ~ latin(X20,X19,X18)
| ~ latin(X20,X19,X17)
| eq(X17,X18) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_27,plain,
! [X17,X18,X19,X20] :
( ~ latin(X20,X19,X18)
| ~ latin(X20,X17,X18)
| eq(X17,X19) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_28,plain,
! [X17,X18,X19,X20] :
( ~ latin(X20,X19,X18)
| ~ latin(X17,X19,X18)
| eq(X17,X20) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_29,plain,
! [X17,X18,X19,X20] :
( ~ greek(X20,X19,X18)
| ~ greek(X20,X19,X17)
| eq(X17,X18) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_30,plain,
! [X17,X18,X19,X20] :
( ~ greek(X20,X19,X18)
| ~ greek(X20,X17,X18)
| eq(X17,X19) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_31,plain,
! [X17,X18,X19,X20] :
( ~ greek(X20,X19,X18)
| ~ greek(X17,X19,X18)
| eq(X17,X20) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_32,plain,
! [X13,X14] :
( latin(X14,X13,p1)
| latin(X14,X13,p2) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_33,plain,
! [X11,X12] :
( latin(X12,p1,X11)
| latin(X12,p2,X11) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_34,plain,
! [X9,X10] :
( latin(p1,X10,X9)
| latin(p2,X10,X9) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_35,plain,
! [X7,X8] :
( greek(X8,X7,p1)
| greek(X8,X7,p2) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_36,plain,
! [X5,X6] :
( greek(X6,p1,X5)
| greek(X6,p2,X5) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_37,plain,
! [X3,X4] :
( greek(p1,X4,X3)
| greek(p2,X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_38,plain,
! [X17,X18] :
( ~ eq(X18,X17)
| eq(X17,X18) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
cnf(c_0_39,plain,
( eq(X1,X2)
| ~ latin(X3,X4,X1)
| ~ latin(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,plain,
( eq(X1,X2)
| ~ latin(X3,X1,X4)
| ~ latin(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_41,plain,
( eq(X1,X2)
| ~ latin(X1,X3,X4)
| ~ latin(X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_42,plain,
( eq(X1,X2)
| ~ greek(X3,X4,X1)
| ~ greek(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_43,plain,
( eq(X1,X2)
| ~ greek(X3,X1,X4)
| ~ greek(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_44,plain,
( eq(X1,X2)
| ~ greek(X1,X3,X4)
| ~ greek(X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_45,plain,
( latin(X1,X2,p2)
| latin(X1,X2,p1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_46,plain,
( latin(X1,p2,X2)
| latin(X1,p1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_47,plain,
( latin(p2,X1,X2)
| latin(p1,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_48,plain,
( greek(X1,X2,p2)
| greek(X1,X2,p1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_49,plain,
( greek(X1,p2,X2)
| greek(X1,p1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_50,plain,
( greek(p2,X1,X2)
| greek(p1,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_51,plain,
( eq(X1,X2)
| ~ eq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_52,plain,
( eq(X1,X2)
| ~ latin(X3,X4,X1)
| ~ latin(X3,X4,X2) ),
c_0_39,
[final] ).
cnf(c_0_53,plain,
( eq(X1,X2)
| ~ latin(X3,X1,X4)
| ~ latin(X3,X2,X4) ),
c_0_40,
[final] ).
cnf(c_0_54,plain,
( eq(X1,X2)
| ~ latin(X1,X3,X4)
| ~ latin(X2,X3,X4) ),
c_0_41,
[final] ).
cnf(c_0_55,plain,
( eq(X1,X2)
| ~ greek(X3,X4,X1)
| ~ greek(X3,X4,X2) ),
c_0_42,
[final] ).
cnf(c_0_56,plain,
( eq(X1,X2)
| ~ greek(X3,X1,X4)
| ~ greek(X3,X2,X4) ),
c_0_43,
[final] ).
cnf(c_0_57,plain,
( eq(X1,X2)
| ~ greek(X1,X3,X4)
| ~ greek(X2,X3,X4) ),
c_0_44,
[final] ).
cnf(c_0_58,plain,
( latin(X1,X2,p2)
| latin(X1,X2,p1) ),
c_0_45,
[final] ).
cnf(c_0_59,plain,
( latin(X1,p2,X2)
| latin(X1,p1,X2) ),
c_0_46,
[final] ).
cnf(c_0_60,plain,
( latin(p2,X1,X2)
| latin(p1,X1,X2) ),
c_0_47,
[final] ).
cnf(c_0_61,plain,
( greek(X1,X2,p2)
| greek(X1,X2,p1) ),
c_0_48,
[final] ).
cnf(c_0_62,plain,
( greek(X1,p2,X2)
| greek(X1,p1,X2) ),
c_0_49,
[final] ).
cnf(c_0_63,plain,
( greek(p2,X1,X2)
| greek(p1,X1,X2) ),
c_0_50,
[final] ).
cnf(c_0_64,plain,
( eq(X1,X2)
| ~ eq(X2,X1) ),
c_0_51,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_52_0,axiom,
( eq(X1,X2)
| ~ latin(X3,X4,X1)
| ~ latin(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( ~ latin(X3,X4,X1)
| eq(X1,X2)
| ~ latin(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_2,axiom,
( ~ latin(X3,X4,X2)
| ~ latin(X3,X4,X1)
| eq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( eq(X1,X2)
| ~ latin(X3,X1,X4)
| ~ latin(X3,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( ~ latin(X3,X1,X4)
| eq(X1,X2)
| ~ latin(X3,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_2,axiom,
( ~ latin(X3,X2,X4)
| ~ latin(X3,X1,X4)
| eq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
( eq(X1,X2)
| ~ latin(X1,X3,X4)
| ~ latin(X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_1,axiom,
( ~ latin(X1,X3,X4)
| eq(X1,X2)
| ~ latin(X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_2,axiom,
( ~ latin(X2,X3,X4)
| ~ latin(X1,X3,X4)
| eq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_55_0,axiom,
( eq(X1,X2)
| ~ greek(X3,X4,X1)
| ~ greek(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_1,axiom,
( ~ greek(X3,X4,X1)
| eq(X1,X2)
| ~ greek(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_2,axiom,
( ~ greek(X3,X4,X2)
| ~ greek(X3,X4,X1)
| eq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_56_0,axiom,
( eq(X1,X2)
| ~ greek(X3,X1,X4)
| ~ greek(X3,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_1,axiom,
( ~ greek(X3,X1,X4)
| eq(X1,X2)
| ~ greek(X3,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_2,axiom,
( ~ greek(X3,X2,X4)
| ~ greek(X3,X1,X4)
| eq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_57_0,axiom,
( eq(X1,X2)
| ~ greek(X1,X3,X4)
| ~ greek(X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_1,axiom,
( ~ greek(X1,X3,X4)
| eq(X1,X2)
| ~ greek(X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_2,axiom,
( ~ greek(X2,X3,X4)
| ~ greek(X1,X3,X4)
| eq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_58_0,axiom,
( latin(X1,X2,p2)
| latin(X1,X2,p1) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_1,axiom,
( latin(X1,X2,p1)
| latin(X1,X2,p2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_59_0,axiom,
( latin(X1,p2,X2)
| latin(X1,p1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_1,axiom,
( latin(X1,p1,X2)
| latin(X1,p2,X2) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_60_0,axiom,
( latin(p2,X1,X2)
| latin(p1,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_60_1,axiom,
( latin(p1,X1,X2)
| latin(p2,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_61_0,axiom,
( greek(X1,X2,p2)
| greek(X1,X2,p1) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_61_1,axiom,
( greek(X1,X2,p1)
| greek(X1,X2,p2) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_62_0,axiom,
( greek(X1,p2,X2)
| greek(X1,p1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_62_1,axiom,
( greek(X1,p1,X2)
| greek(X1,p2,X2) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_63_0,axiom,
( greek(p2,X1,X2)
| greek(p1,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_63_1,axiom,
( greek(p1,X1,X2)
| greek(p2,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_64_0,axiom,
( eq(X1,X2)
| ~ eq(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_1,axiom,
( ~ eq(X2,X1)
| eq(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_011,negated_conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ~ greek(X6,X5,X4)
| ~ latin(X6,X5,X3)
| ~ greek(X2,X1,X4)
| ~ latin(X2,X1,X3)
| eq(X1,X5)
| eq(X2,X6) ),
file('<stdin>',no_two_same) ).
fof(c_0_1_012,negated_conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ~ greek(X6,X5,X4)
| ~ latin(X6,X5,X3)
| ~ greek(X2,X1,X4)
| ~ latin(X2,X1,X3)
| eq(X1,X5)
| eq(X2,X6) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_013,negated_conjecture,
! [X7,X8,X9,X10,X11,X12] :
( ~ greek(X12,X11,X10)
| ~ latin(X12,X11,X9)
| ~ greek(X8,X7,X10)
| ~ latin(X8,X7,X9)
| eq(X7,X11)
| eq(X8,X12) ),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3_014,negated_conjecture,
( eq(X1,X2)
| eq(X3,X4)
| ~ latin(X1,X3,X5)
| ~ greek(X1,X3,X6)
| ~ latin(X2,X4,X5)
| ~ greek(X2,X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_015,negated_conjecture,
( eq(X1,X2)
| eq(X3,X4)
| ~ latin(X1,X3,X5)
| ~ greek(X1,X3,X6)
| ~ latin(X2,X4,X5)
| ~ greek(X2,X4,X6) ),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_12,plain,
( ~ greek(X0,X1,X2)
| ~ greek(X0,X3,X2)
| eq(X3,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_56_0) ).
cnf(c_62,plain,
( ~ greek(X0,X1,X2)
| ~ greek(X0,X3,X2)
| eq(X3,X1) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_133177,plain,
( eq(p1,p2)
| ~ greek(X0,p2,X1)
| ~ greek(X0,p1,X1) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_133284,plain,
( eq(p1,p2)
| ~ greek(X0,p2,p1)
| ~ greek(X0,p1,p1) ),
inference(instantiation,[status(thm)],[c_133177]) ).
cnf(c_133375,plain,
( eq(p1,p2)
| ~ greek(p2,p2,p1)
| ~ greek(p2,p1,p1) ),
inference(instantiation,[status(thm)],[c_133284]) ).
cnf(c_0,plain,
( ~ latin(X0,X1,X2)
| ~ latin(X0,X1,X3)
| eq(X3,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_52_0) ).
cnf(c_50,plain,
( ~ latin(X0,X1,X2)
| ~ latin(X0,X1,X3)
| eq(X3,X2) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_133161,plain,
( eq(p1,p2)
| ~ latin(X0,X1,p2)
| ~ latin(X0,X1,p1) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_133260,plain,
( eq(p1,p2)
| ~ latin(X0,p2,p2)
| ~ latin(X0,p2,p1) ),
inference(instantiation,[status(thm)],[c_133161]) ).
cnf(c_133335,plain,
( eq(p1,p2)
| ~ latin(p2,p2,p2)
| ~ latin(p2,p2,p1) ),
inference(instantiation,[status(thm)],[c_133260]) ).
cnf(c_3,plain,
( ~ latin(X0,X1,X2)
| ~ latin(X0,X3,X2)
| eq(X3,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_53_0) ).
cnf(c_53,plain,
( ~ latin(X0,X1,X2)
| ~ latin(X0,X3,X2)
| eq(X3,X1) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_133165,plain,
( eq(p1,p2)
| ~ latin(X0,p2,X1)
| ~ latin(X0,p1,X1) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_133233,plain,
( eq(p1,p2)
| ~ latin(X0,p2,p2)
| ~ latin(X0,p1,p2) ),
inference(instantiation,[status(thm)],[c_133165]) ).
cnf(c_133327,plain,
( eq(p1,p2)
| ~ latin(p2,p2,p2)
| ~ latin(p2,p1,p2) ),
inference(instantiation,[status(thm)],[c_133233]) ).
cnf(c_22,plain,
( latin(p1,X0,X1)
| latin(p2,X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_60_0) ).
cnf(c_72,plain,
( latin(p1,X0,X1)
| latin(p2,X0,X1) ),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_133255,plain,
( latin(p2,p2,X0)
| latin(p1,p2,X0) ),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_133317,plain,
( latin(p2,p2,p2)
| latin(p1,p2,p2) ),
inference(instantiation,[status(thm)],[c_133255]) ).
cnf(c_20,plain,
( latin(X0,p1,X1)
| latin(X0,p2,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_59_0) ).
cnf(c_70,plain,
( latin(X0,p1,X1)
| latin(X0,p2,X1) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_133246,plain,
( latin(p2,p2,X0)
| latin(p2,p1,X0) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_133314,plain,
( latin(p2,p2,p2)
| latin(p2,p1,p2) ),
inference(instantiation,[status(thm)],[c_133246]) ).
cnf(c_34,negated_conjecture,
( eq(X0,X1)
| eq(X2,X3)
| ~ latin(X3,X1,X4)
| ~ latin(X2,X0,X4)
| ~ greek(X3,X1,X5)
| ~ greek(X2,X0,X5) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_4) ).
cnf(c_43,negated_conjecture,
( eq(X0,X1)
| eq(X2,X3)
| ~ latin(X3,X1,X4)
| ~ latin(X2,X0,X4)
| ~ greek(X3,X1,X5)
| ~ greek(X2,X0,X5) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_47,negated_conjecture,
( eq(X0,X1)
| eq(X2,X3)
| ~ latin(X3,X1,X4)
| ~ latin(X2,X0,X4)
| ~ greek(X3,X1,X5)
| ~ greek(X2,X0,X5) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_48,negated_conjecture,
( eq(X0,X1)
| eq(X2,X3)
| ~ latin(X3,X1,X4)
| ~ latin(X2,X0,X4)
| ~ greek(X3,X1,X5)
| ~ greek(X2,X0,X5) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_49,negated_conjecture,
( eq(X0,X1)
| eq(X2,X3)
| ~ latin(X3,X1,X4)
| ~ latin(X2,X0,X4)
| ~ greek(X3,X1,X5)
| ~ greek(X2,X0,X5) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_84,negated_conjecture,
( eq(X0,X1)
| eq(X2,X3)
| ~ latin(X3,X1,X4)
| ~ latin(X2,X0,X4)
| ~ greek(X3,X1,X5)
| ~ greek(X2,X0,X5) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_133158,plain,
( eq(p1,p2)
| eq(X0,X1)
| ~ latin(X1,p2,X2)
| ~ latin(X0,p1,X2)
| ~ greek(X1,p2,X3)
| ~ greek(X0,p1,X3) ),
inference(instantiation,[status(thm)],[c_84]) ).
cnf(c_133193,plain,
( eq(p2,p1)
| eq(p1,p2)
| ~ latin(p2,p1,X0)
| ~ latin(p1,p2,X0)
| ~ greek(p2,p1,X1)
| ~ greek(p1,p2,X1) ),
inference(instantiation,[status(thm)],[c_133158]) ).
cnf(c_133300,plain,
( eq(p2,p1)
| eq(p1,p2)
| ~ latin(p2,p1,p2)
| ~ latin(p1,p2,p2)
| ~ greek(p2,p1,X0)
| ~ greek(p1,p2,X0) ),
inference(instantiation,[status(thm)],[c_133193]) ).
cnf(c_133303,plain,
( eq(p2,p1)
| eq(p1,p2)
| ~ latin(p2,p1,p2)
| ~ latin(p1,p2,p2)
| ~ greek(p2,p1,p1)
| ~ greek(p1,p2,p1) ),
inference(instantiation,[status(thm)],[c_133300]) ).
cnf(c_29,plain,
( greek(p2,X0,X1)
| greek(p1,X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_63_1) ).
cnf(c_79,plain,
( greek(p2,X0,X1)
| greek(p1,X0,X1) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_133289,plain,
( greek(p2,p2,X0)
| greek(p1,p2,X0) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_133291,plain,
( greek(p2,p2,p1)
| greek(p1,p2,p1) ),
inference(instantiation,[status(thm)],[c_133289]) ).
cnf(c_133256,plain,
( latin(p2,p2,p1)
| latin(p1,p2,p1) ),
inference(instantiation,[status(thm)],[c_133255]) ).
cnf(c_133253,plain,
( eq(p1,p2)
| ~ latin(p2,p2,X0)
| ~ latin(p2,p1,X0) ),
inference(instantiation,[status(thm)],[c_133165]) ).
cnf(c_133254,plain,
( eq(p1,p2)
| ~ latin(p2,p2,p1)
| ~ latin(p2,p1,p1) ),
inference(instantiation,[status(thm)],[c_133253]) ).
cnf(c_133247,plain,
( latin(p2,p2,p1)
| latin(p2,p1,p1) ),
inference(instantiation,[status(thm)],[c_133246]) ).
cnf(c_133185,plain,
( eq(p1,p2)
| ~ latin(p2,p2,X0)
| ~ latin(p1,p1,X0)
| ~ greek(p2,p2,X1)
| ~ greek(p1,p1,X1) ),
inference(instantiation,[status(thm)],[c_133158]) ).
cnf(c_133240,plain,
( eq(p1,p2)
| ~ latin(p2,p2,p2)
| ~ latin(p1,p1,p2)
| ~ greek(p2,p2,X0)
| ~ greek(p1,p1,X0) ),
inference(instantiation,[status(thm)],[c_133185]) ).
cnf(c_133241,plain,
( eq(p1,p2)
| ~ latin(p2,p2,p2)
| ~ latin(p1,p1,p2)
| ~ greek(p2,p2,p1)
| ~ greek(p1,p1,p1) ),
inference(instantiation,[status(thm)],[c_133240]) ).
cnf(c_18,plain,
( latin(X0,X1,p1)
| latin(X0,X1,p2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_58_0) ).
cnf(c_68,plain,
( latin(X0,X1,p1)
| latin(X0,X1,p2) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_133239,plain,
( latin(p2,p2,p2)
| latin(p2,p2,p1) ),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_27,plain,
( greek(X0,p2,X1)
| greek(X0,p1,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_62_1) ).
cnf(c_77,plain,
( greek(X0,p2,X1)
| greek(X0,p1,X1) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_133230,plain,
( greek(p2,p2,X0)
| greek(p2,p1,X0) ),
inference(instantiation,[status(thm)],[c_77]) ).
cnf(c_133232,plain,
( greek(p2,p2,p1)
| greek(p2,p1,p1) ),
inference(instantiation,[status(thm)],[c_133230]) ).
cnf(c_23,plain,
( latin(p2,X0,X1)
| latin(p1,X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_60_1) ).
cnf(c_73,plain,
( latin(p2,X0,X1)
| latin(p1,X0,X1) ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_133221,plain,
( latin(p2,X0,p2)
| latin(p1,X0,p2) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_133223,plain,
( latin(p2,p1,p2)
| latin(p1,p1,p2) ),
inference(instantiation,[status(thm)],[c_133221]) ).
cnf(c_133206,plain,
( eq(p2,p1)
| eq(p1,p2)
| ~ latin(p2,p1,p1)
| ~ latin(p1,p2,p1)
| ~ greek(p2,p1,p1)
| ~ greek(p1,p2,p1) ),
inference(instantiation,[status(thm)],[c_133193]) ).
cnf(c_133186,plain,
( eq(p1,p2)
| ~ latin(p2,p2,p1)
| ~ latin(p1,p1,p1)
| ~ greek(p2,p2,p1)
| ~ greek(p1,p1,p1) ),
inference(instantiation,[status(thm)],[c_133185]) ).
cnf(c_30,plain,
( ~ eq(X0,X1)
| eq(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_64_0) ).
cnf(c_80,plain,
( ~ eq(X0,X1)
| eq(X1,X0) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_133159,plain,
( ~ eq(p2,p1)
| eq(p1,p2) ),
inference(instantiation,[status(thm)],[c_80]) ).
cnf(c_40,plain,
( latin(p2,p1,p1)
| latin(p1,p1,p1) ),
inference(instantiation,[status(thm)],[c_23]) ).
cnf(c_37,plain,
( greek(p2,p1,p1)
| greek(p1,p1,p1) ),
inference(instantiation,[status(thm)],[c_29]) ).
cnf(c_32,plain,
~ eq(p1,p2),
file('/export/starexec/sandbox/tmp/iprover_modulo_9480e3.p',c_0_9_0) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_133375,c_133335,c_133327,c_133317,c_133314,c_133303,c_133291,c_133256,c_133254,c_133247,c_133241,c_133239,c_133232,c_133223,c_133206,c_133186,c_133159,c_40,c_37,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC008-2.002 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 15:32:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.39 % Orientation found
% 0.19/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_406ccf.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9480e3.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_bf133a | grep -v "SZS"
% 0.19/0.41
% 0.19/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ iProver source info
% 0.19/0.41
% 0.19/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.41 % git: non_committed_changes: true
% 0.19/0.41 % git: last_make_outside_of_git: true
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ Input Options
% 0.19/0.41
% 0.19/0.41 % --out_options all
% 0.19/0.41 % --tptp_safe_out true
% 0.19/0.41 % --problem_path ""
% 0.19/0.41 % --include_path ""
% 0.19/0.41 % --clausifier .//eprover
% 0.19/0.41 % --clausifier_options --tstp-format
% 0.19/0.41 % --stdin false
% 0.19/0.41 % --dbg_backtrace false
% 0.19/0.41 % --dbg_dump_prop_clauses false
% 0.19/0.41 % --dbg_dump_prop_clauses_file -
% 0.19/0.41 % --dbg_out_stat false
% 0.19/0.41
% 0.19/0.41 % ------ General Options
% 0.19/0.41
% 0.19/0.41 % --fof false
% 0.19/0.41 % --time_out_real 150.
% 0.19/0.41 % --time_out_prep_mult 0.2
% 0.19/0.41 % --time_out_virtual -1.
% 0.19/0.41 % --schedule none
% 0.19/0.41 % --ground_splitting input
% 0.19/0.41 % --splitting_nvd 16
% 0.19/0.41 % --non_eq_to_eq false
% 0.19/0.41 % --prep_gs_sim true
% 0.19/0.41 % --prep_unflatten false
% 0.19/0.41 % --prep_res_sim true
% 0.19/0.41 % --prep_upred true
% 0.19/0.41 % --res_sim_input true
% 0.19/0.41 % --clause_weak_htbl true
% 0.19/0.41 % --gc_record_bc_elim false
% 0.19/0.41 % --symbol_type_check false
% 0.19/0.41 % --clausify_out false
% 0.19/0.41 % --large_theory_mode false
% 0.19/0.41 % --prep_sem_filter none
% 0.19/0.41 % --prep_sem_filter_out false
% 0.19/0.41 % --preprocessed_out false
% 0.19/0.41 % --sub_typing false
% 0.19/0.41 % --brand_transform false
% 0.19/0.41 % --pure_diseq_elim true
% 0.19/0.41 % --min_unsat_core false
% 0.19/0.41 % --pred_elim true
% 0.19/0.41 % --add_important_lit false
% 0.19/0.41 % --soft_assumptions false
% 0.19/0.41 % --reset_solvers false
% 0.19/0.41 % --bc_imp_inh []
% 0.19/0.41 % --conj_cone_tolerance 1.5
% 0.19/0.41 % --prolific_symb_bound 500
% 0.19/0.41 % --lt_threshold 2000
% 0.19/0.41
% 0.19/0.41 % ------ SAT Options
% 0.19/0.41
% 0.19/0.41 % --sat_mode false
% 0.19/0.41 % --sat_fm_restart_options ""
% 0.19/0.41 % --sat_gr_def false
% 0.19/0.41 % --sat_epr_types true
% 0.19/0.41 % --sat_non_cyclic_types false
% 0.19/0.41 % --sat_finite_models false
% 0.19/0.41 % --sat_fm_lemmas false
% 0.19/0.41 % --sat_fm_prep false
% 0.19/0.41 % --sat_fm_uc_incr true
% 0.19/0.41 % --sat_out_model small
% 0.19/0.41 % --sat_out_clauses false
% 0.19/0.41
% 0.19/0.41 % ------ QBF Options
% 0.19/0.41
% 0.19/0.41 % --qbf_mode false
% 0.19/0.41 % --qbf_elim_univ true
% 0.19/0.41 % --qbf_sk_in true
% 0.19/0.41 % --qbf_pred_elim true
% 0.19/0.41 % --qbf_split 32
% 0.19/0.41
% 0.19/0.41 % ------ BMC1 Options
% 0.19/0.41
% 0.19/0.41 % --bmc1_incremental false
% 0.19/0.41 % --bmc1_axioms reachable_all
% 0.19/0.41 % --bmc1_min_bound 0
% 0.19/0.41 % --bmc1_max_bound -1
% 0.19/0.41 % --bmc1_max_bound_default -1
% 0.19/0.41 % --bmc1_symbol_reachability true
% 0.19/0.41 % --bmc1_property_lemmas false
% 0.19/0.41 % --bmc1_k_induction false
% 0.19/0.41 % --bmc1_non_equiv_states false
% 0.19/0.41 % --bmc1_deadlock false
% 0.19/0.41 % --bmc1_ucm false
% 0.19/0.41 % --bmc1_add_unsat_core none
% 0.19/0.41 % --bmc1_unsat_core_children false
% 0.19/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.41 % --bmc1_out_stat full
% 0.19/0.41 % --bmc1_ground_init false
% 0.19/0.41 % --bmc1_pre_inst_next_state false
% 0.19/0.41 % --bmc1_pre_inst_state false
% 0.19/0.41 % --bmc1_pre_inst_reach_state false
% 0.19/0.41 % --bmc1_out_unsat_core false
% 0.19/0.41 % --bmc1_aig_witness_out false
% 0.19/0.41 % --bmc1_verbose false
% 0.19/0.41 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_406ccf.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42 % ------ Parsing...% successful
% 0.19/0.42
% 0.19/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 % ------ Problem Properties
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % EPR true
% 0.19/0.42 % Horn false
% 0.19/0.42 % Has equality false
% 0.19/0.42
% 0.19/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % % ------ Current options:
% 0.19/0.42
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 6.10/6.31 % --inst_prop_sim_new false
% 6.10/6.31 % --inst_orphan_elimination true
% 6.10/6.31 % --inst_learning_loop_flag true
% 6.10/6.31 % --inst_learning_start 3000
% 6.10/6.31 % --inst_learning_factor 2
% 6.10/6.31 % --inst_start_prop_sim_after_learn 3
% 6.10/6.31 % --inst_sel_renew solver
% 6.10/6.31 % --inst_lit_activity_flag true
% 6.10/6.31 % --inst_out_proof true
% 6.10/6.31
% 6.10/6.31 % ------ Resolution Options
% 6.10/6.31
% 6.10/6.31 % --resolution_flag true
% 6.10/6.31 % --res_lit_sel kbo_max
% 6.10/6.31 % --res_to_prop_solver none
% 6.10/6.31 % --res_prop_simpl_new false
% 6.10/6.31 % --res_prop_simpl_given false
% 6.10/6.31 % --res_passive_queue_type priority_queues
% 6.10/6.31 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 6.10/6.31 % --res_passive_queues_freq [15;5]
% 6.10/6.31 % --res_forward_subs full
% 6.10/6.31 % --res_backward_subs full
% 6.10/6.31 % --res_forward_subs_resolution true
% 6.10/6.31 % --res_backward_subs_resolution true
% 6.10/6.31 % --res_orphan_elimination false
% 6.10/6.31 % --res_time_limit 1000.
% 6.10/6.31 % --res_out_proof true
% 6.10/6.31 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_406ccf.s
% 6.10/6.31 % --modulo true
% 6.10/6.31
% 6.10/6.31 % ------ Combination Options
% 6.10/6.31
% 6.10/6.31 % --comb_res_mult 1000
% 6.10/6.31 % --comb_inst_mult 300
% 6.10/6.31 % ------
% 6.10/6.31
% 6.10/6.31
% 6.10/6.31
% 6.10/6.31 % ------ Proving...
% 6.10/6.31 %
% 6.10/6.31
% 6.10/6.31
% 6.10/6.31 % ------ Statistics
% 6.10/6.31
% 6.10/6.31 % ------ General
% 6.10/6.31
% 6.10/6.31 % num_of_input_clauses: 35
% 6.10/6.31 % num_of_input_neg_conjectures: 1
% 6.10/6.31 % num_of_splits: 0
% 6.10/6.31 % num_of_split_atoms: 0
% 6.10/6.31 % num_of_sem_filtered_clauses: 0
% 6.10/6.31 % num_of_subtypes: 0
% 6.10/6.31 % monotx_restored_types: 0
% 6.10/6.31 % sat_num_of_epr_types: 0
% 6.10/6.31 % sat_num_of_non_cyclic_types: 0
% 6.10/6.31 % sat_guarded_non_collapsed_types: 0
% 6.10/6.31 % is_epr: 1
% 6.10/6.31 % is_horn: 0
% 6.10/6.31 % has_eq: 0
% 6.10/6.31 % num_pure_diseq_elim: 0
% 6.10/6.31 % simp_replaced_by: 0
% 6.10/6.31 % res_preprocessed: 2
% 6.10/6.31 % prep_upred: 0
% 6.10/6.31 % prep_unflattend: 0
% 6.10/6.31 % pred_elim_cands: 0
% 6.10/6.31 % pred_elim: 0
% 6.10/6.31 % pred_elim_cl: 0
% 6.10/6.31 % pred_elim_cycles: 0
% 6.10/6.31 % forced_gc_time: 0
% 6.10/6.31 % gc_basic_clause_elim: 0
% 6.10/6.31 % parsing_time: 0.
% 6.10/6.31 % sem_filter_time: 0.
% 6.10/6.31 % pred_elim_time: 0.
% 6.10/6.31 % out_proof_time: 0.001
% 6.10/6.31 % monotx_time: 0.
% 6.10/6.31 % subtype_inf_time: 0.
% 6.10/6.31 % unif_index_cands_time: 0.004
% 6.10/6.31 % unif_index_add_time: 0.001
% 6.10/6.31 % total_time: 5.91
% 6.10/6.31 % num_of_symbols: 30
% 6.10/6.31 % num_of_terms: 2206
% 6.10/6.31
% 6.10/6.31 % ------ Propositional Solver
% 6.10/6.31
% 6.10/6.31 % prop_solver_calls: 5
% 6.10/6.31 % prop_fast_solver_calls: 18
% 6.10/6.31 % prop_num_of_clauses: 155
% 6.10/6.31 % prop_preprocess_simplified: 412
% 6.10/6.31 % prop_fo_subsumed: 0
% 6.10/6.31 % prop_solver_time: 0.
% 6.10/6.31 % prop_fast_solver_time: 0.
% 6.10/6.31 % prop_unsat_core_time: 0.
% 6.10/6.31
% 6.10/6.31 % ------ QBF
% 6.10/6.31
% 6.10/6.31 % qbf_q_res: 0
% 6.10/6.31 % qbf_num_tautologies: 0
% 6.10/6.31 % qbf_prep_cycles: 0
% 6.10/6.31
% 6.10/6.31 % ------ BMC1
% 6.10/6.31
% 6.10/6.31 % bmc1_current_bound: -1
% 6.10/6.31 % bmc1_last_solved_bound: -1
% 6.10/6.31 % bmc1_unsat_core_size: -1
% 6.10/6.31 % bmc1_unsat_core_parents_size: -1
% 6.10/6.31 % bmc1_merge_next_fun: 0
% 6.10/6.31 % bmc1_unsat_core_clauses_time: 0.
% 6.10/6.31
% 6.10/6.31 % ------ Instantiation
% 6.10/6.31
% 6.10/6.31 % inst_num_of_clauses: 137
% 6.10/6.31 % inst_num_in_passive: 3
% 6.10/6.31 % inst_num_in_active: 85
% 6.10/6.31 % inst_num_in_unprocessed: 49
% 6.10/6.31 % inst_num_of_loops: 118
% 6.10/6.31 % inst_num_of_learning_restarts: 0
% 6.10/6.31 % inst_num_moves_active_passive: 30
% 6.10/6.31 % inst_lit_activity: 34
% 6.10/6.31 % inst_lit_activity_moves: 0
% 6.10/6.31 % inst_num_tautologies: 0
% 6.10/6.31 % inst_num_prop_implied: 0
% 6.10/6.31 % inst_num_existing_simplified: 0
% 6.10/6.31 % inst_num_eq_res_simplified: 0
% 6.10/6.31 % inst_num_child_elim: 0
% 6.10/6.31 % inst_num_of_dismatching_blockings: 21
% 6.10/6.31 % inst_num_of_non_proper_insts: 61
% 6.10/6.31 % inst_num_of_duplicates: 156
% 6.10/6.31 % inst_inst_num_from_inst_to_res: 0
% 6.10/6.31 % inst_dismatching_checking_time: 0.
% 6.10/6.31
% 6.10/6.31 % ------ Resolution
% 6.10/6.31
% 6.10/6.31 % res_num_of_clauses: 53325
% 6.10/6.31 % res_num_in_passive: 52509
% 6.10/6.31 % res_num_in_active: 793
% 6.10/6.31 % res_num_of_loops: 1000
% 6.10/6.31 % res_forward_subset_subsumed: 1124
% 6.10/6.31 % res_backward_subset_subsumed: 0
% 6.10/6.31 % res_forward_subsumed: 220
% 6.10/6.31 % res_backward_subsumed: 4
% 6.10/6.31 % res_forward_subsumption_resolution: 146
% 6.10/6.31 % res_backward_subsumption_resolution: 0
% 6.10/6.31 % res_clause_to_clause_subsumption: 236073
% 6.10/6.31 % res_orphan_elimination: 0
% 6.10/6.31 % res_tautology_del: 1688
% 6.10/6.31 % res_num_eq_res_simplified: 0
% 6.10/6.31 % res_num_sel_changes: 0
% 6.10/6.31 % res_moves_from_active_to_pass: 0
% 6.10/6.31
% 6.10/6.31 % Status Unsatisfiable
% 6.10/6.31 % SZS status Unsatisfiable
% 6.10/6.31 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------