TSTP Solution File: GRP047-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : GRP047-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 09:44:29 EDT 2022
% Result : Unsatisfiable 6.44s 6.61s
% Output : CNFRefutation 6.44s
% 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(total_function1,axiom,
product(X,Y,multiply(X,Y)),
input ).
fof(total_function1_0,plain,
! [X,Y] :
( product(X,Y,multiply(X,Y))
| $false ),
inference(orientation,[status(thm)],[total_function1]) ).
cnf(left_inverse,axiom,
product(inverse(X),X,identity),
input ).
fof(left_inverse_0,plain,
! [X] :
( product(inverse(X),X,identity)
| $false ),
inference(orientation,[status(thm)],[left_inverse]) ).
cnf(left_identity,axiom,
product(identity,X,X),
input ).
fof(left_identity_0,plain,
! [X] :
( product(identity,X,X)
| $false ),
inference(orientation,[status(thm)],[left_identity]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> product(identity,X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[left_identity_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X] :
( lhs_atom2(X)
<=> product(inverse(X),X,identity) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X] :
( lhs_atom2(X)
| $false ),
inference(fold_definition,[status(thm)],[left_inverse_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)],[total_function1_0,def_lhs_atom3]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X1] :
( lhs_atom3(X2,X1)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_2,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_3,plain,
! [X2,X1] : lhs_atom3(X2,X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_5,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_6,plain,
! [X3,X4] : lhs_atom3(X3,X4),
inference(variable_rename,[status(thm)],[c_0_3]) ).
fof(c_0_7,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
lhs_atom3(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
lhs_atom3(X1,X2),
c_0_9,
[final] ).
cnf(c_0_13,plain,
lhs_atom2(X1),
c_0_10,
[final] ).
cnf(c_0_14,plain,
lhs_atom1(X1),
c_0_11,
[final] ).
% End CNF derivation
cnf(c_0_12_0,axiom,
product(X2,X1,multiply(X2,X1)),
inference(unfold_definition,[status(thm)],[c_0_12,def_lhs_atom3]) ).
cnf(c_0_13_0,axiom,
product(inverse(X1),X1,identity),
inference(unfold_definition,[status(thm)],[c_0_13,def_lhs_atom2]) ).
cnf(c_0_14_0,axiom,
product(identity,X1,X1),
inference(unfold_definition,[status(thm)],[c_0_14,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,X5,X6] :
( ~ product(X3,X2,X6)
| ~ product(X2,X1,X5)
| ~ product(X6,X1,X4)
| product(X3,X5,X4) ),
file('<stdin>',associativity1) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ~ product(X3,X2,X6)
| ~ product(X2,X1,X5)
| ~ product(X3,X5,X4)
| product(X6,X1,X4) ),
file('<stdin>',associativity2) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3,X4] :
( ~ product(X3,X2,X1)
| ~ product(X3,X2,X4)
| equalish(X1,X4) ),
file('<stdin>',total_function2) ).
fof(c_0_3_004,axiom,
! [X1,X2,X3,X4] :
( ~ equalish(X3,X2)
| ~ product(X4,X1,X3)
| product(X4,X1,X2) ),
file('<stdin>',product_substitution3) ).
fof(c_0_4_005,plain,
! [X1,X2,X3,X4,X5,X6] :
( ~ product(X3,X2,X6)
| ~ product(X2,X1,X5)
| ~ product(X6,X1,X4)
| product(X3,X5,X4) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5_006,plain,
! [X1,X2,X3,X4,X5,X6] :
( ~ product(X3,X2,X6)
| ~ product(X2,X1,X5)
| ~ product(X3,X5,X4)
| product(X6,X1,X4) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_6_007,plain,
! [X1,X2,X3,X4] :
( ~ product(X3,X2,X1)
| ~ product(X3,X2,X4)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_7_008,plain,
! [X1,X2,X3,X4] :
( ~ equalish(X3,X2)
| ~ product(X4,X1,X3)
| product(X4,X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_8_009,plain,
! [X7,X8,X9,X10,X11,X12] :
( ~ product(X9,X8,X12)
| ~ product(X8,X7,X11)
| ~ product(X12,X7,X10)
| product(X9,X11,X10) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_9_010,plain,
! [X7,X8,X9,X10,X11,X12] :
( ~ product(X9,X8,X12)
| ~ product(X8,X7,X11)
| ~ product(X9,X11,X10)
| product(X12,X7,X10) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_10_011,plain,
! [X5,X6,X7,X8] :
( ~ product(X7,X6,X5)
| ~ product(X7,X6,X8)
| equalish(X5,X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_6])])]) ).
fof(c_0_11_012,plain,
! [X5,X6,X7,X8] :
( ~ equalish(X7,X6)
| ~ product(X8,X5,X7)
| product(X8,X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12_013,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_014,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14_015,plain,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( product(X1,X2,X3)
| ~ product(X1,X2,X4)
| ~ equalish(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
c_0_12,
[final] ).
cnf(c_0_17,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
c_0_13,
[final] ).
cnf(c_0_18,plain,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
c_0_14,
[final] ).
cnf(c_0_19,plain,
( product(X1,X2,X3)
| ~ product(X1,X2,X4)
| ~ equalish(X4,X3) ),
c_0_15,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_16_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_16]) ).
cnf(c_0_16_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_16]) ).
cnf(c_0_16_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_16]) ).
cnf(c_0_16_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_16]) ).
cnf(c_0_17_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_17]) ).
cnf(c_0_17_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_17]) ).
cnf(c_0_17_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_17]) ).
cnf(c_0_17_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_17]) ).
cnf(c_0_18_0,axiom,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_18_1,axiom,
( ~ product(X3,X4,X2)
| equalish(X1,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_18_2,axiom,
( ~ product(X3,X4,X1)
| ~ product(X3,X4,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_19_0,axiom,
( product(X1,X2,X3)
| ~ product(X1,X2,X4)
| ~ equalish(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
cnf(c_0_19_1,axiom,
( ~ product(X1,X2,X4)
| product(X1,X2,X3)
| ~ equalish(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
cnf(c_0_19_2,axiom,
( ~ equalish(X4,X3)
| ~ product(X1,X2,X4)
| product(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_016,negated_conjecture,
~ equalish(multiply(c,a),multiply(c,b)),
file('<stdin>',prove_multiply_substitution2) ).
fof(c_0_1_017,hypothesis,
equalish(a,b),
file('<stdin>',a_equals_b) ).
fof(c_0_2_018,negated_conjecture,
~ equalish(multiply(c,a),multiply(c,b)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_019,hypothesis,
equalish(a,b),
c_0_1 ).
fof(c_0_4_020,negated_conjecture,
~ equalish(multiply(c,a),multiply(c,b)),
c_0_2 ).
fof(c_0_5_021,hypothesis,
equalish(a,b),
c_0_3 ).
cnf(c_0_6_022,negated_conjecture,
~ equalish(multiply(c,a),multiply(c,b)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_023,hypothesis,
equalish(a,b),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_024,negated_conjecture,
~ equalish(multiply(c,a),multiply(c,b)),
c_0_6,
[final] ).
cnf(c_0_9_025,hypothesis,
equalish(a,b),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,plain,
( product(X0,X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X5,X4,X1)
| ~ product(X0,X5,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_16_3) ).
cnf(c_38,plain,
( product(X0,X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X5,X4,X1)
| ~ product(X0,X5,X3) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_16004,plain,
( product(X0,X1,multiply(X2,X3))
| ~ product(X4,X5,multiply(X2,X3))
| ~ product(X6,X5,X1)
| ~ product(X0,X6,X4) ),
inference(instantiation,[status(thm)],[c_38]) ).
cnf(c_59644,plain,
( product(X0,X1,multiply(c,a))
| ~ product(X2,X3,multiply(c,a))
| ~ product(X4,X3,X1)
| ~ product(X0,X4,X2) ),
inference(instantiation,[status(thm)],[c_16004]) ).
cnf(c_83118,plain,
( ~ product(multiply(c,inverse(inverse(a))),identity,multiply(c,a))
| ~ product(X0,identity,X1)
| ~ product(X2,X0,multiply(c,inverse(inverse(a))))
| product(X2,X1,multiply(c,a)) ),
inference(instantiation,[status(thm)],[c_59644]) ).
cnf(c_108143,plain,
( ~ product(inverse(inverse(a)),identity,b)
| ~ product(multiply(c,inverse(inverse(a))),identity,multiply(c,a))
| ~ product(X0,inverse(inverse(a)),multiply(c,inverse(inverse(a))))
| product(X0,b,multiply(c,a)) ),
inference(instantiation,[status(thm)],[c_83118]) ).
cnf(c_188211,plain,
( ~ product(inverse(inverse(a)),identity,b)
| ~ product(multiply(c,inverse(inverse(a))),identity,multiply(c,a))
| ~ product(c,inverse(inverse(a)),multiply(c,inverse(inverse(a))))
| product(c,b,multiply(c,a)) ),
inference(instantiation,[status(thm)],[c_108143]) ).
cnf(c_16,plain,
product(X0,X1,multiply(X0,X1)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_12_0) ).
cnf(c_51,plain,
product(X0,X1,multiply(X0,X1)),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_35066,plain,
product(c,X0,multiply(c,X0)),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_58101,plain,
product(c,inverse(inverse(a)),multiply(c,inverse(inverse(a)))),
inference(instantiation,[status(thm)],[c_35066]) ).
cnf(c_10,plain,
( equalish(X0,X1)
| ~ product(X2,X3,X1)
| ~ product(X2,X3,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_18_2) ).
cnf(c_45,plain,
( equalish(X0,X1)
| ~ product(X2,X3,X1)
| ~ product(X2,X3,X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_14256,plain,
( ~ product(X0,X1,multiply(X0,X1))
| ~ product(X0,X1,X2)
| equalish(X2,multiply(X0,X1)) ),
inference(instantiation,[status(thm)],[c_45]) ).
cnf(c_16008,plain,
( ~ product(X0,X1,multiply(X0,X1))
| ~ product(X0,X1,multiply(X2,X3))
| equalish(multiply(X2,X3),multiply(X0,X1)) ),
inference(instantiation,[status(thm)],[c_14256]) ).
cnf(c_57937,plain,
( ~ product(c,b,multiply(c,a))
| ~ product(c,b,multiply(c,b))
| equalish(multiply(c,a),multiply(c,b)) ),
inference(instantiation,[status(thm)],[c_16008]) ).
cnf(c_7,plain,
( product(X0,X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X5,X1,X4)
| ~ product(X3,X5,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_17_3) ).
cnf(c_42,plain,
( product(X0,X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X5,X1,X4)
| ~ product(X3,X5,X0) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_14518,plain,
( product(X0,X1,multiply(X2,X3))
| ~ product(X2,X3,multiply(X2,X3))
| ~ product(X4,X1,X3)
| ~ product(X2,X4,X0) ),
inference(instantiation,[status(thm)],[c_42]) ).
cnf(c_16409,plain,
( ~ product(c,a,multiply(c,a))
| ~ product(c,X0,X1)
| product(X1,X2,multiply(c,a))
| ~ product(X0,X2,a) ),
inference(instantiation,[status(thm)],[c_14518]) ).
cnf(c_35065,plain,
( product(multiply(c,X0),X1,multiply(c,a))
| ~ product(c,a,multiply(c,a))
| ~ product(c,X0,multiply(c,X0))
| ~ product(X0,X1,a) ),
inference(instantiation,[status(thm)],[c_16409]) ).
cnf(c_37610,plain,
( ~ product(inverse(inverse(a)),identity,a)
| product(multiply(c,inverse(inverse(a))),identity,multiply(c,a))
| ~ product(c,inverse(inverse(a)),multiply(c,inverse(inverse(a))))
| ~ product(c,a,multiply(c,a)) ),
inference(instantiation,[status(thm)],[c_35065]) ).
cnf(c_16288,plain,
product(c,b,multiply(c,b)),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_12,plain,
( ~ equalish(X0,X1)
| product(X2,X3,X1)
| ~ product(X2,X3,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_19_1) ).
cnf(c_47,plain,
( ~ equalish(X0,X1)
| product(X2,X3,X1)
| ~ product(X2,X3,X0) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_14978,plain,
( ~ product(inverse(inverse(a)),identity,b)
| product(inverse(inverse(a)),identity,X0)
| ~ equalish(b,X0) ),
inference(instantiation,[status(thm)],[c_47]) ).
cnf(c_14980,plain,
( product(inverse(inverse(a)),identity,a)
| ~ product(inverse(inverse(a)),identity,b)
| ~ equalish(b,a) ),
inference(instantiation,[status(thm)],[c_14978]) ).
cnf(c_14481,plain,
product(X0,a,multiply(X0,a)),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_14922,plain,
product(c,a,multiply(c,a)),
inference(instantiation,[status(thm)],[c_14481]) ).
cnf(c_15,plain,
product(inverse(X0),X0,identity),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_13_0) ).
cnf(c_50,plain,
product(inverse(X0),X0,identity),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_14611,plain,
product(inverse(inverse(a)),inverse(a),identity),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_14326,plain,
( ~ product(identity,a,b)
| ~ product(X0,a,X1)
| ~ product(X2,X0,identity)
| product(X2,X1,b) ),
inference(instantiation,[status(thm)],[c_38]) ).
cnf(c_14477,plain,
( ~ product(identity,a,b)
| ~ product(inverse(a),a,identity)
| product(X0,identity,b)
| ~ product(X0,inverse(a),identity) ),
inference(instantiation,[status(thm)],[c_14326]) ).
cnf(c_14610,plain,
( ~ product(identity,a,b)
| product(inverse(inverse(a)),identity,b)
| ~ product(inverse(inverse(a)),inverse(a),identity)
| ~ product(inverse(a),a,identity) ),
inference(instantiation,[status(thm)],[c_14477]) ).
cnf(c_9,plain,
( ~ product(X0,X1,X2)
| equalish(X2,X3)
| ~ product(X0,X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_18_1) ).
cnf(c_44,plain,
( ~ product(X0,X1,X2)
| equalish(X2,X3)
| ~ product(X0,X1,X3) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_14335,plain,
( ~ product(identity,a,b)
| ~ product(identity,a,X0)
| equalish(b,X0) ),
inference(instantiation,[status(thm)],[c_44]) ).
cnf(c_14337,plain,
( ~ product(identity,a,a)
| ~ product(identity,a,b)
| equalish(b,a) ),
inference(instantiation,[status(thm)],[c_14335]) ).
cnf(c_11,plain,
( ~ equalish(X0,X1)
| ~ product(X2,X3,X0)
| product(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_19_0) ).
cnf(c_46,plain,
( ~ equalish(X0,X1)
| ~ product(X2,X3,X0)
| product(X2,X3,X1) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_14258,plain,
( ~ product(X0,X1,a)
| product(X0,X1,b)
| ~ equalish(a,b) ),
inference(instantiation,[status(thm)],[c_46]) ).
cnf(c_14285,plain,
( ~ product(identity,a,a)
| product(identity,a,b)
| ~ equalish(a,b) ),
inference(instantiation,[status(thm)],[c_14258]) ).
cnf(c_14,plain,
product(identity,X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_14_0) ).
cnf(c_21,plain,
product(identity,a,a),
inference(instantiation,[status(thm)],[c_14]) ).
cnf(c_20,plain,
product(inverse(a),a,identity),
inference(instantiation,[status(thm)],[c_15]) ).
cnf(c_18,plain,
equalish(a,b),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_9) ).
cnf(c_17,negated_conjecture,
~ equalish(multiply(c,a),multiply(c,b)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_736a54.p',c_0_8) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_188211,c_58101,c_57937,c_37610,c_16288,c_14980,c_14922,c_14611,c_14610,c_14337,c_14285,c_21,c_20,c_18,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP047-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 12:24:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.39 % Orientation found
% 0.12/0.39 % 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_076844.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_736a54.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_763db3 | grep -v "SZS"
% 0.20/0.41
% 0.20/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ iProver source info
% 0.20/0.41
% 0.20/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.41 % git: non_committed_changes: true
% 0.20/0.41 % git: last_make_outside_of_git: true
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ Input Options
% 0.20/0.41
% 0.20/0.41 % --out_options all
% 0.20/0.41 % --tptp_safe_out true
% 0.20/0.41 % --problem_path ""
% 0.20/0.41 % --include_path ""
% 0.20/0.41 % --clausifier .//eprover
% 0.20/0.41 % --clausifier_options --tstp-format
% 0.20/0.41 % --stdin false
% 0.20/0.41 % --dbg_backtrace false
% 0.20/0.41 % --dbg_dump_prop_clauses false
% 0.20/0.41 % --dbg_dump_prop_clauses_file -
% 0.20/0.41 % --dbg_out_stat false
% 0.20/0.41
% 0.20/0.41 % ------ General Options
% 0.20/0.41
% 0.20/0.41 % --fof false
% 0.20/0.41 % --time_out_real 150.
% 0.20/0.41 % --time_out_prep_mult 0.2
% 0.20/0.41 % --time_out_virtual -1.
% 0.20/0.41 % --schedule none
% 0.20/0.41 % --ground_splitting input
% 0.20/0.41 % --splitting_nvd 16
% 0.20/0.41 % --non_eq_to_eq false
% 0.20/0.41 % --prep_gs_sim true
% 0.20/0.41 % --prep_unflatten false
% 0.20/0.41 % --prep_res_sim true
% 0.20/0.41 % --prep_upred true
% 0.20/0.41 % --res_sim_input true
% 0.20/0.41 % --clause_weak_htbl true
% 0.20/0.41 % --gc_record_bc_elim false
% 0.20/0.41 % --symbol_type_check false
% 0.20/0.41 % --clausify_out false
% 0.20/0.41 % --large_theory_mode false
% 0.20/0.41 % --prep_sem_filter none
% 0.20/0.41 % --prep_sem_filter_out false
% 0.20/0.41 % --preprocessed_out false
% 0.20/0.41 % --sub_typing false
% 0.20/0.41 % --brand_transform false
% 0.20/0.41 % --pure_diseq_elim true
% 0.20/0.41 % --min_unsat_core false
% 0.20/0.41 % --pred_elim true
% 0.20/0.41 % --add_important_lit false
% 0.20/0.41 % --soft_assumptions false
% 0.20/0.41 % --reset_solvers false
% 0.20/0.41 % --bc_imp_inh []
% 0.20/0.41 % --conj_cone_tolerance 1.5
% 0.20/0.41 % --prolific_symb_bound 500
% 0.20/0.41 % --lt_threshold 2000
% 0.20/0.41
% 0.20/0.41 % ------ SAT Options
% 0.20/0.41
% 0.20/0.41 % --sat_mode false
% 0.20/0.41 % --sat_fm_restart_options ""
% 0.20/0.41 % --sat_gr_def false
% 0.20/0.41 % --sat_epr_types true
% 0.20/0.41 % --sat_non_cyclic_types false
% 0.20/0.41 % --sat_finite_models false
% 0.20/0.41 % --sat_fm_lemmas false
% 0.20/0.41 % --sat_fm_prep false
% 0.20/0.41 % --sat_fm_uc_incr true
% 0.20/0.41 % --sat_out_model small
% 0.20/0.41 % --sat_out_clauses false
% 0.20/0.41
% 0.20/0.41 % ------ QBF Options
% 0.20/0.41
% 0.20/0.41 % --qbf_mode false
% 0.20/0.41 % --qbf_elim_univ true
% 0.20/0.41 % --qbf_sk_in true
% 0.20/0.41 % --qbf_pred_elim true
% 0.20/0.41 % --qbf_split 32
% 0.20/0.41
% 0.20/0.41 % ------ BMC1 Options
% 0.20/0.41
% 0.20/0.41 % --bmc1_incremental false
% 0.20/0.41 % --bmc1_axioms reachable_all
% 0.20/0.41 % --bmc1_min_bound 0
% 0.20/0.41 % --bmc1_max_bound -1
% 0.20/0.41 % --bmc1_max_bound_default -1
% 0.20/0.41 % --bmc1_symbol_reachability true
% 0.20/0.41 % --bmc1_property_lemmas false
% 0.20/0.41 % --bmc1_k_induction false
% 0.20/0.41 % --bmc1_non_equiv_states false
% 0.20/0.41 % --bmc1_deadlock false
% 0.20/0.41 % --bmc1_ucm false
% 0.20/0.41 % --bmc1_add_unsat_core none
% 0.20/0.41 % --bmc1_unsat_core_children false
% 0.20/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.41 % --bmc1_out_stat full
% 0.20/0.41 % --bmc1_ground_init false
% 0.20/0.41 % --bmc1_pre_inst_next_state false
% 0.20/0.41 % --bmc1_pre_inst_state false
% 0.20/0.41 % --bmc1_pre_inst_reach_state false
% 0.20/0.41 % --bmc1_out_unsat_core false
% 0.20/0.41 % --bmc1_aig_witness_out false
% 0.20/0.41 % --bmc1_verbose false
% 0.20/0.41 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_076844.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn true
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 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.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 6.43/6.61 % --inst_prop_sim_new false
% 6.43/6.61 % --inst_orphan_elimination true
% 6.43/6.61 % --inst_learning_loop_flag true
% 6.43/6.61 % --inst_learning_start 3000
% 6.43/6.61 % --inst_learning_factor 2
% 6.43/6.61 % --inst_start_prop_sim_after_learn 3
% 6.43/6.61 % --inst_sel_renew solver
% 6.43/6.61 % --inst_lit_activity_flag true
% 6.43/6.61 % --inst_out_proof true
% 6.43/6.61
% 6.43/6.61 % ------ Resolution Options
% 6.43/6.61
% 6.43/6.61 % --resolution_flag true
% 6.43/6.61 % --res_lit_sel kbo_max
% 6.43/6.61 % --res_to_prop_solver none
% 6.43/6.61 % --res_prop_simpl_new false
% 6.43/6.61 % --res_prop_simpl_given false
% 6.43/6.61 % --res_passive_queue_type priority_queues
% 6.43/6.61 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 6.43/6.61 % --res_passive_queues_freq [15;5]
% 6.43/6.61 % --res_forward_subs full
% 6.43/6.61 % --res_backward_subs full
% 6.43/6.61 % --res_forward_subs_resolution true
% 6.43/6.61 % --res_backward_subs_resolution true
% 6.43/6.61 % --res_orphan_elimination false
% 6.43/6.61 % --res_time_limit 1000.
% 6.43/6.61 % --res_out_proof true
% 6.43/6.61 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_076844.s
% 6.43/6.61 % --modulo true
% 6.43/6.61
% 6.43/6.61 % ------ Combination Options
% 6.43/6.61
% 6.43/6.61 % --comb_res_mult 1000
% 6.43/6.61 % --comb_inst_mult 300
% 6.43/6.61 % ------
% 6.43/6.61
% 6.43/6.61
% 6.43/6.61
% 6.43/6.61 % ------ Proving...
% 6.43/6.61 %
% 6.43/6.61
% 6.43/6.61
% 6.43/6.61 % ------ Statistics
% 6.43/6.61
% 6.43/6.61 % ------ General
% 6.43/6.61
% 6.43/6.61 % num_of_input_clauses: 19
% 6.43/6.61 % num_of_input_neg_conjectures: 1
% 6.43/6.61 % num_of_splits: 0
% 6.43/6.61 % num_of_split_atoms: 0
% 6.43/6.61 % num_of_sem_filtered_clauses: 0
% 6.43/6.61 % num_of_subtypes: 0
% 6.43/6.61 % monotx_restored_types: 0
% 6.43/6.61 % sat_num_of_epr_types: 0
% 6.43/6.61 % sat_num_of_non_cyclic_types: 0
% 6.43/6.61 % sat_guarded_non_collapsed_types: 0
% 6.43/6.61 % is_epr: 0
% 6.43/6.61 % is_horn: 1
% 6.43/6.61 % has_eq: 0
% 6.43/6.61 % num_pure_diseq_elim: 0
% 6.43/6.61 % simp_replaced_by: 0
% 6.43/6.61 % res_preprocessed: 3
% 6.43/6.61 % prep_upred: 0
% 6.43/6.61 % prep_unflattend: 0
% 6.43/6.61 % pred_elim_cands: 0
% 6.43/6.61 % pred_elim: 0
% 6.43/6.61 % pred_elim_cl: 0
% 6.43/6.61 % pred_elim_cycles: 0
% 6.43/6.61 % forced_gc_time: 0
% 6.43/6.61 % gc_basic_clause_elim: 0
% 6.43/6.61 % parsing_time: 0.
% 6.43/6.61 % sem_filter_time: 0.
% 6.43/6.61 % pred_elim_time: 0.
% 6.43/6.61 % out_proof_time: 0.002
% 6.43/6.61 % monotx_time: 0.
% 6.43/6.61 % subtype_inf_time: 0.
% 6.43/6.61 % unif_index_cands_time: 0.024
% 6.43/6.61 % unif_index_add_time: 0.014
% 6.43/6.61 % total_time: 6.208
% 6.43/6.61 % num_of_symbols: 33
% 6.43/6.61 % num_of_terms: 44120
% 6.43/6.61
% 6.43/6.61 % ------ Propositional Solver
% 6.44/6.61
% 6.44/6.61 % prop_solver_calls: 18
% 6.44/6.61 % prop_fast_solver_calls: 5
% 6.44/6.61 % prop_num_of_clauses: 8549
% 6.44/6.61 % prop_preprocess_simplified: 11070
% 6.44/6.61 % prop_fo_subsumed: 0
% 6.44/6.61 % prop_solver_time: 0.003
% 6.44/6.61 % prop_fast_solver_time: 0.
% 6.44/6.61 % prop_unsat_core_time: 0.001
% 6.44/6.61
% 6.44/6.61 % ------ QBF
% 6.44/6.61
% 6.44/6.61 % qbf_q_res: 0
% 6.44/6.61 % qbf_num_tautologies: 0
% 6.44/6.61 % qbf_prep_cycles: 0
% 6.44/6.61
% 6.44/6.61 % ------ BMC1
% 6.44/6.61
% 6.44/6.61 % bmc1_current_bound: -1
% 6.44/6.61 % bmc1_last_solved_bound: -1
% 6.44/6.61 % bmc1_unsat_core_size: -1
% 6.44/6.61 % bmc1_unsat_core_parents_size: -1
% 6.44/6.61 % bmc1_merge_next_fun: 0
% 6.44/6.61 % bmc1_unsat_core_clauses_time: 0.
% 6.44/6.61
% 6.44/6.61 % ------ Instantiation
% 6.44/6.61
% 6.44/6.61 % inst_num_of_clauses: 6290
% 6.44/6.61 % inst_num_in_passive: 2996
% 6.44/6.61 % inst_num_in_active: 1803
% 6.44/6.61 % inst_num_in_unprocessed: 1403
% 6.44/6.61 % inst_num_of_loops: 2101
% 6.44/6.61 % inst_num_of_learning_restarts: 0
% 6.44/6.61 % inst_num_moves_active_passive: 210
% 6.44/6.61 % inst_lit_activity: 897
% 6.44/6.61 % inst_lit_activity_moves: 1
% 6.44/6.61 % inst_num_tautologies: 86
% 6.44/6.61 % inst_num_prop_implied: 0
% 6.44/6.61 % inst_num_existing_simplified: 0
% 6.44/6.61 % inst_num_eq_res_simplified: 0
% 6.44/6.61 % inst_num_child_elim: 0
% 6.44/6.61 % inst_num_of_dismatching_blockings: 24046
% 6.44/6.61 % inst_num_of_non_proper_insts: 25022
% 6.44/6.61 % inst_num_of_duplicates: 12927
% 6.44/6.61 % inst_inst_num_from_inst_to_res: 0
% 6.44/6.61 % inst_dismatching_checking_time: 0.064
% 6.44/6.61
% 6.44/6.61 % ------ Resolution
% 6.44/6.61
% 6.44/6.61 % res_num_of_clauses: 32177
% 6.44/6.61 % res_num_in_passive: 25840
% 6.44/6.61 % res_num_in_active: 6338
% 6.44/6.61 % res_num_of_loops: 8000
% 6.44/6.61 % res_forward_subset_subsumed: 1090
% 6.44/6.61 % res_backward_subset_subsumed: 11
% 6.44/6.61 % res_forward_subsumed: 1671
% 6.44/6.61 % res_backward_subsumed: 4
% 6.44/6.61 % res_forward_subsumption_resolution: 11
% 6.44/6.61 % res_backward_subsumption_resolution: 0
% 6.44/6.61 % res_clause_to_clause_subsumption: 1716127
% 6.44/6.61 % res_orphan_elimination: 0
% 6.44/6.61 % res_tautology_del: 12
% 6.44/6.61 % res_num_eq_res_simplified: 0
% 6.44/6.61 % res_num_sel_changes: 0
% 6.44/6.61 % res_moves_from_active_to_pass: 0
% 6.44/6.61
% 6.44/6.61 % Status Unsatisfiable
% 6.44/6.61 % SZS status Unsatisfiable
% 6.44/6.61 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------