TSTP Solution File: GRP130-3.003 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n021.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:45:14 EDT 2022
% Result : Unsatisfiable 5.20s 5.45s
% Output : CNFRefutation 5.20s
% 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(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(cycle3,axiom,
cycle(e_3,e_0),
input ).
fof(cycle3_0,plain,
( cycle(e_3,e_0)
| $false ),
inference(orientation,[status(thm)],[cycle3]) ).
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_3_greater_e_0,axiom,
greater(e_3,e_0),
input ).
fof(e_3_greater_e_0_0,plain,
( greater(e_3,e_0)
| $false ),
inference(orientation,[status(thm)],[e_3_greater_e_0]) ).
cnf(e_2_greater_e_0,axiom,
greater(e_2,e_0),
input ).
fof(e_2_greater_e_0_0,plain,
( greater(e_2,e_0)
| $false ),
inference(orientation,[status(thm)],[e_2_greater_e_0]) ).
cnf(e_1_greater_e_0,axiom,
greater(e_1,e_0),
input ).
fof(e_1_greater_e_0_0,plain,
( greater(e_1,e_0)
| $false ),
inference(orientation,[status(thm)],[e_1_greater_e_0]) ).
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]) ).
cnf(e_0_then_e_1,axiom,
next(e_0,e_1),
input ).
fof(e_0_then_e_1_0,plain,
( next(e_0,e_1)
| $false ),
inference(orientation,[status(thm)],[e_0_then_e_1]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> next(e_0,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[e_0_then_e_1_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
( lhs_atom2
<=> next(e_1,e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
( lhs_atom2
| $false ),
inference(fold_definition,[status(thm)],[e_1_then_e_2_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
( lhs_atom3
<=> next(e_2,e_3) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
( lhs_atom3
| $false ),
inference(fold_definition,[status(thm)],[e_2_then_e_3_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
( lhs_atom4
<=> greater(e_1,e_0) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
( lhs_atom4
| $false ),
inference(fold_definition,[status(thm)],[e_1_greater_e_0_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
( lhs_atom5
<=> greater(e_2,e_0) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
( lhs_atom5
| $false ),
inference(fold_definition,[status(thm)],[e_2_greater_e_0_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
( lhs_atom6
<=> greater(e_3,e_0) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
( lhs_atom6
| $false ),
inference(fold_definition,[status(thm)],[e_3_greater_e_0_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
( lhs_atom7
<=> greater(e_2,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[e_2_greater_e_1_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
( lhs_atom8
<=> greater(e_3,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
( lhs_atom8
| $false ),
inference(fold_definition,[status(thm)],[e_3_greater_e_1_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
( lhs_atom9
<=> greater(e_3,e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
( lhs_atom9
| $false ),
inference(fold_definition,[status(thm)],[e_3_greater_e_2_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
( lhs_atom10
<=> cycle(e_3,e_0) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
( lhs_atom10
| $false ),
inference(fold_definition,[status(thm)],[cycle3_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
( lhs_atom11
<=> group_element(e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
( lhs_atom11
| $false ),
inference(fold_definition,[status(thm)],[element_1_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
( lhs_atom12
<=> group_element(e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
( lhs_atom12
| $false ),
inference(fold_definition,[status(thm)],[element_2_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
( lhs_atom13
<=> group_element(e_3) ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
( lhs_atom13
| $false ),
inference(fold_definition,[status(thm)],[element_3_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
( lhs_atom14
<=> ~ equalish(e_1,e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_13,plain,
( lhs_atom14
| $false ),
inference(fold_definition,[status(thm)],[e_1_is_not_e_2_0,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
( lhs_atom15
<=> ~ equalish(e_1,e_3) ),
inference(definition,[],]) ).
fof(to_be_clausified_14,plain,
( lhs_atom15
| $false ),
inference(fold_definition,[status(thm)],[e_1_is_not_e_3_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
( lhs_atom16
<=> ~ equalish(e_2,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_15,plain,
( lhs_atom16
| $false ),
inference(fold_definition,[status(thm)],[e_2_is_not_e_1_0,def_lhs_atom16]) ).
fof(def_lhs_atom17,axiom,
( lhs_atom17
<=> ~ equalish(e_2,e_3) ),
inference(definition,[],]) ).
fof(to_be_clausified_16,plain,
( lhs_atom17
| $false ),
inference(fold_definition,[status(thm)],[e_2_is_not_e_3_0,def_lhs_atom17]) ).
fof(def_lhs_atom18,axiom,
( lhs_atom18
<=> ~ equalish(e_3,e_1) ),
inference(definition,[],]) ).
fof(to_be_clausified_17,plain,
( lhs_atom18
| $false ),
inference(fold_definition,[status(thm)],[e_3_is_not_e_1_0,def_lhs_atom18]) ).
fof(def_lhs_atom19,axiom,
( lhs_atom19
<=> ~ equalish(e_3,e_2) ),
inference(definition,[],]) ).
fof(to_be_clausified_18,plain,
( lhs_atom19
| $false ),
inference(fold_definition,[status(thm)],[e_3_is_not_e_2_0,def_lhs_atom19]) ).
% Start CNF derivation
fof(c_0_0,axiom,
( lhs_atom19
| ~ $true ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_1,axiom,
( lhs_atom18
| ~ $true ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_2,axiom,
( lhs_atom17
| ~ $true ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_3,axiom,
( lhs_atom16
| ~ $true ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_4,axiom,
( lhs_atom15
| ~ $true ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_5,axiom,
( lhs_atom14
| ~ $true ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_6,axiom,
( lhs_atom13
| ~ $true ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_7,axiom,
( lhs_atom12
| ~ $true ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_8,axiom,
( lhs_atom11
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_9,axiom,
( lhs_atom10
| ~ $true ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_10,axiom,
( lhs_atom9
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_11,axiom,
( lhs_atom8
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_12,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_13,axiom,
( lhs_atom6
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_14,axiom,
( lhs_atom5
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_15,axiom,
( lhs_atom4
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_16,axiom,
( lhs_atom3
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_17,axiom,
( lhs_atom2
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_18,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_19,plain,
lhs_atom19,
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_20,plain,
lhs_atom18,
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_21,plain,
lhs_atom17,
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_22,plain,
lhs_atom16,
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_23,plain,
lhs_atom15,
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_24,plain,
lhs_atom14,
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_25,plain,
lhs_atom13,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_26,plain,
lhs_atom12,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_27,plain,
lhs_atom11,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_28,plain,
lhs_atom10,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_29,plain,
lhs_atom9,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
lhs_atom8,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_32,plain,
lhs_atom6,
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_33,plain,
lhs_atom5,
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_34,plain,
lhs_atom4,
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_35,plain,
lhs_atom3,
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_36,plain,
lhs_atom2,
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_37,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_38,plain,
lhs_atom19,
c_0_19 ).
fof(c_0_39,plain,
lhs_atom18,
c_0_20 ).
fof(c_0_40,plain,
lhs_atom17,
c_0_21 ).
fof(c_0_41,plain,
lhs_atom16,
c_0_22 ).
fof(c_0_42,plain,
lhs_atom15,
c_0_23 ).
fof(c_0_43,plain,
lhs_atom14,
c_0_24 ).
fof(c_0_44,plain,
lhs_atom13,
c_0_25 ).
fof(c_0_45,plain,
lhs_atom12,
c_0_26 ).
fof(c_0_46,plain,
lhs_atom11,
c_0_27 ).
fof(c_0_47,plain,
lhs_atom10,
c_0_28 ).
fof(c_0_48,plain,
lhs_atom9,
c_0_29 ).
fof(c_0_49,plain,
lhs_atom8,
c_0_30 ).
fof(c_0_50,plain,
lhs_atom7,
c_0_31 ).
fof(c_0_51,plain,
lhs_atom6,
c_0_32 ).
fof(c_0_52,plain,
lhs_atom5,
c_0_33 ).
fof(c_0_53,plain,
lhs_atom4,
c_0_34 ).
fof(c_0_54,plain,
lhs_atom3,
c_0_35 ).
fof(c_0_55,plain,
lhs_atom2,
c_0_36 ).
fof(c_0_56,plain,
lhs_atom1,
c_0_37 ).
cnf(c_0_57,plain,
lhs_atom19,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_58,plain,
lhs_atom18,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_59,plain,
lhs_atom17,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_60,plain,
lhs_atom16,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_61,plain,
lhs_atom15,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_62,plain,
lhs_atom14,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_63,plain,
lhs_atom13,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_64,plain,
lhs_atom12,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_65,plain,
lhs_atom11,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_66,plain,
lhs_atom10,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_67,plain,
lhs_atom9,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_68,plain,
lhs_atom8,
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_69,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_70,plain,
lhs_atom6,
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_71,plain,
lhs_atom5,
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_72,plain,
lhs_atom4,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_73,plain,
lhs_atom3,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_74,plain,
lhs_atom2,
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_75,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_76,plain,
lhs_atom19,
c_0_57,
[final] ).
cnf(c_0_77,plain,
lhs_atom18,
c_0_58,
[final] ).
cnf(c_0_78,plain,
lhs_atom17,
c_0_59,
[final] ).
cnf(c_0_79,plain,
lhs_atom16,
c_0_60,
[final] ).
cnf(c_0_80,plain,
lhs_atom15,
c_0_61,
[final] ).
cnf(c_0_81,plain,
lhs_atom14,
c_0_62,
[final] ).
cnf(c_0_82,plain,
lhs_atom13,
c_0_63,
[final] ).
cnf(c_0_83,plain,
lhs_atom12,
c_0_64,
[final] ).
cnf(c_0_84,plain,
lhs_atom11,
c_0_65,
[final] ).
cnf(c_0_85,plain,
lhs_atom10,
c_0_66,
[final] ).
cnf(c_0_86,plain,
lhs_atom9,
c_0_67,
[final] ).
cnf(c_0_87,plain,
lhs_atom8,
c_0_68,
[final] ).
cnf(c_0_88,plain,
lhs_atom7,
c_0_69,
[final] ).
cnf(c_0_89,plain,
lhs_atom6,
c_0_70,
[final] ).
cnf(c_0_90,plain,
lhs_atom5,
c_0_71,
[final] ).
cnf(c_0_91,plain,
lhs_atom4,
c_0_72,
[final] ).
cnf(c_0_92,plain,
lhs_atom3,
c_0_73,
[final] ).
cnf(c_0_93,plain,
lhs_atom2,
c_0_74,
[final] ).
cnf(c_0_94,plain,
lhs_atom1,
c_0_75,
[final] ).
% End CNF derivation
cnf(c_0_76_0,axiom,
~ equalish(e_3,e_2),
inference(unfold_definition,[status(thm)],[c_0_76,def_lhs_atom19]) ).
cnf(c_0_77_0,axiom,
~ equalish(e_3,e_1),
inference(unfold_definition,[status(thm)],[c_0_77,def_lhs_atom18]) ).
cnf(c_0_78_0,axiom,
~ equalish(e_2,e_3),
inference(unfold_definition,[status(thm)],[c_0_78,def_lhs_atom17]) ).
cnf(c_0_79_0,axiom,
~ equalish(e_2,e_1),
inference(unfold_definition,[status(thm)],[c_0_79,def_lhs_atom16]) ).
cnf(c_0_80_0,axiom,
~ equalish(e_1,e_3),
inference(unfold_definition,[status(thm)],[c_0_80,def_lhs_atom15]) ).
cnf(c_0_81_0,axiom,
~ equalish(e_1,e_2),
inference(unfold_definition,[status(thm)],[c_0_81,def_lhs_atom14]) ).
cnf(c_0_82_0,axiom,
group_element(e_3),
inference(unfold_definition,[status(thm)],[c_0_82,def_lhs_atom13]) ).
cnf(c_0_83_0,axiom,
group_element(e_2),
inference(unfold_definition,[status(thm)],[c_0_83,def_lhs_atom12]) ).
cnf(c_0_84_0,axiom,
group_element(e_1),
inference(unfold_definition,[status(thm)],[c_0_84,def_lhs_atom11]) ).
cnf(c_0_85_0,axiom,
cycle(e_3,e_0),
inference(unfold_definition,[status(thm)],[c_0_85,def_lhs_atom10]) ).
cnf(c_0_86_0,axiom,
greater(e_3,e_2),
inference(unfold_definition,[status(thm)],[c_0_86,def_lhs_atom9]) ).
cnf(c_0_87_0,axiom,
greater(e_3,e_1),
inference(unfold_definition,[status(thm)],[c_0_87,def_lhs_atom8]) ).
cnf(c_0_88_0,axiom,
greater(e_2,e_1),
inference(unfold_definition,[status(thm)],[c_0_88,def_lhs_atom7]) ).
cnf(c_0_89_0,axiom,
greater(e_3,e_0),
inference(unfold_definition,[status(thm)],[c_0_89,def_lhs_atom6]) ).
cnf(c_0_90_0,axiom,
greater(e_2,e_0),
inference(unfold_definition,[status(thm)],[c_0_90,def_lhs_atom5]) ).
cnf(c_0_91_0,axiom,
greater(e_1,e_0),
inference(unfold_definition,[status(thm)],[c_0_91,def_lhs_atom4]) ).
cnf(c_0_92_0,axiom,
next(e_2,e_3),
inference(unfold_definition,[status(thm)],[c_0_92,def_lhs_atom3]) ).
cnf(c_0_93_0,axiom,
next(e_1,e_2),
inference(unfold_definition,[status(thm)],[c_0_93,def_lhs_atom2]) ).
cnf(c_0_94_0,axiom,
next(e_0,e_1),
inference(unfold_definition,[status(thm)],[c_0_94,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,
! [X1,X2,X5,X3] :
( ~ cycle(X3,X2)
| ~ product(X3,e_1,X1)
| ~ greater(X2,e_0)
| ~ next(X3,X5)
| equalish(X1,X5) ),
file('<stdin>',cycle7) ).
fof(c_0_5_006,axiom,
! [X6,X7,X2,X3,X4] :
( ~ cycle(X3,X7)
| ~ cycle(X2,e_0)
| ~ cycle(X4,X6)
| ~ next(X2,X4)
| ~ greater(X2,X3)
| ~ greater(X7,X6) ),
file('<stdin>',cycle5) ).
fof(c_0_6_007,axiom,
! [X2,X3] :
( ~ cycle(X3,e_0)
| ~ product(X3,e_1,X2)
| ~ greater(X2,X3) ),
file('<stdin>',cycle6) ).
fof(c_0_7_008,axiom,
! [X7,X1,X2,X3,X4] :
( ~ cycle(X3,X2)
| ~ cycle(X4,X1)
| ~ next(X3,X4)
| ~ greater(X2,e_0)
| ~ next(X1,X7)
| equalish(X2,X7) ),
file('<stdin>',cycle4) ).
fof(c_0_8_009,axiom,
! [X1,X2,X3] :
( ~ cycle(X3,X2)
| ~ cycle(X3,X1)
| equalish(X2,X1) ),
file('<stdin>',cycle1) ).
fof(c_0_9_010,axiom,
! [X3] :
( ~ group_element(X3)
| cycle(X3,e_0)
| cycle(X3,e_1)
| cycle(X3,e_2) ),
file('<stdin>',cycle2) ).
fof(c_0_10_011,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_11_012,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_12_013,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_13_014,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_14_015,plain,
! [X1,X2,X5,X3] :
( ~ cycle(X3,X2)
| ~ product(X3,e_1,X1)
| ~ greater(X2,e_0)
| ~ next(X3,X5)
| equalish(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_15_016,plain,
! [X6,X7,X2,X3,X4] :
( ~ cycle(X3,X7)
| ~ cycle(X2,e_0)
| ~ cycle(X4,X6)
| ~ next(X2,X4)
| ~ greater(X2,X3)
| ~ greater(X7,X6) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_16_017,plain,
! [X2,X3] :
( ~ cycle(X3,e_0)
| ~ product(X3,e_1,X2)
| ~ greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_17_018,plain,
! [X7,X1,X2,X3,X4] :
( ~ cycle(X3,X2)
| ~ cycle(X4,X1)
| ~ next(X3,X4)
| ~ greater(X2,e_0)
| ~ next(X1,X7)
| equalish(X2,X7) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_18_019,plain,
! [X1,X2,X3] :
( ~ cycle(X3,X2)
| ~ cycle(X3,X1)
| equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_19_020,plain,
! [X3] :
( ~ group_element(X3)
| cycle(X3,e_0)
| cycle(X3,e_1)
| cycle(X3,e_2) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_20_021,plain,
! [X5,X6,X7,X8] :
( ~ product(X7,X6,X8)
| ~ product(X7,X6,X5)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_21_022,plain,
! [X5,X6,X7,X8] :
( ~ product(X7,X8,X6)
| ~ product(X7,X5,X6)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_22_023,plain,
! [X5,X6,X7,X8] :
( ~ product(X8,X6,X7)
| ~ product(X5,X6,X7)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_23_024,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_13]) ).
fof(c_0_24_025,plain,
! [X6,X7,X8,X9] :
( ~ cycle(X9,X7)
| ~ product(X9,e_1,X6)
| ~ greater(X7,e_0)
| ~ next(X9,X8)
| equalish(X6,X8) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_25_026,plain,
! [X8,X9,X10,X11,X12] :
( ~ cycle(X11,X9)
| ~ cycle(X10,e_0)
| ~ cycle(X12,X8)
| ~ next(X10,X12)
| ~ greater(X10,X11)
| ~ greater(X9,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_15])])]) ).
fof(c_0_26_027,plain,
! [X4,X5] :
( ~ cycle(X5,e_0)
| ~ product(X5,e_1,X4)
| ~ greater(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_27_028,plain,
! [X8,X9,X10,X11,X12] :
( ~ cycle(X11,X10)
| ~ cycle(X12,X9)
| ~ next(X11,X12)
| ~ greater(X10,e_0)
| ~ next(X9,X8)
| equalish(X10,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_17])])]) ).
fof(c_0_28_029,plain,
! [X4,X5,X6] :
( ~ cycle(X6,X5)
| ~ cycle(X6,X4)
| equalish(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_29_030,plain,
! [X4] :
( ~ group_element(X4)
| cycle(X4,e_0)
| cycle(X4,e_1)
| cycle(X4,e_2) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
cnf(c_0_30_031,plain,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31_032,plain,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32_033,plain,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33_034,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_23]) ).
cnf(c_0_34_035,plain,
( equalish(X1,X2)
| ~ next(X3,X2)
| ~ greater(X4,e_0)
| ~ product(X3,e_1,X1)
| ~ cycle(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35_036,plain,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ next(X3,X5)
| ~ cycle(X5,X2)
| ~ cycle(X3,e_0)
| ~ cycle(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36_037,plain,
( ~ greater(X1,X2)
| ~ product(X2,e_1,X1)
| ~ cycle(X2,e_0) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37_038,plain,
( equalish(X1,X2)
| ~ next(X3,X2)
| ~ greater(X1,e_0)
| ~ next(X4,X5)
| ~ cycle(X5,X3)
| ~ cycle(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38_039,plain,
( equalish(X1,X2)
| ~ cycle(X3,X2)
| ~ cycle(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39_040,plain,
( cycle(X1,e_2)
| cycle(X1,e_1)
| cycle(X1,e_0)
| ~ group_element(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40_041,plain,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
c_0_30,
[final] ).
cnf(c_0_41_042,plain,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
c_0_31,
[final] ).
cnf(c_0_42_043,plain,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
c_0_32,
[final] ).
cnf(c_0_43_044,plain,
( product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
c_0_33,
[final] ).
cnf(c_0_44_045,plain,
( equalish(X1,X2)
| ~ next(X3,X2)
| ~ greater(X4,e_0)
| ~ product(X3,e_1,X1)
| ~ cycle(X3,X4) ),
c_0_34,
[final] ).
cnf(c_0_45_046,plain,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ next(X3,X5)
| ~ cycle(X5,X2)
| ~ cycle(X3,e_0)
| ~ cycle(X4,X1) ),
c_0_35,
[final] ).
cnf(c_0_46_047,plain,
( ~ greater(X1,X2)
| ~ product(X2,e_1,X1)
| ~ cycle(X2,e_0) ),
c_0_36,
[final] ).
cnf(c_0_47_048,plain,
( equalish(X1,X2)
| ~ next(X3,X2)
| ~ greater(X1,e_0)
| ~ next(X4,X5)
| ~ cycle(X5,X3)
| ~ cycle(X4,X1) ),
c_0_37,
[final] ).
cnf(c_0_48_049,plain,
( equalish(X1,X2)
| ~ cycle(X3,X2)
| ~ cycle(X3,X1) ),
c_0_38,
[final] ).
cnf(c_0_49_050,plain,
( cycle(X1,e_2)
| cycle(X1,e_1)
| cycle(X1,e_0)
| ~ group_element(X1) ),
c_0_39,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_40_0,axiom,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_1,axiom,
( ~ product(X3,X4,X2)
| equalish(X1,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_2,axiom,
( ~ product(X3,X4,X1)
| ~ product(X3,X4,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_41_0,axiom,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_41_1,axiom,
( ~ product(X3,X2,X4)
| equalish(X1,X2)
| ~ product(X3,X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_41_2,axiom,
( ~ product(X3,X1,X4)
| ~ product(X3,X2,X4)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_42_0,axiom,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_1,axiom,
( ~ product(X2,X3,X4)
| equalish(X1,X2)
| ~ product(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_2,axiom,
( ~ product(X1,X3,X4)
| ~ product(X2,X3,X4)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_44_0,axiom,
( equalish(X1,X2)
| ~ next(X3,X2)
| ~ greater(X4,e_0)
| ~ product(X3,e_1,X1)
| ~ cycle(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( ~ next(X3,X2)
| equalish(X1,X2)
| ~ greater(X4,e_0)
| ~ product(X3,e_1,X1)
| ~ cycle(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_2,axiom,
( ~ greater(X4,e_0)
| ~ next(X3,X2)
| equalish(X1,X2)
| ~ product(X3,e_1,X1)
| ~ cycle(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_3,axiom,
( ~ product(X3,e_1,X1)
| ~ greater(X4,e_0)
| ~ next(X3,X2)
| equalish(X1,X2)
| ~ cycle(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_4,axiom,
( ~ cycle(X3,X4)
| ~ product(X3,e_1,X1)
| ~ greater(X4,e_0)
| ~ next(X3,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ next(X3,X5)
| ~ cycle(X5,X2)
| ~ cycle(X3,e_0)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( ~ greater(X3,X4)
| ~ greater(X1,X2)
| ~ next(X3,X5)
| ~ cycle(X5,X2)
| ~ cycle(X3,e_0)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_2,axiom,
( ~ next(X3,X5)
| ~ greater(X3,X4)
| ~ greater(X1,X2)
| ~ cycle(X5,X2)
| ~ cycle(X3,e_0)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_3,axiom,
( ~ cycle(X5,X2)
| ~ next(X3,X5)
| ~ greater(X3,X4)
| ~ greater(X1,X2)
| ~ cycle(X3,e_0)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_4,axiom,
( ~ cycle(X3,e_0)
| ~ cycle(X5,X2)
| ~ next(X3,X5)
| ~ greater(X3,X4)
| ~ greater(X1,X2)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_5,axiom,
( ~ cycle(X4,X1)
| ~ cycle(X3,e_0)
| ~ cycle(X5,X2)
| ~ next(X3,X5)
| ~ greater(X3,X4)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( ~ greater(X1,X2)
| ~ product(X2,e_1,X1)
| ~ cycle(X2,e_0) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( ~ product(X2,e_1,X1)
| ~ greater(X1,X2)
| ~ cycle(X2,e_0) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_2,axiom,
( ~ cycle(X2,e_0)
| ~ product(X2,e_1,X1)
| ~ greater(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_47_0,axiom,
( equalish(X1,X2)
| ~ next(X3,X2)
| ~ greater(X1,e_0)
| ~ next(X4,X5)
| ~ cycle(X5,X3)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_1,axiom,
( ~ next(X3,X2)
| equalish(X1,X2)
| ~ greater(X1,e_0)
| ~ next(X4,X5)
| ~ cycle(X5,X3)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_2,axiom,
( ~ greater(X1,e_0)
| ~ next(X3,X2)
| equalish(X1,X2)
| ~ next(X4,X5)
| ~ cycle(X5,X3)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_3,axiom,
( ~ next(X4,X5)
| ~ greater(X1,e_0)
| ~ next(X3,X2)
| equalish(X1,X2)
| ~ cycle(X5,X3)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_4,axiom,
( ~ cycle(X5,X3)
| ~ next(X4,X5)
| ~ greater(X1,e_0)
| ~ next(X3,X2)
| equalish(X1,X2)
| ~ cycle(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_5,axiom,
( ~ cycle(X4,X1)
| ~ cycle(X5,X3)
| ~ next(X4,X5)
| ~ greater(X1,e_0)
| ~ next(X3,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_48_0,axiom,
( equalish(X1,X2)
| ~ cycle(X3,X2)
| ~ cycle(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ cycle(X3,X2)
| equalish(X1,X2)
| ~ cycle(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ cycle(X3,X1)
| ~ cycle(X3,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( cycle(X1,e_2)
| cycle(X1,e_1)
| cycle(X1,e_0)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( cycle(X1,e_1)
| cycle(X1,e_2)
| cycle(X1,e_0)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_2,axiom,
( cycle(X1,e_0)
| cycle(X1,e_1)
| cycle(X1,e_2)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_3,axiom,
( ~ group_element(X1)
| cycle(X1,e_0)
| cycle(X1,e_1)
| cycle(X1,e_2) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_051,negated_conjecture,
! [X1,X2,X3,X4] :
( ~ product(X4,X3,X2)
| ~ product(X4,X2,X1)
| product(X1,X3,X4) ),
file('<stdin>',qg3) ).
fof(c_0_1_052,negated_conjecture,
! [X1,X2,X3,X4] :
( ~ product(X4,X3,X2)
| ~ product(X4,X2,X1)
| product(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_053,negated_conjecture,
! [X5,X6,X7,X8] :
( ~ product(X8,X7,X6)
| ~ product(X8,X6,X5)
| product(X5,X7,X8) ),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3_054,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X3,X4,X1)
| ~ product(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_055,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X3,X4,X1)
| ~ product(X3,X2,X4) ),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_60,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X0,X2,X3)
| product(X3,X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_4) ).
cnf(c_67,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X0,X2,X3)
| product(X3,X1,X0) ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_71,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X0,X2,X3)
| product(X3,X1,X0) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_72,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X0,X2,X3)
| product(X3,X1,X0) ),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_73,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X0,X2,X3)
| product(X3,X1,X0) ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_134,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X0,X2,X3)
| product(X3,X1,X0) ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_86042,plain,
( ~ product(e_2,e_3,X0)
| ~ product(e_2,e_2,e_3)
| product(X0,e_2,e_2) ),
inference(instantiation,[status(thm)],[c_134]) ).
cnf(c_225919,plain,
( ~ product(e_2,e_3,e_1)
| ~ product(e_2,e_2,e_3)
| product(e_1,e_2,e_2) ),
inference(instantiation,[status(thm)],[c_86042]) ).
cnf(c_2,plain,
( equalish(X0,X1)
| ~ product(X2,X3,X1)
| ~ product(X2,X3,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_40_2) ).
cnf(c_76,plain,
( equalish(X0,X1)
| ~ product(X2,X3,X1)
| ~ product(X2,X3,X0) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_86034,plain,
( equalish(X0,e_3)
| ~ product(e_2,e_2,e_3)
| ~ product(e_2,e_2,X0) ),
inference(instantiation,[status(thm)],[c_76]) ).
cnf(c_225839,plain,
( equalish(e_1,e_3)
| ~ product(e_2,e_2,e_3)
| ~ product(e_2,e_2,e_1) ),
inference(instantiation,[status(thm)],[c_86034]) ).
cnf(c_225760,plain,
( ~ product(e_3,e_1,e_1)
| ~ product(e_3,e_1,X0)
| product(X0,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_134]) ).
cnf(c_225814,plain,
( ~ product(e_3,e_1,e_1)
| product(e_1,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_225760]) ).
cnf(c_86059,plain,
( ~ product(e_3,e_3,X0)
| ~ product(e_3,e_2,e_3)
| product(X0,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_134]) ).
cnf(c_225796,plain,
( ~ product(e_3,e_3,e_1)
| ~ product(e_3,e_2,e_3)
| product(e_1,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_86059]) ).
cnf(c_85991,plain,
( ~ product(e_3,e_3,X0)
| ~ product(e_3,e_1,e_3)
| product(X0,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_134]) ).
cnf(c_225797,plain,
( ~ product(e_3,e_3,e_1)
| ~ product(e_3,e_1,e_3)
| product(e_1,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_85991]) ).
cnf(c_86491,plain,
( ~ product(e_3,e_2,e_1)
| ~ product(e_3,e_1,X0)
| product(X0,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_134]) ).
cnf(c_225769,plain,
( ~ product(e_3,e_2,e_1)
| ~ product(e_3,e_1,e_1)
| product(e_1,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_86491]) ).
cnf(c_225689,plain,
( ~ product(e_3,e_2,e_1)
| ~ product(e_3,e_1,e_2)
| product(e_2,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_86491]) ).
cnf(c_86526,plain,
( ~ product(e_2,e_3,e_2)
| ~ product(e_2,e_2,e_3)
| product(e_2,e_2,e_2) ),
inference(instantiation,[status(thm)],[c_86042]) ).
cnf(c_86436,plain,
( ~ product(e_3,e_3,e_2)
| ~ product(e_3,e_2,e_3)
| product(e_2,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_86059]) ).
cnf(c_86437,plain,
( ~ product(e_3,e_3,e_2)
| ~ product(e_3,e_1,e_3)
| product(e_2,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_85991]) ).
cnf(c_86329,plain,
( ~ product(e_1,e_2,e_2)
| ~ product(e_1,e_2,X0)
| product(X0,e_2,e_1) ),
inference(instantiation,[status(thm)],[c_134]) ).
cnf(c_86414,plain,
( product(e_2,e_2,e_1)
| ~ product(e_1,e_2,e_2) ),
inference(instantiation,[status(thm)],[c_86329]) ).
cnf(c_86239,plain,
( ~ product(e_3,e_2,e_2)
| ~ product(e_3,e_2,X0)
| product(X0,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_134]) ).
cnf(c_86410,plain,
( ~ product(e_3,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_86239]) ).
cnf(c_86358,plain,
( equalish(e_2,e_3)
| ~ product(e_2,e_2,e_3)
| ~ product(e_2,e_2,e_2) ),
inference(instantiation,[status(thm)],[c_86034]) ).
cnf(c_4,plain,
( ~ product(X0,X1,X2)
| equalish(X1,X3)
| ~ product(X0,X3,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_41_1) ).
cnf(c_78,plain,
( ~ product(X0,X1,X2)
| equalish(X1,X3)
| ~ product(X0,X3,X2) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_86055,plain,
( equalish(e_2,X0)
| ~ product(e_3,e_2,e_3)
| ~ product(e_3,X0,e_3) ),
inference(instantiation,[status(thm)],[c_78]) ).
cnf(c_86207,plain,
( equalish(e_2,e_3)
| ~ product(e_3,e_3,e_3)
| ~ product(e_3,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_86055]) ).
cnf(c_86038,plain,
( equalish(e_2,X0)
| ~ product(e_2,e_2,e_3)
| ~ product(e_2,X0,e_3) ),
inference(instantiation,[status(thm)],[c_78]) ).
cnf(c_86193,plain,
( equalish(e_2,e_3)
| ~ product(e_2,e_3,e_3)
| ~ product(e_2,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_86038]) ).
cnf(c_8,plain,
( equalish(X0,X1)
| ~ product(X1,X2,X3)
| ~ product(X0,X2,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_42_2) ).
cnf(c_82,plain,
( equalish(X0,X1)
| ~ product(X1,X2,X3)
| ~ product(X0,X2,X3) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_86015,plain,
( equalish(X0,e_1)
| ~ product(e_1,e_2,e_3)
| ~ product(X0,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_86162,plain,
( equalish(e_3,e_1)
| ~ product(e_3,e_2,e_3)
| ~ product(e_1,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_86015]) ).
cnf(c_85987,plain,
( equalish(e_1,X0)
| ~ product(e_3,e_1,e_3)
| ~ product(e_3,X0,e_3) ),
inference(instantiation,[status(thm)],[c_78]) ).
cnf(c_86141,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_85987]) ).
cnf(c_85981,plain,
( equalish(X0,e_2)
| ~ product(e_2,e_1,e_3)
| ~ product(X0,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_86134,plain,
( equalish(e_3,e_2)
| ~ product(e_3,e_1,e_3)
| ~ product(e_2,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_85981]) ).
cnf(c_85964,plain,
( equalish(X0,e_1)
| ~ product(e_1,e_1,e_3)
| ~ product(X0,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_86120,plain,
( equalish(e_3,e_1)
| ~ product(e_3,e_1,e_3)
| ~ product(e_1,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_85964]) ).
cnf(c_5,plain,
( equalish(X0,X1)
| ~ product(X2,X1,X3)
| ~ product(X2,X0,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_41_2) ).
cnf(c_79,plain,
( equalish(X0,X1)
| ~ product(X2,X1,X3)
| ~ product(X2,X0,X3) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_85962,plain,
( equalish(X0,e_1)
| ~ product(e_1,e_1,e_3)
| ~ product(e_1,X0,e_3) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_86119,plain,
( equalish(e_2,e_1)
| ~ product(e_1,e_2,e_3)
| ~ product(e_1,e_1,e_3) ),
inference(instantiation,[status(thm)],[c_85962]) ).
cnf(c_13,plain,
( product(X0,X1,e_3)
| product(X0,X1,e_2)
| product(X0,X1,e_1)
| ~ group_element(X1)
| ~ group_element(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_43_4) ).
cnf(c_87,plain,
( product(X0,X1,e_3)
| product(X0,X1,e_2)
| product(X0,X1,e_1)
| ~ group_element(X1)
| ~ group_element(X0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_85880,plain,
( product(X0,e_3,e_3)
| product(X0,e_3,e_2)
| product(X0,e_3,e_1)
| ~ group_element(e_3)
| ~ group_element(X0) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_85945,plain,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_1)
| ~ group_element(e_3) ),
inference(instantiation,[status(thm)],[c_85880]) ).
cnf(c_12,plain,
( ~ group_element(X0)
| product(X0,X1,e_3)
| product(X0,X1,e_2)
| product(X0,X1,e_1)
| ~ group_element(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_43_3) ).
cnf(c_86,plain,
( ~ group_element(X0)
| product(X0,X1,e_3)
| product(X0,X1,e_2)
| product(X0,X1,e_1)
| ~ group_element(X1) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_85853,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_86]) ).
cnf(c_85942,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_1)
| ~ group_element(e_3)
| ~ group_element(e_2) ),
inference(instantiation,[status(thm)],[c_85853]) ).
cnf(c_85851,plain,
( product(X0,e_2,e_3)
| product(X0,e_2,e_2)
| product(X0,e_2,e_1)
| ~ group_element(e_2)
| ~ group_element(X0) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_85939,plain,
( product(e_3,e_2,e_3)
| product(e_3,e_2,e_2)
| product(e_3,e_2,e_1)
| ~ group_element(e_3)
| ~ group_element(e_2) ),
inference(instantiation,[status(thm)],[c_85851]) ).
cnf(c_85844,plain,
( product(X0,e_1,e_3)
| product(X0,e_1,e_2)
| product(X0,e_1,e_1)
| ~ group_element(e_1)
| ~ group_element(X0) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_85933,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_85844]) ).
cnf(c_51,plain,
group_element(e_1),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_84_0) ).
cnf(c_52,plain,
group_element(e_2),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_83_0) ).
cnf(c_53,plain,
group_element(e_3),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_82_0) ).
cnf(c_55,plain,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_80_0) ).
cnf(c_56,plain,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_79_0) ).
cnf(c_57,plain,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_78_0) ).
cnf(c_58,plain,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_77_0) ).
cnf(c_59,plain,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p',c_0_76_0) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_225919,c_225839,c_225814,c_225796,c_225797,c_225769,c_225689,c_86526,c_86436,c_86437,c_86414,c_86410,c_86358,c_86207,c_86193,c_86162,c_86141,c_86134,c_86120,c_86119,c_85945,c_85942,c_85939,c_85933,c_51,c_52,c_53,c_55,c_56,c_57,c_58,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% 0.02/0.10 % Command : iprover_modulo %s %d
% 0.09/0.29 % Computer : n021.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Mon Jun 13 18:06:57 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.09/0.30 % Running in mono-core mode
% 0.14/0.36 % Orienting using strategy Equiv(ClausalAll)
% 0.14/0.36 % Orientation found
% 0.14/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_cdff6c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_dc41b9.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_dadabe | grep -v "SZS"
% 0.14/0.38
% 0.14/0.38 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.14/0.38
% 0.14/0.38 %
% 0.14/0.38 % ------ iProver source info
% 0.14/0.38
% 0.14/0.38 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.14/0.38 % git: non_committed_changes: true
% 0.14/0.38 % git: last_make_outside_of_git: true
% 0.14/0.38
% 0.14/0.38 %
% 0.14/0.38 % ------ Input Options
% 0.14/0.38
% 0.14/0.38 % --out_options all
% 0.14/0.38 % --tptp_safe_out true
% 0.14/0.38 % --problem_path ""
% 0.14/0.38 % --include_path ""
% 0.14/0.38 % --clausifier .//eprover
% 0.14/0.38 % --clausifier_options --tstp-format
% 0.14/0.38 % --stdin false
% 0.14/0.38 % --dbg_backtrace false
% 0.14/0.38 % --dbg_dump_prop_clauses false
% 0.14/0.38 % --dbg_dump_prop_clauses_file -
% 0.14/0.38 % --dbg_out_stat false
% 0.14/0.38
% 0.14/0.38 % ------ General Options
% 0.14/0.38
% 0.14/0.38 % --fof false
% 0.14/0.38 % --time_out_real 150.
% 0.14/0.38 % --time_out_prep_mult 0.2
% 0.14/0.38 % --time_out_virtual -1.
% 0.14/0.38 % --schedule none
% 0.14/0.38 % --ground_splitting input
% 0.14/0.38 % --splitting_nvd 16
% 0.14/0.38 % --non_eq_to_eq false
% 0.14/0.38 % --prep_gs_sim true
% 0.14/0.38 % --prep_unflatten false
% 0.14/0.38 % --prep_res_sim true
% 0.14/0.38 % --prep_upred true
% 0.14/0.38 % --res_sim_input true
% 0.14/0.38 % --clause_weak_htbl true
% 0.14/0.38 % --gc_record_bc_elim false
% 0.14/0.38 % --symbol_type_check false
% 0.14/0.38 % --clausify_out false
% 0.14/0.38 % --large_theory_mode false
% 0.14/0.38 % --prep_sem_filter none
% 0.14/0.38 % --prep_sem_filter_out false
% 0.14/0.38 % --preprocessed_out false
% 0.14/0.38 % --sub_typing false
% 0.14/0.38 % --brand_transform false
% 0.14/0.38 % --pure_diseq_elim true
% 0.14/0.38 % --min_unsat_core false
% 0.14/0.38 % --pred_elim true
% 0.14/0.38 % --add_important_lit false
% 0.14/0.38 % --soft_assumptions false
% 0.14/0.38 % --reset_solvers false
% 0.14/0.38 % --bc_imp_inh []
% 0.14/0.38 % --conj_cone_tolerance 1.5
% 0.14/0.38 % --prolific_symb_bound 500
% 0.14/0.38 % --lt_threshold 2000
% 0.14/0.38
% 0.14/0.38 % ------ SAT Options
% 0.14/0.38
% 0.14/0.38 % --sat_mode false
% 0.14/0.38 % --sat_fm_restart_options ""
% 0.14/0.38 % --sat_gr_def false
% 0.14/0.38 % --sat_epr_types true
% 0.14/0.38 % --sat_non_cyclic_types false
% 0.14/0.38 % --sat_finite_models false
% 0.14/0.38 % --sat_fm_lemmas false
% 0.14/0.38 % --sat_fm_prep false
% 0.14/0.38 % --sat_fm_uc_incr true
% 0.14/0.38 % --sat_out_model small
% 0.14/0.38 % --sat_out_clauses false
% 0.14/0.38
% 0.14/0.38 % ------ QBF Options
% 0.14/0.38
% 0.14/0.38 % --qbf_mode false
% 0.14/0.38 % --qbf_elim_univ true
% 0.14/0.38 % --qbf_sk_in true
% 0.14/0.38 % --qbf_pred_elim true
% 0.14/0.38 % --qbf_split 32
% 0.14/0.38
% 0.14/0.38 % ------ BMC1 Options
% 0.14/0.38
% 0.14/0.38 % --bmc1_incremental false
% 0.14/0.38 % --bmc1_axioms reachable_all
% 0.14/0.38 % --bmc1_min_bound 0
% 0.14/0.38 % --bmc1_max_bound -1
% 0.14/0.38 % --bmc1_max_bound_default -1
% 0.14/0.38 % --bmc1_symbol_reachability true
% 0.14/0.38 % --bmc1_property_lemmas false
% 0.14/0.38 % --bmc1_k_induction false
% 0.14/0.38 % --bmc1_non_equiv_states false
% 0.14/0.38 % --bmc1_deadlock false
% 0.14/0.38 % --bmc1_ucm false
% 0.14/0.38 % --bmc1_add_unsat_core none
% 0.14/0.38 % --bmc1_unsat_core_children false
% 0.14/0.38 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.38 % --bmc1_out_stat full
% 0.14/0.38 % --bmc1_ground_init false
% 0.14/0.38 % --bmc1_pre_inst_next_state false
% 0.14/0.38 % --bmc1_pre_inst_state false
% 0.14/0.38 % --bmc1_pre_inst_reach_state false
% 0.14/0.38 % --bmc1_out_unsat_core false
% 0.14/0.38 % --bmc1_aig_witness_out false
% 0.14/0.38 % --bmc1_verbose false
% 0.14/0.38 % --bmc1_dump_clauses_tptp false
% 0.14/0.38 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.38 % --bmc1_dump_file -
% 0.14/0.38 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.38 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.38 % --bmc1_ucm_extend_mode 1
% 0.14/0.38 % --bmc1_ucm_init_mode 2
% 0.14/0.38 % --bmc1_ucm_cone_mode none
% 0.14/0.38 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.38 % --bmc1_ucm_relax_model 4
% 0.14/0.38 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.38 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.38 % --bmc1_ucm_layered_model none
% 0.14/0.38 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.38
% 0.14/0.38 % ------ AIG Options
% 0.14/0.38
% 0.14/0.38 % --aig_mode false
% 0.14/0.38
% 0.14/0.38 % ------ Instantiation Options
% 0.14/0.38
% 0.14/0.38 % --instantiation_flag true
% 0.14/0.38 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.38 % --inst_solver_per_active 750
% 0.14/0.38 % --inst_solver_calls_frac 0.5
% 0.14/0.38 % --inst_passive_queue_type priority_queues
% 0.14/0.38 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.38 % --inst_passive_queues_freq [25;2]
% 0.14/0.38 % --inst_dismatching true
% 0.14/0.38 % --inst_eager_unprocessed_to_passive true
% 0.14/0.38 % --inst_prop_sim_given true
% 0.14/0.38 % --inst_prop_sim_new false
% 0.14/0.38 % --inst_orphan_elimination true
% 0.14/0.38 % --inst_learning_loop_flag true
% 0.14/0.38 % --inst_learning_start 3000
% 0.14/0.38 % --inst_learning_factor 2
% 0.14/0.38 % --inst_start_prop_sim_after_learn 3
% 0.14/0.38 % --inst_sel_renew solver
% 0.14/0.38 % --inst_lit_activity_flag true
% 0.14/0.38 % --inst_out_proof true
% 0.14/0.38
% 0.14/0.38 % ------ Resolution Options
% 0.14/0.38
% 0.14/0.38 % --resolution_flag true
% 0.14/0.38 % --res_lit_sel kbo_max
% 0.14/0.38 % --res_to_prop_solver none
% 0.14/0.38 % --res_prop_simpl_new false
% 0.14/0.38 % --res_prop_simpl_given false
% 0.14/0.38 % --res_passive_queue_type priority_queues
% 0.14/0.38 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.38 % --res_passive_queues_freq [15;5]
% 0.14/0.38 % --res_forward_subs full
% 0.14/0.38 % --res_backward_subs full
% 0.14/0.38 % --res_forward_subs_resolution true
% 0.14/0.38 % --res_backward_subs_resolution true
% 0.14/0.38 % --res_orphan_elimination false
% 0.14/0.38 % --res_time_limit 1000.
% 0.14/0.38 % --res_out_proof true
% 0.14/0.38 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cdff6c.s
% 0.14/0.38 % --modulo true
% 0.14/0.38
% 0.14/0.38 % ------ Combination Options
% 0.14/0.38
% 0.14/0.38 % --comb_res_mult 1000
% 0.14/0.38 % --comb_inst_mult 300
% 0.14/0.38 % ------
% 0.14/0.38
% 0.14/0.38 % ------ Parsing...% successful
% 0.14/0.38
% 0.14/0.38 % ------ 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.38
% 0.14/0.38 % ------ Proving...
% 0.14/0.38 % ------ Problem Properties
% 0.14/0.38
% 0.14/0.38 %
% 0.14/0.38 % EPR true
% 0.14/0.38 % Horn false
% 0.14/0.38 % Has equality false
% 0.14/0.38
% 0.14/0.38 % % ------ Input Options Time Limit: Unbounded
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % % ------ Current options:
% 0.14/0.38
% 0.14/0.38 % ------ Input Options
% 0.14/0.38
% 0.14/0.38 % --out_options all
% 0.14/0.38 % --tptp_safe_out true
% 0.14/0.38 % --problem_path ""
% 0.14/0.38 % --include_path ""
% 0.14/0.38 % --clausifier .//eprover
% 0.14/0.38 % --clausifier_options --tstp-format
% 0.14/0.38 % --stdin false
% 0.14/0.38 % --dbg_backtrace false
% 0.14/0.38 % --dbg_dump_prop_clauses false
% 0.14/0.38 % --dbg_dump_prop_clauses_file -
% 0.14/0.38 % --dbg_out_stat false
% 0.14/0.38
% 0.14/0.38 % ------ General Options
% 0.14/0.38
% 0.14/0.38 % --fof false
% 0.14/0.38 % --time_out_real 150.
% 0.14/0.38 % --time_out_prep_mult 0.2
% 0.14/0.38 % --time_out_virtual -1.
% 0.14/0.38 % --schedule none
% 0.14/0.38 % --ground_splitting input
% 0.14/0.38 % --splitting_nvd 16
% 0.14/0.38 % --non_eq_to_eq false
% 0.14/0.38 % --prep_gs_sim true
% 0.14/0.38 % --prep_unflatten false
% 0.14/0.38 % --prep_res_sim true
% 0.14/0.38 % --prep_upred true
% 0.14/0.38 % --res_sim_input true
% 0.14/0.38 % --clause_weak_htbl true
% 0.14/0.38 % --gc_record_bc_elim false
% 0.14/0.38 % --symbol_type_check false
% 0.14/0.38 % --clausify_out false
% 0.14/0.38 % --large_theory_mode false
% 0.14/0.38 % --prep_sem_filter none
% 0.14/0.38 % --prep_sem_filter_out false
% 0.14/0.38 % --preprocessed_out false
% 0.14/0.38 % --sub_typing false
% 0.14/0.38 % --brand_transform false
% 0.14/0.38 % --pure_diseq_elim true
% 0.14/0.38 % --min_unsat_core false
% 0.14/0.38 % --pred_elim true
% 0.14/0.38 % --add_important_lit false
% 0.14/0.38 % --soft_assumptions false
% 0.14/0.38 % --reset_solvers false
% 0.14/0.38 % --bc_imp_inh []
% 0.14/0.38 % --conj_cone_tolerance 1.5
% 0.14/0.38 % --prolific_symb_bound 500
% 0.14/0.38 % --lt_threshold 2000
% 0.14/0.38
% 0.14/0.38 % ------ SAT Options
% 0.14/0.38
% 0.14/0.38 % --sat_mode false
% 0.14/0.38 % --sat_fm_restart_options ""
% 0.14/0.38 % --sat_gr_def false
% 0.14/0.38 % --sat_epr_types true
% 0.14/0.38 % --sat_non_cyclic_types false
% 0.14/0.38 % --sat_finite_models false
% 0.14/0.38 % --sat_fm_lemmas false
% 0.14/0.38 % --sat_fm_prep false
% 0.14/0.38 % --sat_fm_uc_incr true
% 0.14/0.38 % --sat_out_model small
% 0.14/0.38 % --sat_out_clauses false
% 0.14/0.38
% 0.14/0.38 % ------ QBF Options
% 0.14/0.38
% 0.14/0.38 % --qbf_mode false
% 0.14/0.38 % --qbf_elim_univ true
% 0.14/0.38 % --qbf_sk_in true
% 0.14/0.38 % --qbf_pred_elim true
% 0.14/0.38 % --qbf_split 32
% 0.14/0.38
% 0.14/0.38 % ------ BMC1 Options
% 0.14/0.38
% 0.14/0.38 % --bmc1_incremental false
% 0.14/0.38 % --bmc1_axioms reachable_all
% 0.14/0.38 % --bmc1_min_bound 0
% 0.14/0.38 % --bmc1_max_bound -1
% 0.14/0.38 % --bmc1_max_bound_default -1
% 0.14/0.38 % --bmc1_symbol_reachability true
% 0.14/0.38 % --bmc1_property_lemmas false
% 0.14/0.38 % --bmc1_k_induction false
% 0.14/0.38 % --bmc1_non_equiv_states false
% 0.14/0.38 % --bmc1_deadlock false
% 0.14/0.38 % --bmc1_ucm false
% 0.14/0.38 % --bmc1_add_unsat_core none
% 0.14/0.38 % --bmc1_unsat_core_children false
% 0.14/0.38 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.38 % --bmc1_out_stat full
% 0.14/0.38 % --bmc1_ground_init false
% 0.14/0.38 % --bmc1_pre_inst_next_state false
% 0.14/0.38 % --bmc1_pre_inst_state false
% 0.14/0.38 % --bmc1_pre_inst_reach_state false
% 0.14/0.38 % --bmc1_out_unsat_core false
% 0.14/0.38 % --bmc1_aig_witness_out false
% 0.14/0.38 % --bmc1_verbose false
% 0.14/0.38 % --bmc1_dump_clauses_tptp false
% 0.14/0.38 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.38 % --bmc1_dump_file -
% 0.14/0.38 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.38 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.38 % --bmc1_ucm_extend_mode 1
% 0.14/0.38 % --bmc1_ucm_init_mode 2
% 0.14/0.38 % --bmc1_ucm_cone_mode none
% 0.14/0.38 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.38 % --bmc1_ucm_relax_model 4
% 0.14/0.38 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.38 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.38 % --bmc1_ucm_layered_model none
% 0.14/0.38 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.38
% 0.14/0.38 % ------ AIG Options
% 0.14/0.38
% 0.14/0.38 % --aig_mode false
% 0.14/0.38
% 0.14/0.38 % ------ Instantiation Options
% 0.14/0.38
% 0.14/0.38 % --instantiation_flag true
% 0.14/0.38 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.38 % --inst_solver_per_active 750
% 0.14/0.38 % --inst_solver_calls_frac 0.5
% 0.14/0.38 % --inst_passive_queue_type priority_queues
% 0.14/0.38 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.38 % --inst_passive_queues_freq [25;2]
% 0.14/0.38 % --inst_dismatching true
% 0.14/0.38 % --inst_eager_unprocessed_to_passive true
% 0.14/0.38 % --inst_prop_sim_given true
% 5.20/5.45 % --inst_prop_sim_new false
% 5.20/5.45 % --inst_orphan_elimination true
% 5.20/5.45 % --inst_learning_loop_flag true
% 5.20/5.45 % --inst_learning_start 3000
% 5.20/5.45 % --inst_learning_factor 2
% 5.20/5.45 % --inst_start_prop_sim_after_learn 3
% 5.20/5.45 % --inst_sel_renew solver
% 5.20/5.45 % --inst_lit_activity_flag true
% 5.20/5.45 % --inst_out_proof true
% 5.20/5.45
% 5.20/5.45 % ------ Resolution Options
% 5.20/5.45
% 5.20/5.45 % --resolution_flag true
% 5.20/5.45 % --res_lit_sel kbo_max
% 5.20/5.45 % --res_to_prop_solver none
% 5.20/5.45 % --res_prop_simpl_new false
% 5.20/5.45 % --res_prop_simpl_given false
% 5.20/5.45 % --res_passive_queue_type priority_queues
% 5.20/5.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.20/5.45 % --res_passive_queues_freq [15;5]
% 5.20/5.45 % --res_forward_subs full
% 5.20/5.45 % --res_backward_subs full
% 5.20/5.45 % --res_forward_subs_resolution true
% 5.20/5.45 % --res_backward_subs_resolution true
% 5.20/5.45 % --res_orphan_elimination false
% 5.20/5.45 % --res_time_limit 1000.
% 5.20/5.45 % --res_out_proof true
% 5.20/5.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cdff6c.s
% 5.20/5.45 % --modulo true
% 5.20/5.45
% 5.20/5.45 % ------ Combination Options
% 5.20/5.45
% 5.20/5.45 % --comb_res_mult 1000
% 5.20/5.45 % --comb_inst_mult 300
% 5.20/5.45 % ------
% 5.20/5.45
% 5.20/5.45
% 5.20/5.45
% 5.20/5.45 % ------ Proving...
% 5.20/5.45 %
% 5.20/5.45
% 5.20/5.45
% 5.20/5.45 % ------ Statistics
% 5.20/5.45
% 5.20/5.45 % ------ General
% 5.20/5.45
% 5.20/5.45 % num_of_input_clauses: 61
% 5.20/5.45 % num_of_input_neg_conjectures: 1
% 5.20/5.45 % num_of_splits: 0
% 5.20/5.45 % num_of_split_atoms: 0
% 5.20/5.45 % num_of_sem_filtered_clauses: 0
% 5.20/5.45 % num_of_subtypes: 0
% 5.20/5.45 % monotx_restored_types: 0
% 5.20/5.45 % sat_num_of_epr_types: 0
% 5.20/5.45 % sat_num_of_non_cyclic_types: 0
% 5.20/5.45 % sat_guarded_non_collapsed_types: 0
% 5.20/5.45 % is_epr: 1
% 5.20/5.45 % is_horn: 0
% 5.20/5.45 % has_eq: 0
% 5.20/5.45 % num_pure_diseq_elim: 0
% 5.20/5.45 % simp_replaced_by: 0
% 5.20/5.45 % res_preprocessed: 2
% 5.20/5.45 % prep_upred: 0
% 5.20/5.45 % prep_unflattend: 0
% 5.20/5.45 % pred_elim_cands: 0
% 5.20/5.45 % pred_elim: 0
% 5.20/5.45 % pred_elim_cl: 0
% 5.20/5.45 % pred_elim_cycles: 0
% 5.20/5.45 % forced_gc_time: 0
% 5.20/5.45 % gc_basic_clause_elim: 0
% 5.20/5.45 % parsing_time: 0.001
% 5.20/5.45 % sem_filter_time: 0.
% 5.20/5.45 % pred_elim_time: 0.
% 5.20/5.45 % out_proof_time: 0.001
% 5.20/5.45 % monotx_time: 0.
% 5.20/5.45 % subtype_inf_time: 0.
% 5.20/5.45 % unif_index_cands_time: 0.011
% 5.20/5.45 % unif_index_add_time: 0.003
% 5.20/5.45 % total_time: 5.082
% 5.20/5.45 % num_of_symbols: 35
% 5.20/5.45 % num_of_terms: 749
% 5.20/5.45
% 5.20/5.45 % ------ Propositional Solver
% 5.20/5.45
% 5.20/5.45 % prop_solver_calls: 10
% 5.20/5.45 % prop_fast_solver_calls: 9
% 5.20/5.45 % prop_num_of_clauses: 783
% 5.20/5.45 % prop_preprocess_simplified: 1059
% 5.20/5.45 % prop_fo_subsumed: 0
% 5.20/5.45 % prop_solver_time: 0.
% 5.20/5.45 % prop_fast_solver_time: 0.
% 5.20/5.45 % prop_unsat_core_time: 0.
% 5.20/5.45
% 5.20/5.45 % ------ QBF
% 5.20/5.45
% 5.20/5.45 % qbf_q_res: 0
% 5.20/5.45 % qbf_num_tautologies: 0
% 5.20/5.45 % qbf_prep_cycles: 0
% 5.20/5.45
% 5.20/5.45 % ------ BMC1
% 5.20/5.45
% 5.20/5.45 % bmc1_current_bound: -1
% 5.20/5.45 % bmc1_last_solved_bound: -1
% 5.20/5.45 % bmc1_unsat_core_size: -1
% 5.20/5.45 % bmc1_unsat_core_parents_size: -1
% 5.20/5.45 % bmc1_merge_next_fun: 0
% 5.20/5.45 % bmc1_unsat_core_clauses_time: 0.
% 5.20/5.45
% 5.20/5.45 % ------ Instantiation
% 5.20/5.45
% 5.20/5.45 % inst_num_of_clauses: 570
% 5.20/5.45 % inst_num_in_passive: 67
% 5.20/5.45 % inst_num_in_active: 488
% 5.20/5.45 % inst_num_in_unprocessed: 4
% 5.20/5.45 % inst_num_of_loops: 554
% 5.20/5.45 % inst_num_of_learning_restarts: 0
% 5.20/5.45 % inst_num_moves_active_passive: 49
% 5.20/5.45 % inst_lit_activity: 199
% 5.20/5.45 % inst_lit_activity_moves: 0
% 5.20/5.45 % inst_num_tautologies: 11
% 5.20/5.45 % inst_num_prop_implied: 0
% 5.20/5.45 % inst_num_existing_simplified: 0
% 5.20/5.45 % inst_num_eq_res_simplified: 0
% 5.20/5.45 % inst_num_child_elim: 0
% 5.20/5.45 % inst_num_of_dismatching_blockings: 0
% 5.20/5.45 % inst_num_of_non_proper_insts: 503
% 5.20/5.45 % inst_num_of_duplicates: 327
% 5.20/5.45 % inst_inst_num_from_inst_to_res: 0
% 5.20/5.45 % inst_dismatching_checking_time: 0.
% 5.20/5.45
% 5.20/5.45 % ------ Resolution
% 5.20/5.45
% 5.20/5.45 % res_num_of_clauses: 49489
% 5.20/5.45 % res_num_in_passive: 51179
% 5.20/5.45 % res_num_in_active: 830
% 5.20/5.45 % res_num_of_loops: 2000
% 5.20/5.45 % res_forward_subset_subsumed: 47661
% 5.20/5.45 % res_backward_subset_subsumed: 2890
% 5.20/5.45 % res_forward_subsumed: 971
% 5.20/5.45 % res_backward_subsumed: 127
% 5.20/5.45 % res_forward_subsumption_resolution: 309
% 5.20/5.45 % res_backward_subsumption_resolution: 34
% 5.20/5.45 % res_clause_to_clause_subsumption: 115456
% 5.20/5.45 % res_orphan_elimination: 0
% 5.20/5.45 % res_tautology_del: 4603
% 5.20/5.45 % res_num_eq_res_simplified: 0
% 5.20/5.45 % res_num_sel_changes: 0
% 5.20/5.45 % res_moves_from_active_to_pass: 0
% 5.20/5.45
% 5.20/5.45 % Status Unsatisfiable
% 5.20/5.45 % SZS status Unsatisfiable
% 5.20/5.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------