TSTP Solution File: RNG040-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : RNG040-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 20:30:11 EDT 2022
% Result : Unsatisfiable 1.52s 1.73s
% Output : CNFRefutation 1.59s
% 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(additive_inverse2,axiom,
sum(X,additive_inverse(X),additive_identity),
input ).
fof(additive_inverse2_0,plain,
! [X] :
( sum(X,additive_inverse(X),additive_identity)
| $false ),
inference(orientation,[status(thm)],[additive_inverse2]) ).
cnf(additive_inverse1,axiom,
sum(additive_inverse(X),X,additive_identity),
input ).
fof(additive_inverse1_0,plain,
! [X] :
( sum(additive_inverse(X),X,additive_identity)
| $false ),
inference(orientation,[status(thm)],[additive_inverse1]) ).
cnf(closure_of_addition,axiom,
sum(X,Y,add(X,Y)),
input ).
fof(closure_of_addition_0,plain,
! [X,Y] :
( sum(X,Y,add(X,Y))
| $false ),
inference(orientation,[status(thm)],[closure_of_addition]) ).
cnf(closure_of_multiplication,axiom,
product(X,Y,multiply(X,Y)),
input ).
fof(closure_of_multiplication_0,plain,
! [X,Y] :
( product(X,Y,multiply(X,Y))
| $false ),
inference(orientation,[status(thm)],[closure_of_multiplication]) ).
cnf(additive_identity2,axiom,
sum(X,additive_identity,X),
input ).
fof(additive_identity2_0,plain,
! [X] :
( sum(X,additive_identity,X)
| $false ),
inference(orientation,[status(thm)],[additive_identity2]) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X,X),
input ).
fof(additive_identity1_0,plain,
! [X] :
( sum(additive_identity,X,X)
| $false ),
inference(orientation,[status(thm)],[additive_identity1]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> sum(additive_identity,X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[additive_identity1_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X] :
( lhs_atom2(X)
<=> sum(X,additive_identity,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X] :
( lhs_atom2(X)
| $false ),
inference(fold_definition,[status(thm)],[additive_identity2_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [Y,X] :
( lhs_atom3(Y,X)
<=> product(X,Y,multiply(X,Y)) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [X,Y] :
( lhs_atom3(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[closure_of_multiplication_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [Y,X] :
( lhs_atom4(Y,X)
<=> sum(X,Y,add(X,Y)) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [X,Y] :
( lhs_atom4(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[closure_of_addition_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [X] :
( lhs_atom5(X)
<=> sum(additive_inverse(X),X,additive_identity) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [X] :
( lhs_atom5(X)
| $false ),
inference(fold_definition,[status(thm)],[additive_inverse1_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [X] :
( lhs_atom6(X)
<=> sum(X,additive_inverse(X),additive_identity) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [X] :
( lhs_atom6(X)
| $false ),
inference(fold_definition,[status(thm)],[additive_inverse2_0,def_lhs_atom6]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X1] :
( lhs_atom4(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_1,axiom,
! [X2,X1] :
( lhs_atom3(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_2,axiom,
! [X1] :
( lhs_atom6(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_3,axiom,
! [X1] :
( lhs_atom5(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_4,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_5,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_6,plain,
! [X2,X1] : lhs_atom4(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_7,plain,
! [X2,X1] : lhs_atom3(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_8,plain,
! [X1] : lhs_atom6(X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_9,plain,
! [X1] : lhs_atom5(X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_10,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X3,X4] : lhs_atom4(X3,X4),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X3,X4] : lhs_atom3(X3,X4),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X2] : lhs_atom6(X2),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X2] : lhs_atom5(X2),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
lhs_atom4(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
lhs_atom3(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
lhs_atom6(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
lhs_atom5(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
lhs_atom4(X1,X2),
c_0_18,
[final] ).
cnf(c_0_25,plain,
lhs_atom3(X1,X2),
c_0_19,
[final] ).
cnf(c_0_26,plain,
lhs_atom6(X1),
c_0_20,
[final] ).
cnf(c_0_27,plain,
lhs_atom5(X1),
c_0_21,
[final] ).
cnf(c_0_28,plain,
lhs_atom2(X1),
c_0_22,
[final] ).
cnf(c_0_29,plain,
lhs_atom1(X1),
c_0_23,
[final] ).
% End CNF derivation
cnf(c_0_24_0,axiom,
sum(X2,X1,add(X2,X1)),
inference(unfold_definition,[status(thm)],[c_0_24,def_lhs_atom4]) ).
cnf(c_0_25_0,axiom,
product(X2,X1,multiply(X2,X1)),
inference(unfold_definition,[status(thm)],[c_0_25,def_lhs_atom3]) ).
cnf(c_0_26_0,axiom,
sum(X1,additive_inverse(X1),additive_identity),
inference(unfold_definition,[status(thm)],[c_0_26,def_lhs_atom6]) ).
cnf(c_0_27_0,axiom,
sum(additive_inverse(X1),X1,additive_identity),
inference(unfold_definition,[status(thm)],[c_0_27,def_lhs_atom5]) ).
cnf(c_0_28_0,axiom,
sum(X1,additive_identity,X1),
inference(unfold_definition,[status(thm)],[c_0_28,def_lhs_atom2]) ).
cnf(c_0_29_0,axiom,
sum(additive_identity,X1,X1),
inference(unfold_definition,[status(thm)],[c_0_29,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X5,X1,X2,X6,X7,X8,X9] :
( ~ product(X2,X1,X9)
| ~ product(X2,X5,X8)
| ~ sum(X1,X5,X7)
| ~ product(X2,X7,X6)
| sum(X9,X8,X6) ),
file('<stdin>',distributivity1) ).
fof(c_0_1_002,axiom,
! [X5,X1,X2,X6,X7,X8,X9] :
( ~ product(X2,X1,X9)
| ~ product(X2,X5,X8)
| ~ sum(X1,X5,X7)
| ~ sum(X9,X8,X6)
| product(X2,X7,X6) ),
file('<stdin>',distributivity2) ).
fof(c_0_2_003,axiom,
! [X5,X1,X2,X10,X3,X4] :
( ~ sum(X2,X1,X4)
| ~ sum(X1,X5,X3)
| ~ sum(X4,X5,X10)
| sum(X2,X3,X10) ),
file('<stdin>',associativity_of_addition1) ).
fof(c_0_3_004,axiom,
! [X5,X1,X2,X10,X3,X4] :
( ~ sum(X2,X1,X4)
| ~ sum(X1,X5,X3)
| ~ sum(X2,X3,X10)
| sum(X4,X5,X10) ),
file('<stdin>',associativity_of_addition2) ).
fof(c_0_4_005,axiom,
! [X5,X1,X2,X10,X3,X4] :
( ~ product(X2,X1,X4)
| ~ product(X1,X5,X3)
| ~ product(X4,X5,X10)
| product(X2,X3,X10) ),
file('<stdin>',associativity_of_multiplication1) ).
fof(c_0_5_006,axiom,
! [X5,X1,X2,X10,X3,X4] :
( ~ product(X2,X1,X4)
| ~ product(X1,X5,X3)
| ~ product(X2,X3,X10)
| product(X4,X5,X10) ),
file('<stdin>',associativity_of_multiplication2) ).
fof(c_0_6_007,axiom,
! [X1,X2,X3,X4] :
( ~ sum(X2,X1,X4)
| ~ sum(X2,X1,X3)
| X4 = X3 ),
file('<stdin>',addition_is_well_defined) ).
fof(c_0_7_008,axiom,
! [X1,X2,X3,X4] :
( ~ product(X2,X1,X4)
| ~ product(X2,X1,X3)
| X4 = X3 ),
file('<stdin>',multiplication_is_well_defined) ).
fof(c_0_8_009,axiom,
! [X5,X1,X2] :
( ~ sum(X2,X1,X5)
| sum(X1,X2,X5) ),
file('<stdin>',commutativity_of_addition) ).
fof(c_0_9_010,plain,
! [X5,X1,X2,X6,X7,X8,X9] :
( ~ product(X2,X1,X9)
| ~ product(X2,X5,X8)
| ~ sum(X1,X5,X7)
| ~ product(X2,X7,X6)
| sum(X9,X8,X6) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_10_011,plain,
! [X5,X1,X2,X6,X7,X8,X9] :
( ~ product(X2,X1,X9)
| ~ product(X2,X5,X8)
| ~ sum(X1,X5,X7)
| ~ sum(X9,X8,X6)
| product(X2,X7,X6) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_11_012,plain,
! [X5,X1,X2,X10,X3,X4] :
( ~ sum(X2,X1,X4)
| ~ sum(X1,X5,X3)
| ~ sum(X4,X5,X10)
| sum(X2,X3,X10) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_12_013,plain,
! [X5,X1,X2,X10,X3,X4] :
( ~ sum(X2,X1,X4)
| ~ sum(X1,X5,X3)
| ~ sum(X2,X3,X10)
| sum(X4,X5,X10) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_13_014,plain,
! [X5,X1,X2,X10,X3,X4] :
( ~ product(X2,X1,X4)
| ~ product(X1,X5,X3)
| ~ product(X4,X5,X10)
| product(X2,X3,X10) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_14_015,plain,
! [X5,X1,X2,X10,X3,X4] :
( ~ product(X2,X1,X4)
| ~ product(X1,X5,X3)
| ~ product(X2,X3,X10)
| product(X4,X5,X10) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_15_016,plain,
! [X1,X2,X3,X4] :
( ~ sum(X2,X1,X4)
| ~ sum(X2,X1,X3)
| X4 = X3 ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_16_017,plain,
! [X1,X2,X3,X4] :
( ~ product(X2,X1,X4)
| ~ product(X2,X1,X3)
| X4 = X3 ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_17_018,plain,
! [X5,X1,X2] :
( ~ sum(X2,X1,X5)
| sum(X1,X2,X5) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_18_019,plain,
! [X10,X11,X12,X13,X14,X15,X16] :
( ~ product(X12,X11,X16)
| ~ product(X12,X10,X15)
| ~ sum(X11,X10,X14)
| ~ product(X12,X14,X13)
| sum(X16,X15,X13) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_19_020,plain,
! [X10,X11,X12,X13,X14,X15,X16] :
( ~ product(X12,X11,X16)
| ~ product(X12,X10,X15)
| ~ sum(X11,X10,X14)
| ~ sum(X16,X15,X13)
| product(X12,X14,X13) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_20_021,plain,
! [X11,X12,X13,X14,X15,X16] :
( ~ sum(X13,X12,X16)
| ~ sum(X12,X11,X15)
| ~ sum(X16,X11,X14)
| sum(X13,X15,X14) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_21_022,plain,
! [X11,X12,X13,X14,X15,X16] :
( ~ sum(X13,X12,X16)
| ~ sum(X12,X11,X15)
| ~ sum(X13,X15,X14)
| sum(X16,X11,X14) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_22_023,plain,
! [X11,X12,X13,X14,X15,X16] :
( ~ product(X13,X12,X16)
| ~ product(X12,X11,X15)
| ~ product(X16,X11,X14)
| product(X13,X15,X14) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_23_024,plain,
! [X11,X12,X13,X14,X15,X16] :
( ~ product(X13,X12,X16)
| ~ product(X12,X11,X15)
| ~ product(X13,X15,X14)
| product(X16,X11,X14) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_24_025,plain,
! [X5,X6,X7,X8] :
( ~ sum(X6,X5,X8)
| ~ sum(X6,X5,X7)
| X8 = X7 ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_25_026,plain,
! [X5,X6,X7,X8] :
( ~ product(X6,X5,X8)
| ~ product(X6,X5,X7)
| X8 = X7 ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_26_027,plain,
! [X6,X7,X8] :
( ~ sum(X8,X7,X6)
| sum(X7,X8,X6) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
cnf(c_0_27_028,plain,
( sum(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ sum(X6,X7,X5)
| ~ product(X4,X7,X2)
| ~ product(X4,X6,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28_029,plain,
( product(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X7,X2)
| ~ product(X1,X7,X5)
| ~ product(X1,X6,X4) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29_030,plain,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X5,X2)
| ~ sum(X1,X6,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X2,X5)
| ~ sum(X4,X6,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ sum(X3,X4,X2)
| ~ sum(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( sum(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ sum(X6,X7,X5)
| ~ product(X4,X7,X2)
| ~ product(X4,X6,X1) ),
c_0_27,
[final] ).
cnf(c_0_37,plain,
( product(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X7,X2)
| ~ product(X1,X7,X5)
| ~ product(X1,X6,X4) ),
c_0_28,
[final] ).
cnf(c_0_38,plain,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X5,X2)
| ~ sum(X1,X6,X4) ),
c_0_29,
[final] ).
cnf(c_0_39,plain,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X2,X5)
| ~ sum(X4,X6,X1) ),
c_0_30,
[final] ).
cnf(c_0_40,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
c_0_31,
[final] ).
cnf(c_0_41,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
c_0_32,
[final] ).
cnf(c_0_42,plain,
( X1 = X2
| ~ sum(X3,X4,X2)
| ~ sum(X3,X4,X1) ),
c_0_33,
[final] ).
cnf(c_0_43,plain,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
c_0_34,
[final] ).
cnf(c_0_44,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
c_0_35,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_36_0,axiom,
( sum(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ sum(X6,X7,X5)
| ~ product(X4,X7,X2)
| ~ product(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_1,axiom,
( ~ product(X4,X5,X3)
| sum(X1,X2,X3)
| ~ sum(X6,X7,X5)
| ~ product(X4,X7,X2)
| ~ product(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_2,axiom,
( ~ sum(X6,X7,X5)
| ~ product(X4,X5,X3)
| sum(X1,X2,X3)
| ~ product(X4,X7,X2)
| ~ product(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_3,axiom,
( ~ product(X4,X7,X2)
| ~ sum(X6,X7,X5)
| ~ product(X4,X5,X3)
| sum(X1,X2,X3)
| ~ product(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_4,axiom,
( ~ product(X4,X6,X1)
| ~ product(X4,X7,X2)
| ~ sum(X6,X7,X5)
| ~ product(X4,X5,X3)
| sum(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_37_0,axiom,
( product(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X7,X2)
| ~ product(X1,X7,X5)
| ~ product(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_1,axiom,
( ~ sum(X4,X5,X3)
| product(X1,X2,X3)
| ~ sum(X6,X7,X2)
| ~ product(X1,X7,X5)
| ~ product(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_2,axiom,
( ~ sum(X6,X7,X2)
| ~ sum(X4,X5,X3)
| product(X1,X2,X3)
| ~ product(X1,X7,X5)
| ~ product(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_3,axiom,
( ~ product(X1,X7,X5)
| ~ sum(X6,X7,X2)
| ~ sum(X4,X5,X3)
| product(X1,X2,X3)
| ~ product(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_4,axiom,
( ~ product(X1,X6,X4)
| ~ product(X1,X7,X5)
| ~ sum(X6,X7,X2)
| ~ sum(X4,X5,X3)
| product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_38_0,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X5,X2)
| ~ sum(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_1,axiom,
( ~ sum(X4,X5,X3)
| sum(X1,X2,X3)
| ~ sum(X6,X5,X2)
| ~ sum(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_2,axiom,
( ~ sum(X6,X5,X2)
| ~ sum(X4,X5,X3)
| sum(X1,X2,X3)
| ~ sum(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_3,axiom,
( ~ sum(X1,X6,X4)
| ~ sum(X6,X5,X2)
| ~ sum(X4,X5,X3)
| sum(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_39_0,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X3)
| ~ sum(X6,X2,X5)
| ~ sum(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_1,axiom,
( ~ sum(X4,X5,X3)
| sum(X1,X2,X3)
| ~ sum(X6,X2,X5)
| ~ sum(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_2,axiom,
( ~ sum(X6,X2,X5)
| ~ sum(X4,X5,X3)
| sum(X1,X2,X3)
| ~ sum(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_3,axiom,
( ~ sum(X4,X6,X1)
| ~ sum(X6,X2,X5)
| ~ sum(X4,X5,X3)
| sum(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_40_0,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_1,axiom,
( ~ product(X4,X5,X3)
| product(X1,X2,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_2,axiom,
( ~ product(X6,X5,X2)
| ~ product(X4,X5,X3)
| product(X1,X2,X3)
| ~ product(X1,X6,X4) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_3,axiom,
( ~ product(X1,X6,X4)
| ~ product(X6,X5,X2)
| ~ product(X4,X5,X3)
| product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_41_0,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_41_1,axiom,
( ~ product(X4,X5,X3)
| product(X1,X2,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_41_2,axiom,
( ~ product(X6,X2,X5)
| ~ product(X4,X5,X3)
| product(X1,X2,X3)
| ~ product(X4,X6,X1) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_41_3,axiom,
( ~ product(X4,X6,X1)
| ~ product(X6,X2,X5)
| ~ product(X4,X5,X3)
| product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_42_0,axiom,
( X1 = X2
| ~ sum(X3,X4,X2)
| ~ sum(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_1,axiom,
( ~ sum(X3,X4,X2)
| X1 = X2
| ~ sum(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_2,axiom,
( ~ sum(X3,X4,X1)
| ~ sum(X3,X4,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_43_0,axiom,
( X1 = X2
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_1,axiom,
( ~ product(X3,X4,X2)
| X1 = X2
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_2,axiom,
( ~ product(X3,X4,X1)
| ~ product(X3,X4,X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_44_0,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_031,hypothesis,
! [X2,X3,X1] :
( ~ product(X1,X3,X2)
| product(X3,X1,X2) ),
file('<stdin>',product_symmetry) ).
fof(c_0_1_032,negated_conjecture,
~ sum(l,n,additive_identity),
file('<stdin>',prove_equation) ).
fof(c_0_2_033,hypothesis,
! [X1] :
( product(h(X1),X1,multiplicative_identity)
| X1 = additive_identity ),
file('<stdin>',clause31) ).
fof(c_0_3_034,hypothesis,
! [X1] :
( product(X1,h(X1),multiplicative_identity)
| X1 = additive_identity ),
file('<stdin>',clause30) ).
fof(c_0_4_035,hypothesis,
! [X1] : product(multiplicative_identity,X1,X1),
file('<stdin>',left_multiplicative_identity) ).
fof(c_0_5_036,hypothesis,
! [X1] : product(X1,multiplicative_identity,X1),
file('<stdin>',right_multiplicative_identity) ).
fof(c_0_6_037,negated_conjecture,
product(c,a,n),
file('<stdin>',c_plus_a) ).
fof(c_0_7_038,negated_conjecture,
product(b,a,l),
file('<stdin>',b_plus_a) ).
fof(c_0_8_039,negated_conjecture,
product(d,a,additive_identity),
file('<stdin>',d_plus_a) ).
fof(c_0_9_040,negated_conjecture,
sum(b,c,d),
file('<stdin>',b_plus_c) ).
fof(c_0_10_041,hypothesis,
! [X2,X3,X1] :
( ~ product(X1,X3,X2)
| product(X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_11_042,negated_conjecture,
~ sum(l,n,additive_identity),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_12_043,hypothesis,
! [X1] :
( product(h(X1),X1,multiplicative_identity)
| X1 = additive_identity ),
c_0_2 ).
fof(c_0_13_044,hypothesis,
! [X1] :
( product(X1,h(X1),multiplicative_identity)
| X1 = additive_identity ),
c_0_3 ).
fof(c_0_14_045,hypothesis,
! [X1] : product(multiplicative_identity,X1,X1),
c_0_4 ).
fof(c_0_15_046,hypothesis,
! [X1] : product(X1,multiplicative_identity,X1),
c_0_5 ).
fof(c_0_16_047,negated_conjecture,
product(c,a,n),
c_0_6 ).
fof(c_0_17_048,negated_conjecture,
product(b,a,l),
c_0_7 ).
fof(c_0_18_049,negated_conjecture,
product(d,a,additive_identity),
c_0_8 ).
fof(c_0_19_050,negated_conjecture,
sum(b,c,d),
c_0_9 ).
fof(c_0_20_051,hypothesis,
! [X4,X5,X6] :
( ~ product(X6,X5,X4)
| product(X5,X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_21_052,negated_conjecture,
~ sum(l,n,additive_identity),
c_0_11 ).
fof(c_0_22_053,hypothesis,
! [X2] :
( product(h(X2),X2,multiplicative_identity)
| X2 = additive_identity ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_23_054,hypothesis,
! [X2] :
( product(X2,h(X2),multiplicative_identity)
| X2 = additive_identity ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_24_055,hypothesis,
! [X2] : product(multiplicative_identity,X2,X2),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_25_056,hypothesis,
! [X2] : product(X2,multiplicative_identity,X2),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_26_057,negated_conjecture,
product(c,a,n),
c_0_16 ).
fof(c_0_27_058,negated_conjecture,
product(b,a,l),
c_0_17 ).
fof(c_0_28_059,negated_conjecture,
product(d,a,additive_identity),
c_0_18 ).
fof(c_0_29_060,negated_conjecture,
sum(b,c,d),
c_0_19 ).
cnf(c_0_30_061,hypothesis,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31_062,negated_conjecture,
~ sum(l,n,additive_identity),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32_063,hypothesis,
( X1 = additive_identity
| product(h(X1),X1,multiplicative_identity) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33_064,hypothesis,
( X1 = additive_identity
| product(X1,h(X1),multiplicative_identity) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34_065,hypothesis,
product(multiplicative_identity,X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35_066,hypothesis,
product(X1,multiplicative_identity,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36_067,negated_conjecture,
product(c,a,n),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37_068,negated_conjecture,
product(b,a,l),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38_069,negated_conjecture,
product(d,a,additive_identity),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39_070,negated_conjecture,
sum(b,c,d),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40_071,hypothesis,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
c_0_30,
[final] ).
cnf(c_0_41_072,negated_conjecture,
~ sum(l,n,additive_identity),
c_0_31,
[final] ).
cnf(c_0_42_073,hypothesis,
( X1 = additive_identity
| product(h(X1),X1,multiplicative_identity) ),
c_0_32,
[final] ).
cnf(c_0_43_074,hypothesis,
( X1 = additive_identity
| product(X1,h(X1),multiplicative_identity) ),
c_0_33,
[final] ).
cnf(c_0_44_075,hypothesis,
product(multiplicative_identity,X1,X1),
c_0_34,
[final] ).
cnf(c_0_45,hypothesis,
product(X1,multiplicative_identity,X1),
c_0_35,
[final] ).
cnf(c_0_46,negated_conjecture,
product(c,a,n),
c_0_36,
[final] ).
cnf(c_0_47,negated_conjecture,
product(b,a,l),
c_0_37,
[final] ).
cnf(c_0_48,negated_conjecture,
product(d,a,additive_identity),
c_0_38,
[final] ).
cnf(c_0_49,negated_conjecture,
sum(b,c,d),
c_0_39,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_0,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X4)
| ~ sum(X1,X3,X5)
| ~ product(X0,X5,X6)
| sum(X2,X4,X6) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_5c2f30.p',c_0_36_0) ).
cnf(c_121,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X4)
| ~ sum(X1,X3,X5)
| ~ product(X0,X5,X6)
| sum(X2,X4,X6) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_88198,plain,
( sum(l,n,additive_identity)
| ~ sum(X0,X1,X2)
| ~ product(X3,X2,additive_identity)
| ~ product(X3,X0,l)
| ~ product(X3,X1,n) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_88620,plain,
( sum(l,n,additive_identity)
| ~ sum(X0,X1,d)
| ~ product(a,d,additive_identity)
| ~ product(a,X0,l)
| ~ product(a,X1,n) ),
inference(instantiation,[status(thm)],[c_88198]) ).
cnf(c_89543,plain,
( sum(l,n,additive_identity)
| ~ sum(b,X0,d)
| ~ product(a,b,l)
| ~ product(a,d,additive_identity)
| ~ product(a,X0,n) ),
inference(instantiation,[status(thm)],[c_88620]) ).
cnf(c_90273,plain,
( sum(l,n,additive_identity)
| ~ sum(b,c,d)
| ~ product(a,c,n)
| ~ product(a,b,l)
| ~ product(a,d,additive_identity) ),
inference(instantiation,[status(thm)],[c_89543]) ).
cnf(c_40,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_5c2f30.p',c_0_40) ).
cnf(c_61,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_91,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_110,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_113,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
inference(copy,[status(esa)],[c_110]) ).
cnf(c_163,plain,
( ~ product(X0,X1,X2)
| product(X1,X0,X2) ),
inference(copy,[status(esa)],[c_113]) ).
cnf(c_87870,plain,
( product(a,d,additive_identity)
| ~ product(d,a,additive_identity) ),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_87869,plain,
( product(a,b,l)
| ~ product(b,a,l) ),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_87868,plain,
( ~ product(c,a,n)
| product(a,c,n) ),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_43,negated_conjecture,
~ sum(l,n,additive_identity),
file('/export/starexec/sandbox2/tmp/iprover_modulo_5c2f30.p',c_0_41) ).
cnf(c_46,negated_conjecture,
product(c,a,n),
file('/export/starexec/sandbox2/tmp/iprover_modulo_5c2f30.p',c_0_46) ).
cnf(c_47,negated_conjecture,
product(b,a,l),
file('/export/starexec/sandbox2/tmp/iprover_modulo_5c2f30.p',c_0_47) ).
cnf(c_48,negated_conjecture,
product(d,a,additive_identity),
file('/export/starexec/sandbox2/tmp/iprover_modulo_5c2f30.p',c_0_48) ).
cnf(c_49,negated_conjecture,
sum(b,c,d),
file('/export/starexec/sandbox2/tmp/iprover_modulo_5c2f30.p',c_0_49) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_90273,c_87870,c_87869,c_87868,c_43,c_46,c_47,c_48,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG040-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 07:12:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_bb0b11.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_5c2f30.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_c98374 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_bb0b11.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ 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.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality true
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 1.52/1.73 % --inst_prop_sim_new false
% 1.52/1.73 % --inst_orphan_elimination true
% 1.52/1.73 % --inst_learning_loop_flag true
% 1.52/1.73 % --inst_learning_start 3000
% 1.52/1.73 % --inst_learning_factor 2
% 1.52/1.73 % --inst_start_prop_sim_after_learn 3
% 1.52/1.73 % --inst_sel_renew solver
% 1.52/1.73 % --inst_lit_activity_flag true
% 1.52/1.73 % --inst_out_proof true
% 1.52/1.73
% 1.52/1.73 % ------ Resolution Options
% 1.52/1.73
% 1.52/1.73 % --resolution_flag true
% 1.52/1.73 % --res_lit_sel kbo_max
% 1.52/1.73 % --res_to_prop_solver none
% 1.52/1.73 % --res_prop_simpl_new false
% 1.52/1.73 % --res_prop_simpl_given false
% 1.52/1.73 % --res_passive_queue_type priority_queues
% 1.52/1.73 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.52/1.73 % --res_passive_queues_freq [15;5]
% 1.52/1.73 % --res_forward_subs full
% 1.52/1.73 % --res_backward_subs full
% 1.52/1.73 % --res_forward_subs_resolution true
% 1.52/1.73 % --res_backward_subs_resolution true
% 1.52/1.73 % --res_orphan_elimination false
% 1.52/1.73 % --res_time_limit 1000.
% 1.52/1.73 % --res_out_proof true
% 1.52/1.73 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_bb0b11.s
% 1.52/1.73 % --modulo true
% 1.52/1.73
% 1.52/1.73 % ------ Combination Options
% 1.52/1.73
% 1.52/1.73 % --comb_res_mult 1000
% 1.52/1.73 % --comb_inst_mult 300
% 1.52/1.73 % ------
% 1.52/1.73
% 1.52/1.73
% 1.52/1.73
% 1.52/1.73 % ------ Proving...
% 1.52/1.73 %
% 1.52/1.73
% 1.52/1.73
% 1.52/1.73 % ------ Statistics
% 1.52/1.73
% 1.52/1.73 % ------ General
% 1.52/1.73
% 1.52/1.73 % num_of_input_clauses: 50
% 1.52/1.73 % num_of_input_neg_conjectures: 5
% 1.52/1.73 % num_of_splits: 0
% 1.52/1.73 % num_of_split_atoms: 0
% 1.52/1.73 % num_of_sem_filtered_clauses: 0
% 1.52/1.73 % num_of_subtypes: 0
% 1.52/1.73 % monotx_restored_types: 0
% 1.52/1.73 % sat_num_of_epr_types: 0
% 1.52/1.73 % sat_num_of_non_cyclic_types: 0
% 1.52/1.73 % sat_guarded_non_collapsed_types: 0
% 1.52/1.73 % is_epr: 0
% 1.52/1.73 % is_horn: 0
% 1.52/1.73 % has_eq: 1
% 1.52/1.73 % num_pure_diseq_elim: 0
% 1.52/1.73 % simp_replaced_by: 0
% 1.52/1.73 % res_preprocessed: 15
% 1.52/1.73 % prep_upred: 0
% 1.52/1.73 % prep_unflattend: 0
% 1.52/1.73 % pred_elim_cands: 0
% 1.52/1.73 % pred_elim: 0
% 1.52/1.73 % pred_elim_cl: 0
% 1.52/1.73 % pred_elim_cycles: 0
% 1.52/1.73 % forced_gc_time: 0
% 1.52/1.73 % gc_basic_clause_elim: 0
% 1.52/1.73 % parsing_time: 0.002
% 1.52/1.73 % sem_filter_time: 0.
% 1.52/1.73 % pred_elim_time: 0.
% 1.52/1.73 % out_proof_time: 0.
% 1.52/1.73 % monotx_time: 0.
% 1.52/1.73 % subtype_inf_time: 0.
% 1.52/1.73 % unif_index_cands_time: 0.008
% 1.52/1.73 % unif_index_add_time: 0.002
% 1.52/1.73 % total_time: 1.325
% 1.52/1.73 % num_of_symbols: 39
% 1.52/1.73 % num_of_terms: 23262
% 1.52/1.73
% 1.52/1.73 % ------ Propositional Solver
% 1.52/1.73
% 1.52/1.73 % prop_solver_calls: 8
% 1.52/1.73 % prop_fast_solver_calls: 31
% 1.52/1.73 % prop_num_of_clauses: 1051
% 1.52/1.73 % prop_preprocess_simplified: 1791
% 1.52/1.73 % prop_fo_subsumed: 0
% 1.52/1.73 % prop_solver_time: 0.
% 1.52/1.73 % prop_fast_solver_time: 0.
% 1.52/1.73 % prop_unsat_core_time: 0.
% 1.52/1.73
% 1.52/1.73 % ------ QBF
% 1.52/1.73
% 1.52/1.73 % qbf_q_res: 0
% 1.52/1.73 % qbf_num_tautologies: 0
% 1.52/1.73 % qbf_prep_cycles: 0
% 1.52/1.73
% 1.52/1.73 % ------ BMC1
% 1.52/1.73
% 1.52/1.73 % bmc1_current_bound: -1
% 1.52/1.73 % bmc1_last_solved_bound: -1
% 1.52/1.73 % bmc1_unsat_core_size: -1
% 1.52/1.73 % bmc1_unsat_core_parents_size: -1
% 1.52/1.73 % bmc1_merge_next_fun: 0
% 1.52/1.73 % bmc1_unsat_core_clauses_time: 0.
% 1.52/1.73
% 1.52/1.73 % ------ Instantiation
% 1.52/1.73
% 1.52/1.73 % inst_num_of_clauses: 809
% 1.52/1.73 % inst_num_in_passive: 412
% 1.52/1.73 % inst_num_in_active: 270
% 1.52/1.73 % inst_num_in_unprocessed: 120
% 1.52/1.73 % inst_num_of_loops: 277
% 1.52/1.73 % inst_num_of_learning_restarts: 0
% 1.52/1.73 % inst_num_moves_active_passive: 0
% 1.52/1.73 % inst_lit_activity: 149
% 1.52/1.73 % inst_lit_activity_moves: 0
% 1.52/1.73 % inst_num_tautologies: 5
% 1.52/1.73 % inst_num_prop_implied: 0
% 1.52/1.73 % inst_num_existing_simplified: 0
% 1.52/1.73 % inst_num_eq_res_simplified: 0
% 1.52/1.73 % inst_num_child_elim: 0
% 1.52/1.73 % inst_num_of_dismatching_blockings: 586
% 1.52/1.73 % inst_num_of_non_proper_insts: 1155
% 1.52/1.73 % inst_num_of_duplicates: 598
% 1.52/1.73 % inst_inst_num_from_inst_to_res: 0
% 1.52/1.73 % inst_dismatching_checking_time: 0.001
% 1.52/1.73
% 1.52/1.73 % ------ Resolution
% 1.52/1.73
% 1.52/1.73 % res_num_of_clauses: 38161
% 1.52/1.73 % res_num_in_passive: 37250
% 1.52/1.73 % res_num_in_active: 939
% 1.52/1.73 % res_num_of_loops: 1000
% 1.52/1.73 % res_forward_subset_subsumed: 2897
% 1.52/1.73 % res_backward_subset_subsumed: 48
% 1.52/1.73 % res_forward_subsumed: 86
% 1.52/1.73 % res_backward_subsumed: 7
% 1.52/1.73 % res_forward_subsumption_resolution: 4
% 1.52/1.73 % res_backward_subsumption_resolution: 0
% 1.52/1.73 % res_clause_to_clause_subsumption: 22960
% 1.52/1.73 % res_orphan_elimination: 0
% 1.52/1.73 % res_tautology_del: 163
% 1.52/1.73 % res_num_eq_res_simplified: 0
% 1.52/1.73 % res_num_sel_changes: 0
% 1.52/1.73 % res_moves_from_active_to_pass: 0
% 1.52/1.73
% 1.52/1.73 % Status Unsatisfiable
% 1.52/1.73 % SZS status Unsatisfiable
% 1.52/1.73 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------