TSTP Solution File: GRP123-2.003 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : GRP123-2.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n032.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 : Sat Jul 16 09:44:47 EDT 2022
% Result : Unsatisfiable 1.31s 1.49s
% Output : CNFRefutation 1.31s
% 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(product_idempotence,axiom,
product(X,X,X),
input ).
fof(product_idempotence_0,plain,
! [X] :
( product(X,X,X)
| $false ),
inference(orientation,[status(thm)],[product_idempotence]) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
input ).
fof(e_3_is_not_e_2_0,plain,
( ~ equalish(e_3,e_2)
| $false ),
inference(orientation,[status(thm)],[e_3_is_not_e_2]) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
input ).
fof(e_3_is_not_e_1_0,plain,
( ~ equalish(e_3,e_1)
| $false ),
inference(orientation,[status(thm)],[e_3_is_not_e_1]) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
input ).
fof(e_2_is_not_e_3_0,plain,
( ~ equalish(e_2,e_3)
| $false ),
inference(orientation,[status(thm)],[e_2_is_not_e_3]) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
input ).
fof(e_2_is_not_e_1_0,plain,
( ~ equalish(e_2,e_1)
| $false ),
inference(orientation,[status(thm)],[e_2_is_not_e_1]) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
input ).
fof(e_1_is_not_e_3_0,plain,
( ~ equalish(e_1,e_3)
| $false ),
inference(orientation,[status(thm)],[e_1_is_not_e_3]) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
input ).
fof(e_1_is_not_e_2_0,plain,
( ~ equalish(e_1,e_2)
| $false ),
inference(orientation,[status(thm)],[e_1_is_not_e_2]) ).
cnf(element_3,axiom,
group_element(e_3),
input ).
fof(element_3_0,plain,
( group_element(e_3)
| $false ),
inference(orientation,[status(thm)],[element_3]) ).
cnf(element_2,axiom,
group_element(e_2),
input ).
fof(element_2_0,plain,
( group_element(e_2)
| $false ),
inference(orientation,[status(thm)],[element_2]) ).
cnf(element_1,axiom,
group_element(e_1),
input ).
fof(element_1_0,plain,
( group_element(e_1)
| $false ),
inference(orientation,[status(thm)],[element_1]) ).
cnf(e_3_greater_e_2,axiom,
greater(e_3,e_2),
input ).
fof(e_3_greater_e_2_0,plain,
( greater(e_3,e_2)
| $false ),
inference(orientation,[status(thm)],[e_3_greater_e_2]) ).
cnf(e_3_greater_e_1,axiom,
greater(e_3,e_1),
input ).
fof(e_3_greater_e_1_0,plain,
( greater(e_3,e_1)
| $false ),
inference(orientation,[status(thm)],[e_3_greater_e_1]) ).
cnf(e_2_greater_e_1,axiom,
greater(e_2,e_1),
input ).
fof(e_2_greater_e_1_0,plain,
( greater(e_2,e_1)
| $false ),
inference(orientation,[status(thm)],[e_2_greater_e_1]) ).
cnf(e_2_then_e_3,axiom,
next(e_2,e_3),
input ).
fof(e_2_then_e_3_0,plain,
( next(e_2,e_3)
| $false ),
inference(orientation,[status(thm)],[e_2_then_e_3]) ).
cnf(e_1_then_e_2,axiom,
next(e_1,e_2),
input ).
fof(e_1_then_e_2_0,plain,
( next(e_1,e_2)
| $false ),
inference(orientation,[status(thm)],[e_1_then_e_2]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> next(e_1,e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[e_1_then_e_2_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
( lhs_atom2
<=> next(e_2,e_3) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
( lhs_atom2
| $false ),
inference(fold_definition,[status(thm)],[e_2_then_e_3_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
( lhs_atom3
<=> greater(e_2,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
( lhs_atom3
| $false ),
inference(fold_definition,[status(thm)],[e_2_greater_e_1_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
( lhs_atom4
<=> greater(e_3,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
( lhs_atom4
| $false ),
inference(fold_definition,[status(thm)],[e_3_greater_e_1_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
( lhs_atom5
<=> greater(e_3,e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
( lhs_atom5
| $false ),
inference(fold_definition,[status(thm)],[e_3_greater_e_2_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
( lhs_atom6
<=> group_element(e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
( lhs_atom6
| $false ),
inference(fold_definition,[status(thm)],[element_1_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
( lhs_atom7
<=> group_element(e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[element_2_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
( lhs_atom8
<=> group_element(e_3) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
( lhs_atom8
| $false ),
inference(fold_definition,[status(thm)],[element_3_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
( lhs_atom9
<=> ~ equalish(e_1,e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
( lhs_atom9
| $false ),
inference(fold_definition,[status(thm)],[e_1_is_not_e_2_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
( lhs_atom10
<=> ~ equalish(e_1,e_3) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
( lhs_atom10
| $false ),
inference(fold_definition,[status(thm)],[e_1_is_not_e_3_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
( lhs_atom11
<=> ~ equalish(e_2,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
( lhs_atom11
| $false ),
inference(fold_definition,[status(thm)],[e_2_is_not_e_1_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
( lhs_atom12
<=> ~ equalish(e_2,e_3) ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
( lhs_atom12
| $false ),
inference(fold_definition,[status(thm)],[e_2_is_not_e_3_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
( lhs_atom13
<=> ~ equalish(e_3,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
( lhs_atom13
| $false ),
inference(fold_definition,[status(thm)],[e_3_is_not_e_1_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
( lhs_atom14
<=> ~ equalish(e_3,e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_13,plain,
( lhs_atom14
| $false ),
inference(fold_definition,[status(thm)],[e_3_is_not_e_2_0,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
! [X] :
( lhs_atom15(X)
<=> product(X,X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_14,plain,
! [X] :
( lhs_atom15(X)
| $false ),
inference(fold_definition,[status(thm)],[product_idempotence_0,def_lhs_atom15]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom15(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_1,axiom,
( lhs_atom14
| ~ $true ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_2,axiom,
( lhs_atom13
| ~ $true ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_3,axiom,
( lhs_atom12
| ~ $true ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_4,axiom,
( lhs_atom11
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_5,axiom,
( lhs_atom10
| ~ $true ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_6,axiom,
( lhs_atom9
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_7,axiom,
( lhs_atom8
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_8,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_9,axiom,
( lhs_atom6
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_10,axiom,
( lhs_atom5
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_11,axiom,
( lhs_atom4
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_12,axiom,
( lhs_atom3
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_13,axiom,
( lhs_atom2
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_14,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_15,plain,
! [X1] : lhs_atom15(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_16,plain,
lhs_atom14,
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_17,plain,
lhs_atom13,
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_18,plain,
lhs_atom12,
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_19,plain,
lhs_atom11,
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_20,plain,
lhs_atom10,
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_21,plain,
lhs_atom9,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_22,plain,
lhs_atom8,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_23,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_24,plain,
lhs_atom6,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_25,plain,
lhs_atom5,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_26,plain,
lhs_atom4,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_27,plain,
lhs_atom3,
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_28,plain,
lhs_atom2,
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_29,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_30,plain,
! [X2] : lhs_atom15(X2),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_31,plain,
lhs_atom14,
c_0_16 ).
fof(c_0_32,plain,
lhs_atom13,
c_0_17 ).
fof(c_0_33,plain,
lhs_atom12,
c_0_18 ).
fof(c_0_34,plain,
lhs_atom11,
c_0_19 ).
fof(c_0_35,plain,
lhs_atom10,
c_0_20 ).
fof(c_0_36,plain,
lhs_atom9,
c_0_21 ).
fof(c_0_37,plain,
lhs_atom8,
c_0_22 ).
fof(c_0_38,plain,
lhs_atom7,
c_0_23 ).
fof(c_0_39,plain,
lhs_atom6,
c_0_24 ).
fof(c_0_40,plain,
lhs_atom5,
c_0_25 ).
fof(c_0_41,plain,
lhs_atom4,
c_0_26 ).
fof(c_0_42,plain,
lhs_atom3,
c_0_27 ).
fof(c_0_43,plain,
lhs_atom2,
c_0_28 ).
fof(c_0_44,plain,
lhs_atom1,
c_0_29 ).
cnf(c_0_45,plain,
lhs_atom15(X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_46,plain,
lhs_atom14,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_47,plain,
lhs_atom13,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_48,plain,
lhs_atom12,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_49,plain,
lhs_atom11,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_50,plain,
lhs_atom10,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_51,plain,
lhs_atom9,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_52,plain,
lhs_atom8,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_53,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_54,plain,
lhs_atom6,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_55,plain,
lhs_atom5,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_56,plain,
lhs_atom4,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_57,plain,
lhs_atom3,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_58,plain,
lhs_atom2,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_59,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_60,plain,
lhs_atom15(X1),
c_0_45,
[final] ).
cnf(c_0_61,plain,
lhs_atom14,
c_0_46,
[final] ).
cnf(c_0_62,plain,
lhs_atom13,
c_0_47,
[final] ).
cnf(c_0_63,plain,
lhs_atom12,
c_0_48,
[final] ).
cnf(c_0_64,plain,
lhs_atom11,
c_0_49,
[final] ).
cnf(c_0_65,plain,
lhs_atom10,
c_0_50,
[final] ).
cnf(c_0_66,plain,
lhs_atom9,
c_0_51,
[final] ).
cnf(c_0_67,plain,
lhs_atom8,
c_0_52,
[final] ).
cnf(c_0_68,plain,
lhs_atom7,
c_0_53,
[final] ).
cnf(c_0_69,plain,
lhs_atom6,
c_0_54,
[final] ).
cnf(c_0_70,plain,
lhs_atom5,
c_0_55,
[final] ).
cnf(c_0_71,plain,
lhs_atom4,
c_0_56,
[final] ).
cnf(c_0_72,plain,
lhs_atom3,
c_0_57,
[final] ).
cnf(c_0_73,plain,
lhs_atom2,
c_0_58,
[final] ).
cnf(c_0_74,plain,
lhs_atom1,
c_0_59,
[final] ).
% End CNF derivation
cnf(c_0_60_0,axiom,
product(X1,X1,X1),
inference(unfold_definition,[status(thm)],[c_0_60,def_lhs_atom15]) ).
cnf(c_0_61_0,axiom,
~ equalish(e_3,e_2),
inference(unfold_definition,[status(thm)],[c_0_61,def_lhs_atom14]) ).
cnf(c_0_62_0,axiom,
~ equalish(e_3,e_1),
inference(unfold_definition,[status(thm)],[c_0_62,def_lhs_atom13]) ).
cnf(c_0_63_0,axiom,
~ equalish(e_2,e_3),
inference(unfold_definition,[status(thm)],[c_0_63,def_lhs_atom12]) ).
cnf(c_0_64_0,axiom,
~ equalish(e_2,e_1),
inference(unfold_definition,[status(thm)],[c_0_64,def_lhs_atom11]) ).
cnf(c_0_65_0,axiom,
~ equalish(e_1,e_3),
inference(unfold_definition,[status(thm)],[c_0_65,def_lhs_atom10]) ).
cnf(c_0_66_0,axiom,
~ equalish(e_1,e_2),
inference(unfold_definition,[status(thm)],[c_0_66,def_lhs_atom9]) ).
cnf(c_0_67_0,axiom,
group_element(e_3),
inference(unfold_definition,[status(thm)],[c_0_67,def_lhs_atom8]) ).
cnf(c_0_68_0,axiom,
group_element(e_2),
inference(unfold_definition,[status(thm)],[c_0_68,def_lhs_atom7]) ).
cnf(c_0_69_0,axiom,
group_element(e_1),
inference(unfold_definition,[status(thm)],[c_0_69,def_lhs_atom6]) ).
cnf(c_0_70_0,axiom,
greater(e_3,e_2),
inference(unfold_definition,[status(thm)],[c_0_70,def_lhs_atom5]) ).
cnf(c_0_71_0,axiom,
greater(e_3,e_1),
inference(unfold_definition,[status(thm)],[c_0_71,def_lhs_atom4]) ).
cnf(c_0_72_0,axiom,
greater(e_2,e_1),
inference(unfold_definition,[status(thm)],[c_0_72,def_lhs_atom3]) ).
cnf(c_0_73_0,axiom,
next(e_2,e_3),
inference(unfold_definition,[status(thm)],[c_0_73,def_lhs_atom2]) ).
cnf(c_0_74_0,axiom,
next(e_1,e_2),
inference(unfold_definition,[status(thm)],[c_0_74,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3,X4] :
( ~ product(X3,X2,X4)
| ~ product(X3,X2,X1)
| equalish(X4,X1) ),
file('<stdin>',product_total_function2) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3,X4] :
( ~ product(X3,X4,X2)
| ~ product(X3,X1,X2)
| equalish(X4,X1) ),
file('<stdin>',product_right_cancellation) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3,X4] :
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X4,X1) ),
file('<stdin>',product_left_cancellation) ).
fof(c_0_3_004,axiom,
! [X2,X3] :
( ~ group_element(X3)
| ~ group_element(X2)
| product(X3,X2,e_1)
| product(X3,X2,e_2)
| product(X3,X2,e_3) ),
file('<stdin>',product_total_function1) ).
fof(c_0_4_005,axiom,
! [X2,X5,X3] :
( ~ product(X3,e_1,X2)
| ~ next(X3,X5)
| ~ greater(X2,X5) ),
file('<stdin>',no_redundancy) ).
fof(c_0_5_006,plain,
! [X1,X2,X3,X4] :
( ~ product(X3,X2,X4)
| ~ product(X3,X2,X1)
| equalish(X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_6_007,plain,
! [X1,X2,X3,X4] :
( ~ product(X3,X4,X2)
| ~ product(X3,X1,X2)
| equalish(X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_7_008,plain,
! [X1,X2,X3,X4] :
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_8_009,plain,
! [X2,X3] :
( ~ group_element(X3)
| ~ group_element(X2)
| product(X3,X2,e_1)
| product(X3,X2,e_2)
| product(X3,X2,e_3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_9_010,plain,
! [X2,X5,X3] :
( ~ product(X3,e_1,X2)
| ~ next(X3,X5)
| ~ greater(X2,X5) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_10_011,plain,
! [X5,X6,X7,X8] :
( ~ product(X7,X6,X8)
| ~ product(X7,X6,X5)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_11_012,plain,
! [X5,X6,X7,X8] :
( ~ product(X7,X8,X6)
| ~ product(X7,X5,X6)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_12_013,plain,
! [X5,X6,X7,X8] :
( ~ product(X8,X6,X7)
| ~ product(X5,X6,X7)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_13_014,plain,
! [X4,X5] :
( ~ group_element(X5)
| ~ group_element(X4)
| product(X5,X4,e_1)
| product(X5,X4,e_2)
| product(X5,X4,e_3) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_14_015,plain,
! [X6,X7,X8] :
( ~ product(X8,e_1,X6)
| ~ next(X8,X7)
| ~ greater(X6,X7) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_15_016,plain,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16_017,plain,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17_018,plain,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18_019,plain,
( product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19_020,plain,
( ~ greater(X1,X2)
| ~ next(X3,X2)
| ~ product(X3,e_1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20_021,plain,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
c_0_15,
[final] ).
cnf(c_0_21_022,plain,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
c_0_16,
[final] ).
cnf(c_0_22_023,plain,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
c_0_17,
[final] ).
cnf(c_0_23_024,plain,
( product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
c_0_18,
[final] ).
cnf(c_0_24_025,plain,
( ~ greater(X1,X2)
| ~ next(X3,X2)
| ~ product(X3,e_1,X1) ),
c_0_19,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_20_0,axiom,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_1,axiom,
( ~ product(X3,X4,X2)
| equalish(X1,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_2,axiom,
( ~ product(X3,X4,X1)
| ~ product(X3,X4,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_21_0,axiom,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_1,axiom,
( ~ product(X3,X2,X4)
| equalish(X1,X2)
| ~ product(X3,X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_2,axiom,
( ~ product(X3,X1,X4)
| ~ product(X3,X2,X4)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_22_0,axiom,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_1,axiom,
( ~ product(X2,X3,X4)
| equalish(X1,X2)
| ~ product(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_2,axiom,
( ~ product(X1,X3,X4)
| ~ product(X2,X3,X4)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_23_0,axiom,
( product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_1,axiom,
( product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_2,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X2)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_3,axiom,
( ~ group_element(X2)
| product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_4,axiom,
( ~ group_element(X1)
| ~ group_element(X2)
| product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_24_0,axiom,
( ~ greater(X1,X2)
| ~ next(X3,X2)
| ~ product(X3,e_1,X1) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( ~ next(X3,X2)
| ~ greater(X1,X2)
| ~ product(X3,e_1,X1) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_2,axiom,
( ~ product(X3,e_1,X1)
| ~ next(X3,X2)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_026,negated_conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ~ product(X6,X4,X2)
| ~ product(X5,X3,X2)
| ~ product(X1,X4,X6)
| ~ product(X1,X3,X5)
| equalish(X4,X3) ),
file('<stdin>',qg1_2) ).
fof(c_0_1_027,negated_conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ~ product(X6,X4,X2)
| ~ product(X5,X3,X2)
| ~ product(X1,X4,X6)
| ~ product(X1,X3,X5)
| equalish(X6,X5) ),
file('<stdin>',qg1_1) ).
fof(c_0_2_028,negated_conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ~ product(X6,X4,X2)
| ~ product(X5,X3,X2)
| ~ product(X1,X4,X6)
| ~ product(X1,X3,X5)
| equalish(X4,X3) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_029,negated_conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ~ product(X6,X4,X2)
| ~ product(X5,X3,X2)
| ~ product(X1,X4,X6)
| ~ product(X1,X3,X5)
| equalish(X6,X5) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4_030,negated_conjecture,
! [X7,X8,X9,X10,X11,X12] :
( ~ product(X12,X10,X8)
| ~ product(X11,X9,X8)
| ~ product(X7,X10,X12)
| ~ product(X7,X9,X11)
| equalish(X10,X9) ),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5_031,negated_conjecture,
! [X7,X8,X9,X10,X11,X12] :
( ~ product(X12,X10,X8)
| ~ product(X11,X9,X8)
| ~ product(X7,X10,X12)
| ~ product(X7,X9,X11)
| equalish(X12,X11) ),
inference(variable_rename,[status(thm)],[c_0_3]) ).
cnf(c_0_6_032,negated_conjecture,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X5)
| ~ product(X4,X2,X6)
| ~ product(X5,X1,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_033,negated_conjecture,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X5,X1)
| ~ product(X2,X4,X6)
| ~ product(X1,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_034,negated_conjecture,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X5)
| ~ product(X4,X2,X6)
| ~ product(X5,X1,X6) ),
c_0_6,
[final] ).
cnf(c_0_9_035,negated_conjecture,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X5,X1)
| ~ product(X2,X4,X6)
| ~ product(X1,X5,X6) ),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_33,negated_conjecture,
( equalish(X0,X1)
| ~ product(X0,X2,X3)
| ~ product(X1,X4,X3)
| ~ product(X5,X2,X0)
| ~ product(X5,X4,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_9) ).
cnf(c_39,negated_conjecture,
( equalish(X0,X1)
| ~ product(X0,X2,X3)
| ~ product(X1,X4,X3)
| ~ product(X5,X2,X0)
| ~ product(X5,X4,X1) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_46,negated_conjecture,
( equalish(X0,X1)
| ~ product(X0,X2,X3)
| ~ product(X1,X4,X3)
| ~ product(X5,X2,X0)
| ~ product(X5,X4,X1) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_47,negated_conjecture,
( equalish(X0,X1)
| ~ product(X0,X2,X3)
| ~ product(X1,X4,X3)
| ~ product(X5,X2,X0)
| ~ product(X5,X4,X1) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_50,negated_conjecture,
( equalish(X0,X1)
| ~ product(X0,X2,X3)
| ~ product(X1,X4,X3)
| ~ product(X5,X2,X0)
| ~ product(X5,X4,X1) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_84,negated_conjecture,
( equalish(X0,X1)
| ~ product(X0,X2,X3)
| ~ product(X1,X4,X3)
| ~ product(X5,X2,X0)
| ~ product(X5,X4,X1) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_31647,plain,
( equalish(e_2,e_3)
| ~ product(e_3,X0,X1)
| ~ product(e_2,X2,X1)
| ~ product(X3,X0,e_3)
| ~ product(X3,X2,e_2) ),
inference(instantiation,[status(thm)],[c_84]) ).
cnf(c_31705,plain,
( equalish(e_2,e_3)
| ~ product(e_3,e_3,e_3)
| ~ product(e_2,X0,e_3)
| ~ product(X1,e_3,e_3)
| ~ product(X1,X0,e_2) ),
inference(instantiation,[status(thm)],[c_31647]) ).
cnf(c_31825,plain,
( equalish(e_2,e_3)
| ~ product(e_3,e_3,e_3)
| ~ product(e_3,X0,e_2)
| ~ product(e_2,X0,e_3) ),
inference(instantiation,[status(thm)],[c_31705]) ).
cnf(c_31826,plain,
( equalish(e_2,e_3)
| ~ product(e_3,e_3,e_3)
| ~ product(e_3,e_1,e_2)
| ~ product(e_2,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_31825]) ).
cnf(c_9,plain,
( ~ group_element(X0)
| ~ group_element(X1)
| product(X0,X1,e_1)
| product(X0,X1,e_2)
| product(X0,X1,e_3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_23_0) ).
cnf(c_60,plain,
( ~ group_element(X0)
| ~ group_element(X1)
| product(X0,X1,e_1)
| product(X0,X1,e_2)
| product(X0,X1,e_3) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_31765,plain,
( product(e_2,X0,e_3)
| product(e_2,X0,e_2)
| product(e_2,X0,e_1)
| ~ group_element(e_2)
| ~ group_element(X0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_31768,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_1)
| ~ group_element(e_2)
| ~ group_element(e_1) ),
inference(instantiation,[status(thm)],[c_31765]) ).
cnf(c_31759,plain,
( product(e_3,X0,e_3)
| product(e_3,X0,e_2)
| product(e_3,X0,e_1)
| ~ group_element(e_3)
| ~ group_element(X0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_31764,plain,
( product(e_3,e_1,e_3)
| product(e_3,e_1,e_2)
| product(e_3,e_1,e_1)
| ~ group_element(e_3)
| ~ group_element(e_1) ),
inference(instantiation,[status(thm)],[c_31759]) ).
cnf(c_6,plain,
( ~ product(X0,X1,X2)
| ~ product(X3,X1,X2)
| equalish(X0,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_22_0) ).
cnf(c_57,plain,
( ~ product(X0,X1,X2)
| ~ product(X3,X1,X2)
| equalish(X0,X3) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_31737,plain,
( equalish(e_1,e_3)
| ~ product(e_3,X0,X1)
| ~ product(e_1,X0,X1) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_31738,plain,
( equalish(e_1,e_3)
| ~ product(e_3,e_1,e_1)
| ~ product(e_1,e_1,e_1) ),
inference(instantiation,[status(thm)],[c_31737]) ).
cnf(c_31735,plain,
( equalish(e_1,e_2)
| ~ product(e_2,X0,X1)
| ~ product(e_1,X0,X1) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_31736,plain,
( equalish(e_1,e_2)
| ~ product(e_2,e_1,e_1)
| ~ product(e_1,e_1,e_1) ),
inference(instantiation,[status(thm)],[c_31735]) ).
cnf(c_3,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X2)
| equalish(X1,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_21_0) ).
cnf(c_54,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X2)
| equalish(X1,X3) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_31684,plain,
( equalish(e_1,e_3)
| ~ product(X0,e_3,X1)
| ~ product(X0,e_1,X1) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_31724,plain,
( equalish(e_1,e_3)
| ~ product(e_3,e_3,e_3)
| ~ product(e_3,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_31684]) ).
cnf(c_31683,plain,
( equalish(e_1,e_2)
| ~ product(X0,e_2,X1)
| ~ product(X0,e_1,X1) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_31723,plain,
( equalish(e_1,e_2)
| ~ product(e_2,e_2,e_2)
| ~ product(e_2,e_1,e_2) ),
inference(instantiation,[status(thm)],[c_31683]) ).
cnf(c_31,plain,
product(X0,X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_60_0) ).
cnf(c_82,plain,
product(X0,X0,X0),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_31700,plain,
product(e_3,e_3,e_3),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_31696,plain,
product(e_2,e_2,e_2),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_22,plain,
group_element(e_1),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_69_0) ).
cnf(c_23,plain,
group_element(e_2),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_68_0) ).
cnf(c_24,plain,
group_element(e_3),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_67_0) ).
cnf(c_25,plain,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_66_0) ).
cnf(c_26,plain,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_65_0) ).
cnf(c_28,plain,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox/tmp/iprover_modulo_358bf7.p',c_0_63_0) ).
cnf(c_35,plain,
product(e_1,e_1,e_1),
inference(instantiation,[status(thm)],[c_31]) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_31826,c_31768,c_31764,c_31738,c_31736,c_31724,c_31723,c_31700,c_31696,c_22,c_23,c_24,c_25,c_26,c_28,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GRP123-2.003 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.11 % Command : iprover_modulo %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Mon Jun 13 06:40:26 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.16/0.31 % Running in mono-core mode
% 0.16/0.36 % Orienting using strategy Equiv(ClausalAll)
% 0.16/0.36 % Orientation found
% 0.16/0.36 % 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_f0908a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_358bf7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_4a48bf | grep -v "SZS"
% 0.17/0.38
% 0.17/0.38 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.17/0.38
% 0.17/0.38 %
% 0.17/0.38 % ------ iProver source info
% 0.17/0.38
% 0.17/0.38 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.17/0.38 % git: non_committed_changes: true
% 0.17/0.38 % git: last_make_outside_of_git: true
% 0.17/0.38
% 0.17/0.38 %
% 0.17/0.38 % ------ Input Options
% 0.17/0.38
% 0.17/0.38 % --out_options all
% 0.17/0.38 % --tptp_safe_out true
% 0.17/0.38 % --problem_path ""
% 0.17/0.38 % --include_path ""
% 0.17/0.38 % --clausifier .//eprover
% 0.17/0.38 % --clausifier_options --tstp-format
% 0.17/0.38 % --stdin false
% 0.17/0.38 % --dbg_backtrace false
% 0.17/0.38 % --dbg_dump_prop_clauses false
% 0.17/0.38 % --dbg_dump_prop_clauses_file -
% 0.17/0.38 % --dbg_out_stat false
% 0.17/0.38
% 0.17/0.38 % ------ General Options
% 0.17/0.38
% 0.17/0.38 % --fof false
% 0.17/0.38 % --time_out_real 150.
% 0.17/0.38 % --time_out_prep_mult 0.2
% 0.17/0.38 % --time_out_virtual -1.
% 0.17/0.38 % --schedule none
% 0.17/0.38 % --ground_splitting input
% 0.17/0.38 % --splitting_nvd 16
% 0.17/0.38 % --non_eq_to_eq false
% 0.17/0.38 % --prep_gs_sim true
% 0.17/0.38 % --prep_unflatten false
% 0.17/0.38 % --prep_res_sim true
% 0.17/0.38 % --prep_upred true
% 0.17/0.38 % --res_sim_input true
% 0.17/0.38 % --clause_weak_htbl true
% 0.17/0.38 % --gc_record_bc_elim false
% 0.17/0.38 % --symbol_type_check false
% 0.17/0.38 % --clausify_out false
% 0.17/0.38 % --large_theory_mode false
% 0.17/0.38 % --prep_sem_filter none
% 0.17/0.38 % --prep_sem_filter_out false
% 0.17/0.38 % --preprocessed_out false
% 0.17/0.38 % --sub_typing false
% 0.17/0.38 % --brand_transform false
% 0.17/0.38 % --pure_diseq_elim true
% 0.17/0.38 % --min_unsat_core false
% 0.17/0.38 % --pred_elim true
% 0.17/0.38 % --add_important_lit false
% 0.17/0.38 % --soft_assumptions false
% 0.17/0.38 % --reset_solvers false
% 0.17/0.38 % --bc_imp_inh []
% 0.17/0.38 % --conj_cone_tolerance 1.5
% 0.17/0.38 % --prolific_symb_bound 500
% 0.17/0.38 % --lt_threshold 2000
% 0.17/0.38
% 0.17/0.38 % ------ SAT Options
% 0.17/0.38
% 0.17/0.38 % --sat_mode false
% 0.17/0.38 % --sat_fm_restart_options ""
% 0.17/0.38 % --sat_gr_def false
% 0.17/0.38 % --sat_epr_types true
% 0.17/0.38 % --sat_non_cyclic_types false
% 0.17/0.38 % --sat_finite_models false
% 0.17/0.38 % --sat_fm_lemmas false
% 0.17/0.38 % --sat_fm_prep false
% 0.17/0.38 % --sat_fm_uc_incr true
% 0.17/0.38 % --sat_out_model small
% 0.17/0.38 % --sat_out_clauses false
% 0.17/0.38
% 0.17/0.38 % ------ QBF Options
% 0.17/0.38
% 0.17/0.38 % --qbf_mode false
% 0.17/0.38 % --qbf_elim_univ true
% 0.17/0.38 % --qbf_sk_in true
% 0.17/0.38 % --qbf_pred_elim true
% 0.17/0.38 % --qbf_split 32
% 0.17/0.38
% 0.17/0.38 % ------ BMC1 Options
% 0.17/0.38
% 0.17/0.38 % --bmc1_incremental false
% 0.17/0.38 % --bmc1_axioms reachable_all
% 0.17/0.38 % --bmc1_min_bound 0
% 0.17/0.38 % --bmc1_max_bound -1
% 0.17/0.38 % --bmc1_max_bound_default -1
% 0.17/0.38 % --bmc1_symbol_reachability true
% 0.17/0.38 % --bmc1_property_lemmas false
% 0.17/0.38 % --bmc1_k_induction false
% 0.17/0.38 % --bmc1_non_equiv_states false
% 0.17/0.38 % --bmc1_deadlock false
% 0.17/0.38 % --bmc1_ucm false
% 0.17/0.38 % --bmc1_add_unsat_core none
% 0.17/0.38 % --bmc1_unsat_core_children false
% 0.17/0.38 % --bmc1_unsat_core_extrapolate_axioms false
% 0.17/0.38 % --bmc1_out_stat full
% 0.17/0.38 % --bmc1_ground_init false
% 0.17/0.38 % --bmc1_pre_inst_next_state false
% 0.17/0.38 % --bmc1_pre_inst_state false
% 0.17/0.38 % --bmc1_pre_inst_reach_state false
% 0.17/0.38 % --bmc1_out_unsat_core false
% 0.17/0.38 % --bmc1_aig_witness_out false
% 0.17/0.38 % --bmc1_verbose false
% 0.17/0.38 % --bmc1_dump_clauses_tptp false
% 0.17/0.39 % --bmc1_dump_unsat_core_tptp false
% 0.17/0.39 % --bmc1_dump_file -
% 0.17/0.39 % --bmc1_ucm_expand_uc_limit 128
% 0.17/0.39 % --bmc1_ucm_n_expand_iterations 6
% 0.17/0.39 % --bmc1_ucm_extend_mode 1
% 0.17/0.39 % --bmc1_ucm_init_mode 2
% 0.17/0.39 % --bmc1_ucm_cone_mode none
% 0.17/0.39 % --bmc1_ucm_reduced_relation_type 0
% 0.17/0.39 % --bmc1_ucm_relax_model 4
% 0.17/0.39 % --bmc1_ucm_full_tr_after_sat true
% 0.17/0.39 % --bmc1_ucm_expand_neg_assumptions false
% 0.17/0.39 % --bmc1_ucm_layered_model none
% 0.17/0.39 % --bmc1_ucm_max_lemma_size 10
% 0.17/0.39
% 0.17/0.39 % ------ AIG Options
% 0.17/0.39
% 0.17/0.39 % --aig_mode false
% 0.17/0.39
% 0.17/0.39 % ------ Instantiation Options
% 0.17/0.39
% 0.17/0.39 % --instantiation_flag true
% 0.17/0.39 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.17/0.39 % --inst_solver_per_active 750
% 0.17/0.39 % --inst_solver_calls_frac 0.5
% 0.17/0.39 % --inst_passive_queue_type priority_queues
% 0.17/0.39 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.17/0.39 % --inst_passive_queues_freq [25;2]
% 0.17/0.39 % --inst_dismatching true
% 0.17/0.39 % --inst_eager_unprocessed_to_passive true
% 0.17/0.39 % --inst_prop_sim_given true
% 0.17/0.39 % --inst_prop_sim_new false
% 0.17/0.39 % --inst_orphan_elimination true
% 0.17/0.39 % --inst_learning_loop_flag true
% 0.17/0.39 % --inst_learning_start 3000
% 0.17/0.39 % --inst_learning_factor 2
% 0.17/0.39 % --inst_start_prop_sim_after_learn 3
% 0.17/0.39 % --inst_sel_renew solver
% 0.17/0.39 % --inst_lit_activity_flag true
% 0.17/0.39 % --inst_out_proof true
% 0.17/0.39
% 0.17/0.39 % ------ Resolution Options
% 0.17/0.39
% 0.17/0.39 % --resolution_flag true
% 0.17/0.39 % --res_lit_sel kbo_max
% 0.17/0.39 % --res_to_prop_solver none
% 0.17/0.39 % --res_prop_simpl_new false
% 0.17/0.39 % --res_prop_simpl_given false
% 0.17/0.39 % --res_passive_queue_type priority_queues
% 0.17/0.39 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.17/0.39 % --res_passive_queues_freq [15;5]
% 0.17/0.39 % --res_forward_subs full
% 0.17/0.39 % --res_backward_subs full
% 0.17/0.39 % --res_forward_subs_resolution true
% 0.17/0.39 % --res_backward_subs_resolution true
% 0.17/0.39 % --res_orphan_elimination false
% 0.17/0.39 % --res_time_limit 1000.
% 0.17/0.39 % --res_out_proof true
% 0.17/0.39 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f0908a.s
% 0.17/0.39 % --modulo true
% 0.17/0.39
% 0.17/0.39 % ------ Combination Options
% 0.17/0.39
% 0.17/0.39 % --comb_res_mult 1000
% 0.17/0.39 % --comb_inst_mult 300
% 0.17/0.39 % ------
% 0.17/0.39
% 0.17/0.39 % ------ Parsing...% successful
% 0.17/0.39
% 0.17/0.39 % ------ 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.17/0.39
% 0.17/0.39 % ------ Proving...
% 0.17/0.39 % ------ Problem Properties
% 0.17/0.39
% 0.17/0.39 %
% 0.17/0.39 % EPR true
% 0.17/0.39 % Horn false
% 0.17/0.39 % Has equality false
% 0.17/0.39
% 0.17/0.39 % % ------ Input Options Time Limit: Unbounded
% 0.17/0.39
% 0.17/0.39
% 0.17/0.39 % % ------ Current options:
% 0.17/0.39
% 0.17/0.39 % ------ Input Options
% 0.17/0.39
% 0.17/0.39 % --out_options all
% 0.17/0.39 % --tptp_safe_out true
% 0.17/0.39 % --problem_path ""
% 0.17/0.39 % --include_path ""
% 0.17/0.39 % --clausifier .//eprover
% 0.17/0.39 % --clausifier_options --tstp-format
% 0.17/0.39 % --stdin false
% 0.17/0.39 % --dbg_backtrace false
% 0.17/0.39 % --dbg_dump_prop_clauses false
% 0.17/0.39 % --dbg_dump_prop_clauses_file -
% 0.17/0.39 % --dbg_out_stat false
% 0.17/0.39
% 0.17/0.39 % ------ General Options
% 0.17/0.39
% 0.17/0.39 % --fof false
% 0.17/0.39 % --time_out_real 150.
% 0.17/0.39 % --time_out_prep_mult 0.2
% 0.17/0.39 % --time_out_virtual -1.
% 0.17/0.39 % --schedule none
% 0.17/0.39 % --ground_splitting input
% 0.17/0.39 % --splitting_nvd 16
% 0.17/0.39 % --non_eq_to_eq false
% 0.17/0.39 % --prep_gs_sim true
% 0.17/0.39 % --prep_unflatten false
% 0.17/0.39 % --prep_res_sim true
% 0.17/0.39 % --prep_upred true
% 0.17/0.39 % --res_sim_input true
% 0.17/0.39 % --clause_weak_htbl true
% 0.17/0.39 % --gc_record_bc_elim false
% 0.17/0.39 % --symbol_type_check false
% 0.17/0.39 % --clausify_out false
% 0.17/0.39 % --large_theory_mode false
% 0.17/0.39 % --prep_sem_filter none
% 0.17/0.39 % --prep_sem_filter_out false
% 0.17/0.39 % --preprocessed_out false
% 0.17/0.39 % --sub_typing false
% 0.17/0.39 % --brand_transform false
% 0.17/0.39 % --pure_diseq_elim true
% 0.17/0.39 % --min_unsat_core false
% 0.17/0.39 % --pred_elim true
% 0.17/0.39 % --add_important_lit false
% 0.17/0.39 % --soft_assumptions false
% 0.17/0.39 % --reset_solvers false
% 0.17/0.39 % --bc_imp_inh []
% 0.17/0.39 % --conj_cone_tolerance 1.5
% 0.17/0.39 % --prolific_symb_bound 500
% 0.17/0.39 % --lt_threshold 2000
% 0.17/0.39
% 0.17/0.39 % ------ SAT Options
% 0.17/0.39
% 0.17/0.39 % --sat_mode false
% 0.17/0.39 % --sat_fm_restart_options ""
% 0.17/0.39 % --sat_gr_def false
% 0.17/0.39 % --sat_epr_types true
% 0.17/0.39 % --sat_non_cyclic_types false
% 0.17/0.39 % --sat_finite_models false
% 0.17/0.39 % --sat_fm_lemmas false
% 0.17/0.39 % --sat_fm_prep false
% 0.17/0.39 % --sat_fm_uc_incr true
% 0.17/0.39 % --sat_out_model small
% 0.17/0.39 % --sat_out_clauses false
% 0.17/0.39
% 0.17/0.39 % ------ QBF Options
% 0.17/0.39
% 0.17/0.39 % --qbf_mode false
% 0.17/0.39 % --qbf_elim_univ true
% 0.17/0.39 % --qbf_sk_in true
% 0.17/0.39 % --qbf_pred_elim true
% 0.17/0.39 % --qbf_split 32
% 0.17/0.39
% 0.17/0.39 % ------ BMC1 Options
% 0.17/0.39
% 0.17/0.39 % --bmc1_incremental false
% 0.17/0.39 % --bmc1_axioms reachable_all
% 0.17/0.39 % --bmc1_min_bound 0
% 0.17/0.39 % --bmc1_max_bound -1
% 0.17/0.39 % --bmc1_max_bound_default -1
% 0.17/0.39 % --bmc1_symbol_reachability true
% 0.17/0.39 % --bmc1_property_lemmas false
% 0.17/0.39 % --bmc1_k_induction false
% 0.17/0.39 % --bmc1_non_equiv_states false
% 0.17/0.39 % --bmc1_deadlock false
% 0.17/0.39 % --bmc1_ucm false
% 0.17/0.39 % --bmc1_add_unsat_core none
% 0.17/0.39 % --bmc1_unsat_core_children false
% 0.17/0.39 % --bmc1_unsat_core_extrapolate_axioms false
% 0.17/0.39 % --bmc1_out_stat full
% 0.17/0.39 % --bmc1_ground_init false
% 0.17/0.39 % --bmc1_pre_inst_next_state false
% 0.17/0.39 % --bmc1_pre_inst_state false
% 0.17/0.39 % --bmc1_pre_inst_reach_state false
% 0.17/0.39 % --bmc1_out_unsat_core false
% 0.17/0.39 % --bmc1_aig_witness_out false
% 0.17/0.39 % --bmc1_verbose false
% 0.17/0.39 % --bmc1_dump_clauses_tptp false
% 0.17/0.39 % --bmc1_dump_unsat_core_tptp false
% 0.17/0.39 % --bmc1_dump_file -
% 0.17/0.39 % --bmc1_ucm_expand_uc_limit 128
% 0.17/0.39 % --bmc1_ucm_n_expand_iterations 6
% 0.17/0.39 % --bmc1_ucm_extend_mode 1
% 0.17/0.39 % --bmc1_ucm_init_mode 2
% 0.17/0.39 % --bmc1_ucm_cone_mode none
% 0.17/0.39 % --bmc1_ucm_reduced_relation_type 0
% 0.17/0.39 % --bmc1_ucm_relax_model 4
% 0.17/0.39 % --bmc1_ucm_full_tr_after_sat true
% 0.17/0.39 % --bmc1_ucm_expand_neg_assumptions false
% 0.17/0.39 % --bmc1_ucm_layered_model none
% 0.17/0.39 % --bmc1_ucm_max_lemma_size 10
% 0.17/0.39
% 0.17/0.39 % ------ AIG Options
% 0.17/0.39
% 0.17/0.39 % --aig_mode false
% 0.17/0.39
% 0.17/0.39 % ------ Instantiation Options
% 0.17/0.39
% 0.17/0.39 % --instantiation_flag true
% 0.17/0.39 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.17/0.39 % --inst_solver_per_active 750
% 0.17/0.39 % --inst_solver_calls_frac 0.5
% 0.17/0.39 % --inst_passive_queue_type priority_queues
% 0.17/0.39 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.17/0.39 % --inst_passive_queues_freq [25;2]
% 0.17/0.39 % --inst_dismatching true
% 0.17/0.39 % --inst_eager_unprocessed_to_passive true
% 0.17/0.39 % --inst_prop_sim_given true
% 1.31/1.49 % --inst_prop_sim_new false
% 1.31/1.49 % --inst_orphan_elimination true
% 1.31/1.49 % --inst_learning_loop_flag true
% 1.31/1.49 % --inst_learning_start 3000
% 1.31/1.49 % --inst_learning_factor 2
% 1.31/1.49 % --inst_start_prop_sim_after_learn 3
% 1.31/1.49 % --inst_sel_renew solver
% 1.31/1.49 % --inst_lit_activity_flag true
% 1.31/1.49 % --inst_out_proof true
% 1.31/1.49
% 1.31/1.49 % ------ Resolution Options
% 1.31/1.49
% 1.31/1.49 % --resolution_flag true
% 1.31/1.49 % --res_lit_sel kbo_max
% 1.31/1.49 % --res_to_prop_solver none
% 1.31/1.49 % --res_prop_simpl_new false
% 1.31/1.49 % --res_prop_simpl_given false
% 1.31/1.49 % --res_passive_queue_type priority_queues
% 1.31/1.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.31/1.49 % --res_passive_queues_freq [15;5]
% 1.31/1.49 % --res_forward_subs full
% 1.31/1.49 % --res_backward_subs full
% 1.31/1.49 % --res_forward_subs_resolution true
% 1.31/1.49 % --res_backward_subs_resolution true
% 1.31/1.49 % --res_orphan_elimination false
% 1.31/1.49 % --res_time_limit 1000.
% 1.31/1.49 % --res_out_proof true
% 1.31/1.49 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f0908a.s
% 1.31/1.49 % --modulo true
% 1.31/1.49
% 1.31/1.49 % ------ Combination Options
% 1.31/1.49
% 1.31/1.49 % --comb_res_mult 1000
% 1.31/1.49 % --comb_inst_mult 300
% 1.31/1.49 % ------
% 1.31/1.49
% 1.31/1.49
% 1.31/1.49
% 1.31/1.49 % ------ Proving...
% 1.31/1.49 %
% 1.31/1.49
% 1.31/1.49
% 1.31/1.49 % ------ Statistics
% 1.31/1.49
% 1.31/1.49 % ------ General
% 1.31/1.49
% 1.31/1.49 % num_of_input_clauses: 34
% 1.31/1.49 % num_of_input_neg_conjectures: 2
% 1.31/1.49 % num_of_splits: 0
% 1.31/1.49 % num_of_split_atoms: 0
% 1.31/1.49 % num_of_sem_filtered_clauses: 0
% 1.31/1.49 % num_of_subtypes: 0
% 1.31/1.49 % monotx_restored_types: 0
% 1.31/1.49 % sat_num_of_epr_types: 0
% 1.31/1.49 % sat_num_of_non_cyclic_types: 0
% 1.31/1.49 % sat_guarded_non_collapsed_types: 0
% 1.31/1.49 % is_epr: 1
% 1.31/1.49 % is_horn: 0
% 1.31/1.49 % has_eq: 0
% 1.31/1.49 % num_pure_diseq_elim: 0
% 1.31/1.49 % simp_replaced_by: 0
% 1.31/1.49 % res_preprocessed: 4
% 1.31/1.49 % prep_upred: 0
% 1.31/1.49 % prep_unflattend: 0
% 1.31/1.49 % pred_elim_cands: 0
% 1.31/1.49 % pred_elim: 0
% 1.31/1.49 % pred_elim_cl: 0
% 1.31/1.49 % pred_elim_cycles: 0
% 1.31/1.49 % forced_gc_time: 0
% 1.31/1.49 % gc_basic_clause_elim: 0
% 1.31/1.49 % parsing_time: 0.001
% 1.31/1.49 % sem_filter_time: 0.
% 1.31/1.49 % pred_elim_time: 0.
% 1.31/1.49 % out_proof_time: 0.001
% 1.31/1.49 % monotx_time: 0.
% 1.31/1.49 % subtype_inf_time: 0.
% 1.31/1.49 % unif_index_cands_time: 0.001
% 1.31/1.49 % unif_index_add_time: 0.
% 1.31/1.49 % total_time: 1.124
% 1.31/1.49 % num_of_symbols: 33
% 1.31/1.49 % num_of_terms: 682
% 1.31/1.49
% 1.31/1.49 % ------ Propositional Solver
% 1.31/1.49
% 1.31/1.49 % prop_solver_calls: 4
% 1.31/1.49 % prop_fast_solver_calls: 30
% 1.31/1.49 % prop_num_of_clauses: 148
% 1.31/1.49 % prop_preprocess_simplified: 337
% 1.31/1.49 % prop_fo_subsumed: 0
% 1.31/1.49 % prop_solver_time: 0.
% 1.31/1.49 % prop_fast_solver_time: 0.
% 1.31/1.49 % prop_unsat_core_time: 0.
% 1.31/1.49
% 1.31/1.49 % ------ QBF
% 1.31/1.49
% 1.31/1.49 % qbf_q_res: 0
% 1.31/1.49 % qbf_num_tautologies: 0
% 1.31/1.49 % qbf_prep_cycles: 0
% 1.31/1.49
% 1.31/1.49 % ------ BMC1
% 1.31/1.49
% 1.31/1.49 % bmc1_current_bound: -1
% 1.31/1.49 % bmc1_last_solved_bound: -1
% 1.31/1.49 % bmc1_unsat_core_size: -1
% 1.31/1.49 % bmc1_unsat_core_parents_size: -1
% 1.31/1.49 % bmc1_merge_next_fun: 0
% 1.31/1.49 % bmc1_unsat_core_clauses_time: 0.
% 1.31/1.49
% 1.31/1.49 % ------ Instantiation
% 1.31/1.49
% 1.31/1.49 % inst_num_of_clauses: 121
% 1.31/1.49 % inst_num_in_passive: 44
% 1.31/1.49 % inst_num_in_active: 63
% 1.31/1.49 % inst_num_in_unprocessed: 11
% 1.31/1.49 % inst_num_of_loops: 65
% 1.31/1.49 % inst_num_of_learning_restarts: 0
% 1.31/1.49 % inst_num_moves_active_passive: 0
% 1.31/1.49 % inst_lit_activity: 26
% 1.31/1.49 % inst_lit_activity_moves: 0
% 1.31/1.49 % inst_num_tautologies: 0
% 1.31/1.49 % inst_num_prop_implied: 0
% 1.31/1.49 % inst_num_existing_simplified: 0
% 1.31/1.49 % inst_num_eq_res_simplified: 0
% 1.31/1.49 % inst_num_child_elim: 0
% 1.31/1.49 % inst_num_of_dismatching_blockings: 0
% 1.31/1.49 % inst_num_of_non_proper_insts: 53
% 1.31/1.49 % inst_num_of_duplicates: 66
% 1.31/1.49 % inst_inst_num_from_inst_to_res: 0
% 1.31/1.49 % inst_dismatching_checking_time: 0.
% 1.31/1.49
% 1.31/1.49 % ------ Resolution
% 1.31/1.49
% 1.31/1.49 % res_num_of_clauses: 5476
% 1.31/1.49 % res_num_in_passive: 5161
% 1.31/1.49 % res_num_in_active: 354
% 1.31/1.49 % res_num_of_loops: 1000
% 1.31/1.49 % res_forward_subset_subsumed: 3327
% 1.31/1.49 % res_backward_subset_subsumed: 125
% 1.31/1.49 % res_forward_subsumed: 502
% 1.31/1.49 % res_backward_subsumed: 136
% 1.31/1.49 % res_forward_subsumption_resolution: 212
% 1.31/1.49 % res_backward_subsumption_resolution: 7
% 1.31/1.49 % res_clause_to_clause_subsumption: 91936
% 1.31/1.49 % res_orphan_elimination: 0
% 1.31/1.49 % res_tautology_del: 2028
% 1.31/1.49 % res_num_eq_res_simplified: 0
% 1.31/1.49 % res_num_sel_changes: 0
% 1.31/1.49 % res_moves_from_active_to_pass: 0
% 1.31/1.49
% 1.31/1.49 % Status Unsatisfiable
% 1.31/1.49 % SZS status Unsatisfiable
% 1.31/1.49 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------