TSTP Solution File: GRP114-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP114-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Thu Aug 31 00:57:34 EDT 2023
% Result : Unsatisfiable 33.83s 8.18s
% Output : CNFRefutation 33.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 20
% Syntax : Number of clauses : 126 ( 126 unt; 0 nHn; 4 RR)
% Number of literals : 126 ( 125 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 188 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_of_identity) ).
cnf(c_50,plain,
inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_involution) ).
cnf(c_51,plain,
multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_product_lemma) ).
cnf(c_53,plain,
union(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_idempotent) ).
cnf(c_54,plain,
intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_commutative) ).
cnf(c_55,plain,
union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_commutative) ).
cnf(c_56,plain,
intersection(intersection(X0,X1),X2) = intersection(X0,intersection(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_associative) ).
cnf(c_57,plain,
union(union(X0,X1),X2) = union(X0,union(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_associative) ).
cnf(c_58,plain,
union(intersection(X0,X1),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_intersection_absorbtion) ).
cnf(c_59,plain,
intersection(union(X0,X1),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_union_absorbtion) ).
cnf(c_60,plain,
union(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,union(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_union1) ).
cnf(c_61,plain,
intersection(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,intersection(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_intersection1) ).
cnf(c_62,plain,
union(multiply(X0,X1),multiply(X2,X1)) = multiply(union(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_union2) ).
cnf(c_63,plain,
intersection(multiply(X0,X1),multiply(X2,X1)) = multiply(intersection(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_intersection2) ).
cnf(c_64,plain,
union(X0,identity) = positive_part(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',positive_part) ).
cnf(c_65,plain,
intersection(X0,identity) = negative_part(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',negative_part) ).
cnf(c_66,negated_conjecture,
multiply(positive_part(a),negative_part(a)) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_product) ).
cnf(c_67,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_68,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_69,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_89,plain,
union(X0,intersection(X1,X0)) = X0,
inference(theory_normalisation,[status(thm)],[c_58,c_57,c_55,c_56,c_54]) ).
cnf(c_90,plain,
intersection(X0,union(X1,X0)) = X0,
inference(theory_normalisation,[status(thm)],[c_59,c_57,c_55,c_56,c_54]) ).
cnf(c_242,plain,
positive_part(identity) = identity,
inference(superposition,[status(thm)],[c_53,c_64]) ).
cnf(c_247,plain,
union(identity,negative_part(X0)) = identity,
inference(superposition,[status(thm)],[c_65,c_89]) ).
cnf(c_250,plain,
multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_50,c_68]) ).
cnf(c_256,plain,
union(X0,intersection(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_54,c_89]) ).
cnf(c_257,plain,
intersection(identity,X0) = negative_part(X0),
inference(superposition,[status(thm)],[c_54,c_65]) ).
cnf(c_258,plain,
union(identity,X0) = positive_part(X0),
inference(superposition,[status(thm)],[c_64,c_55]) ).
cnf(c_262,plain,
positive_part(negative_part(X0)) = identity,
inference(demodulation,[status(thm)],[c_247,c_258]) ).
cnf(c_274,plain,
union(X0,negative_part(X0)) = X0,
inference(superposition,[status(thm)],[c_257,c_89]) ).
cnf(c_292,plain,
intersection(X0,union(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_55,c_90]) ).
cnf(c_296,plain,
intersection(X0,positive_part(X0)) = X0,
inference(superposition,[status(thm)],[c_258,c_90]) ).
cnf(c_299,plain,
negative_part(union(X0,identity)) = identity,
inference(superposition,[status(thm)],[c_90,c_257]) ).
cnf(c_300,plain,
negative_part(positive_part(X0)) = identity,
inference(light_normalisation,[status(thm)],[c_299,c_64]) ).
cnf(c_312,plain,
union(positive_part(X0),identity) = positive_part(X0),
inference(superposition,[status(thm)],[c_300,c_274]) ).
cnf(c_314,plain,
union(identity,positive_part(X0)) = positive_part(X0),
inference(theory_normalisation,[status(thm)],[c_312,c_56,c_54,c_57,c_55]) ).
cnf(c_318,plain,
intersection(negative_part(X0),identity) = negative_part(X0),
inference(superposition,[status(thm)],[c_262,c_296]) ).
cnf(c_324,plain,
intersection(identity,negative_part(X0)) = negative_part(X0),
inference(theory_normalisation,[status(thm)],[c_318,c_56,c_54,c_57,c_55]) ).
cnf(c_366,plain,
inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_374,plain,
multiply(inverse(X0),identity) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_366,c_67]) ).
cnf(c_386,plain,
intersection(X0,intersection(identity,X1)) = intersection(negative_part(X0),X1),
inference(superposition,[status(thm)],[c_65,c_56]) ).
cnf(c_394,plain,
union(X0,intersection(X1,intersection(X2,X0))) = X0,
inference(superposition,[status(thm)],[c_56,c_89]) ).
cnf(c_448,plain,
union(X0,union(identity,X1)) = union(positive_part(X0),X1),
inference(superposition,[status(thm)],[c_64,c_57]) ).
cnf(c_455,plain,
intersection(X0,union(X1,union(X2,X0))) = X0,
inference(superposition,[status(thm)],[c_57,c_90]) ).
cnf(c_473,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_68,c_69]) ).
cnf(c_480,plain,
positive_part(positive_part(X0)) = positive_part(X0),
inference(demodulation,[status(thm)],[c_314,c_258]) ).
cnf(c_502,plain,
negative_part(negative_part(X0)) = negative_part(X0),
inference(demodulation,[status(thm)],[c_324,c_257]) ).
cnf(c_513,plain,
multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_50,c_374]) ).
cnf(c_562,plain,
union(positive_part(X0),intersection(X1,X0)) = positive_part(X0),
inference(superposition,[status(thm)],[c_296,c_394]) ).
cnf(c_643,plain,
multiply(inverse(X0),union(X0,X1)) = union(identity,multiply(inverse(X0),X1)),
inference(superposition,[status(thm)],[c_68,c_60]) ).
cnf(c_646,plain,
union(X0,multiply(X0,X1)) = multiply(X0,union(identity,X1)),
inference(superposition,[status(thm)],[c_513,c_60]) ).
cnf(c_698,plain,
intersection(X0,multiply(X0,X1)) = multiply(X0,intersection(identity,X1)),
inference(superposition,[status(thm)],[c_513,c_61]) ).
cnf(c_772,plain,
union(X0,multiply(X1,X0)) = multiply(union(identity,X1),X0),
inference(superposition,[status(thm)],[c_67,c_62]) ).
cnf(c_856,plain,
intersection(X0,multiply(X1,X0)) = multiply(intersection(identity,X1),X0),
inference(superposition,[status(thm)],[c_67,c_63]) ).
cnf(c_1320,plain,
intersection(X0,union(X1,union(X0,X2))) = X0,
inference(superposition,[status(thm)],[c_55,c_455]) ).
cnf(c_2278,plain,
intersection(negative_part(X0),X1) = intersection(X0,negative_part(X1)),
inference(demodulation,[status(thm)],[c_386,c_257]) ).
cnf(c_2306,plain,
union(negative_part(X0),intersection(X0,negative_part(X1))) = negative_part(X0),
inference(superposition,[status(thm)],[c_2278,c_256]) ).
cnf(c_3410,plain,
union(positive_part(X0),X1) = union(X0,positive_part(X1)),
inference(demodulation,[status(thm)],[c_448,c_258]) ).
cnf(c_3415,plain,
union(X0,positive_part(intersection(X1,X0))) = positive_part(X0),
inference(demodulation,[status(thm)],[c_562,c_3410]) ).
cnf(c_4078,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_473,c_67]) ).
cnf(c_4080,plain,
multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[status(thm)],[c_50,c_4078]) ).
cnf(c_4083,plain,
multiply(inverse(inverse(X0)),inverse(multiply(X1,X0))) = inverse(X1),
inference(superposition,[status(thm)],[c_51,c_4078]) ).
cnf(c_4105,plain,
multiply(X0,inverse(multiply(X1,X0))) = inverse(X1),
inference(light_normalisation,[status(thm)],[c_4083,c_50]) ).
cnf(c_7501,plain,
union(X0,multiply(X0,X1)) = multiply(X0,positive_part(X1)),
inference(demodulation,[status(thm)],[c_646,c_258]) ).
cnf(c_7508,plain,
multiply(inverse(X0),positive_part(X0)) = union(inverse(X0),identity),
inference(superposition,[status(thm)],[c_68,c_7501]) ).
cnf(c_7510,plain,
multiply(X0,positive_part(inverse(X0))) = union(X0,identity),
inference(superposition,[status(thm)],[c_250,c_7501]) ).
cnf(c_7514,plain,
multiply(X0,positive_part(multiply(inverse(X0),X1))) = union(X0,X1),
inference(superposition,[status(thm)],[c_4080,c_7501]) ).
cnf(c_7531,plain,
intersection(X0,union(X1,multiply(X0,positive_part(X2)))) = X0,
inference(superposition,[status(thm)],[c_7501,c_1320]) ).
cnf(c_7542,plain,
multiply(X0,positive_part(inverse(X0))) = positive_part(X0),
inference(light_normalisation,[status(thm)],[c_7510,c_64]) ).
cnf(c_7544,plain,
multiply(inverse(X0),positive_part(X0)) = union(identity,inverse(X0)),
inference(theory_normalisation,[status(thm)],[c_7508,c_56,c_54,c_57,c_55]) ).
cnf(c_7580,plain,
multiply(inverse(X0),positive_part(X0)) = positive_part(inverse(X0)),
inference(demodulation,[status(thm)],[c_7544,c_258]) ).
cnf(c_7599,plain,
multiply(positive_part(X0),inverse(positive_part(inverse(X0)))) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_7580,c_4105]) ).
cnf(c_7610,plain,
multiply(positive_part(X0),inverse(positive_part(inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_7599,c_50]) ).
cnf(c_8059,plain,
intersection(X0,positive_part(multiply(X0,positive_part(X1)))) = X0,
inference(superposition,[status(thm)],[c_258,c_7531]) ).
cnf(c_9561,plain,
intersection(inverse(positive_part(X0)),positive_part(identity)) = inverse(positive_part(X0)),
inference(superposition,[status(thm)],[c_68,c_8059]) ).
cnf(c_9600,plain,
intersection(positive_part(identity),inverse(positive_part(X0))) = inverse(positive_part(X0)),
inference(theory_normalisation,[status(thm)],[c_9561,c_56,c_54,c_57,c_55]) ).
cnf(c_9601,plain,
intersection(identity,inverse(positive_part(X0))) = inverse(positive_part(X0)),
inference(light_normalisation,[status(thm)],[c_9600,c_242]) ).
cnf(c_9759,plain,
negative_part(inverse(positive_part(X0))) = inverse(positive_part(X0)),
inference(demodulation,[status(thm)],[c_9601,c_257]) ).
cnf(c_9780,plain,
union(negative_part(X0),intersection(X0,inverse(positive_part(X1)))) = negative_part(X0),
inference(superposition,[status(thm)],[c_9759,c_2306]) ).
cnf(c_10097,plain,
intersection(X0,multiply(X0,X1)) = multiply(X0,negative_part(X1)),
inference(demodulation,[status(thm)],[c_698,c_257]) ).
cnf(c_10106,plain,
multiply(X0,negative_part(inverse(X0))) = intersection(X0,identity),
inference(superposition,[status(thm)],[c_250,c_10097]) ).
cnf(c_10142,plain,
multiply(X0,negative_part(inverse(X0))) = negative_part(X0),
inference(light_normalisation,[status(thm)],[c_10106,c_65]) ).
cnf(c_10655,plain,
multiply(inverse(X0),negative_part(X0)) = negative_part(inverse(X0)),
inference(superposition,[status(thm)],[c_10142,c_4078]) ).
cnf(c_11032,plain,
union(X0,multiply(X1,X0)) = multiply(positive_part(X1),X0),
inference(demodulation,[status(thm)],[c_772,c_258]) ).
cnf(c_11051,plain,
multiply(positive_part(positive_part(X0)),inverse(positive_part(inverse(X0)))) = union(inverse(positive_part(inverse(X0))),X0),
inference(superposition,[status(thm)],[c_7610,c_11032]) ).
cnf(c_11090,plain,
multiply(positive_part(positive_part(X0)),inverse(positive_part(inverse(X0)))) = union(X0,inverse(positive_part(inverse(X0)))),
inference(theory_normalisation,[status(thm)],[c_11051,c_56,c_54,c_57,c_55]) ).
cnf(c_11091,plain,
union(X0,inverse(positive_part(inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_11090,c_480,c_7610]) ).
cnf(c_11369,plain,
union(inverse(X0),inverse(positive_part(X0))) = inverse(X0),
inference(superposition,[status(thm)],[c_50,c_11091]) ).
cnf(c_11384,plain,
intersection(inverse(positive_part(inverse(X0))),X0) = inverse(positive_part(inverse(X0))),
inference(superposition,[status(thm)],[c_11091,c_90]) ).
cnf(c_11404,plain,
intersection(X0,inverse(positive_part(inverse(X0)))) = inverse(positive_part(inverse(X0))),
inference(theory_normalisation,[status(thm)],[c_11384,c_56,c_54,c_57,c_55]) ).
cnf(c_11497,plain,
multiply(negative_part(X0),inverse(negative_part(inverse(X0)))) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_10655,c_4105]) ).
cnf(c_11509,plain,
multiply(negative_part(X0),inverse(negative_part(inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_11497,c_50]) ).
cnf(c_12029,plain,
union(inverse(negative_part(X0)),inverse(identity)) = inverse(negative_part(X0)),
inference(superposition,[status(thm)],[c_262,c_11369]) ).
cnf(c_12058,plain,
union(inverse(identity),inverse(negative_part(X0))) = inverse(negative_part(X0)),
inference(theory_normalisation,[status(thm)],[c_12029,c_56,c_54,c_57,c_55]) ).
cnf(c_12059,plain,
union(identity,inverse(negative_part(X0))) = inverse(negative_part(X0)),
inference(light_normalisation,[status(thm)],[c_12058,c_49]) ).
cnf(c_13000,plain,
positive_part(inverse(negative_part(X0))) = inverse(negative_part(X0)),
inference(demodulation,[status(thm)],[c_12059,c_258]) ).
cnf(c_13481,plain,
intersection(X0,multiply(X1,X0)) = multiply(negative_part(X1),X0),
inference(demodulation,[status(thm)],[c_856,c_257]) ).
cnf(c_13492,plain,
multiply(negative_part(inverse(X0)),X0) = intersection(X0,identity),
inference(superposition,[status(thm)],[c_68,c_13481]) ).
cnf(c_13510,plain,
multiply(negative_part(negative_part(X0)),inverse(negative_part(inverse(X0)))) = intersection(inverse(negative_part(inverse(X0))),X0),
inference(superposition,[status(thm)],[c_11509,c_13481]) ).
cnf(c_13542,plain,
multiply(negative_part(inverse(X0)),X0) = negative_part(X0),
inference(light_normalisation,[status(thm)],[c_13492,c_65]) ).
cnf(c_13562,plain,
multiply(negative_part(negative_part(X0)),inverse(negative_part(inverse(X0)))) = intersection(X0,inverse(negative_part(inverse(X0)))),
inference(theory_normalisation,[status(thm)],[c_13510,c_56,c_54,c_57,c_55]) ).
cnf(c_13563,plain,
intersection(X0,inverse(negative_part(inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_13562,c_502,c_11509]) ).
cnf(c_13796,plain,
multiply(inverse(negative_part(inverse(X0))),negative_part(X0)) = X0,
inference(superposition,[status(thm)],[c_13542,c_4078]) ).
cnf(c_13804,plain,
multiply(X0,inverse(negative_part(X0))) = inverse(negative_part(inverse(X0))),
inference(superposition,[status(thm)],[c_13542,c_4105]) ).
cnf(c_14248,plain,
intersection(inverse(X0),inverse(negative_part(X0))) = inverse(X0),
inference(superposition,[status(thm)],[c_50,c_13563]) ).
cnf(c_14565,plain,
multiply(inverse(X0),union(X0,X1)) = positive_part(multiply(inverse(X0),X1)),
inference(demodulation,[status(thm)],[c_643,c_258]) ).
cnf(c_14579,plain,
positive_part(multiply(inverse(X0),intersection(X1,X0))) = multiply(inverse(X0),X0),
inference(superposition,[status(thm)],[c_89,c_14565]) ).
cnf(c_14640,plain,
positive_part(multiply(inverse(X0),intersection(X1,X0))) = identity,
inference(light_normalisation,[status(thm)],[c_14579,c_68]) ).
cnf(c_14874,plain,
union(inverse(negative_part(X0)),positive_part(inverse(X0))) = positive_part(inverse(negative_part(X0))),
inference(superposition,[status(thm)],[c_14248,c_3415]) ).
cnf(c_14888,plain,
union(inverse(negative_part(X0)),positive_part(inverse(X0))) = inverse(negative_part(X0)),
inference(light_normalisation,[status(thm)],[c_14874,c_13000]) ).
cnf(c_15118,plain,
positive_part(multiply(inverse(union(X0,X1)),X0)) = identity,
inference(superposition,[status(thm)],[c_292,c_14640]) ).
cnf(c_17665,plain,
positive_part(multiply(inverse(multiply(positive_part(X0),X1)),X1)) = identity,
inference(superposition,[status(thm)],[c_11032,c_15118]) ).
cnf(c_37673,plain,
positive_part(multiply(inverse(inverse(X0)),inverse(multiply(X0,positive_part(X1))))) = identity,
inference(superposition,[status(thm)],[c_4105,c_17665]) ).
cnf(c_37843,plain,
positive_part(multiply(X0,inverse(multiply(X0,positive_part(X1))))) = identity,
inference(light_normalisation,[status(thm)],[c_37673,c_50]) ).
cnf(c_61124,plain,
positive_part(multiply(X0,inverse(union(X0,X1)))) = identity,
inference(superposition,[status(thm)],[c_7514,c_37843]) ).
cnf(c_63025,plain,
positive_part(multiply(X0,inverse(union(X1,X0)))) = identity,
inference(superposition,[status(thm)],[c_55,c_61124]) ).
cnf(c_63657,plain,
union(X0,inverse(union(X1,inverse(X0)))) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_63025,c_7514]) ).
cnf(c_63718,plain,
union(X0,inverse(union(X1,inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_63657,c_513]) ).
cnf(c_122789,plain,
union(negative_part(X0),inverse(positive_part(inverse(X0)))) = negative_part(X0),
inference(superposition,[status(thm)],[c_11404,c_9780]) ).
cnf(c_123339,plain,
union(positive_part(inverse(X0)),inverse(negative_part(X0))) = positive_part(inverse(X0)),
inference(superposition,[status(thm)],[c_122789,c_63718]) ).
cnf(c_123359,plain,
union(inverse(negative_part(X0)),positive_part(inverse(X0))) = positive_part(inverse(X0)),
inference(theory_normalisation,[status(thm)],[c_123339,c_56,c_54,c_57,c_55]) ).
cnf(c_123360,plain,
inverse(negative_part(X0)) = positive_part(inverse(X0)),
inference(light_normalisation,[status(thm)],[c_123359,c_14888]) ).
cnf(c_123453,plain,
multiply(X0,inverse(negative_part(X0))) = positive_part(X0),
inference(demodulation,[status(thm)],[c_7542,c_123360]) ).
cnf(c_123475,plain,
inverse(negative_part(inverse(X0))) = positive_part(X0),
inference(light_normalisation,[status(thm)],[c_123453,c_13804]) ).
cnf(c_123485,plain,
multiply(positive_part(X0),negative_part(X0)) = X0,
inference(demodulation,[status(thm)],[c_13796,c_123475]) ).
cnf(c_123490,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_66,c_123485]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP114-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.07/0.31 % Computer : n026.cluster.edu
% 0.07/0.31 % Model : x86_64 x86_64
% 0.07/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.31 % Memory : 8042.1875MB
% 0.07/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.31 % CPULimit : 300
% 0.07/0.31 % WCLimit : 300
% 0.07/0.31 % DateTime : Tue Aug 29 00:20:35 EDT 2023
% 0.07/0.31 % CPUTime :
% 0.12/0.41 Running UEQ theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 33.83/8.18 % SZS status Started for theBenchmark.p
% 33.83/8.18 % SZS status Unsatisfiable for theBenchmark.p
% 33.83/8.18
% 33.83/8.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 33.83/8.18
% 33.83/8.18 ------ iProver source info
% 33.83/8.18
% 33.83/8.18 git: date: 2023-05-31 18:12:56 +0000
% 33.83/8.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 33.83/8.18 git: non_committed_changes: false
% 33.83/8.18 git: last_make_outside_of_git: false
% 33.83/8.18
% 33.83/8.18 ------ Parsing...successful
% 33.83/8.18
% 33.83/8.18
% 33.83/8.18
% 33.83/8.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 33.83/8.18
% 33.83/8.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 33.83/8.18
% 33.83/8.18 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 33.83/8.18 ------ Proving...
% 33.83/8.18 ------ Problem Properties
% 33.83/8.18
% 33.83/8.18
% 33.83/8.18 clauses 21
% 33.83/8.18 conjectures 1
% 33.83/8.18 EPR 0
% 33.83/8.18 Horn 21
% 33.83/8.18 unary 21
% 33.83/8.18 binary 0
% 33.83/8.18 lits 21
% 33.83/8.18 lits eq 21
% 33.83/8.18 fd_pure 0
% 33.83/8.18 fd_pseudo 0
% 33.83/8.18 fd_cond 0
% 33.83/8.18 fd_pseudo_cond 0
% 33.83/8.18 AC symbols 2
% 33.83/8.18
% 33.83/8.18 ------ Input Options Time Limit: Unbounded
% 33.83/8.18
% 33.83/8.18
% 33.83/8.18 ------
% 33.83/8.18 Current options:
% 33.83/8.18 ------
% 33.83/8.18
% 33.83/8.18 ------ Input Options
% 33.83/8.18
% 33.83/8.18 --out_options all
% 33.83/8.18 --tptp_safe_out true
% 33.83/8.18 --problem_path ""
% 33.83/8.18 --include_path ""
% 33.83/8.18 --clausifier res/vclausify_rel
% 33.83/8.18 --clausifier_options --mode clausify -t 305.00
% 33.83/8.18 --stdin false
% 33.83/8.18 --proof_out true
% 33.83/8.18 --proof_dot_file ""
% 33.83/8.18 --proof_reduce_dot []
% 33.83/8.18 --suppress_sat_res true
% 33.83/8.18 --suppress_unsat_res false
% 33.83/8.18 --stats_out all
% 33.83/8.18 --stats_mem false
% 33.83/8.18 --theory_stats_out false
% 33.83/8.18
% 33.83/8.18 ------ General Options
% 33.83/8.18
% 33.83/8.18 --fof false
% 33.83/8.18 --time_out_real 305.
% 33.83/8.18 --time_out_virtual -1.
% 33.83/8.18 --rnd_seed 13
% 33.83/8.18 --symbol_type_check false
% 33.83/8.18 --clausify_out false
% 33.83/8.18 --sig_cnt_out false
% 33.83/8.18 --trig_cnt_out false
% 33.83/8.18 --trig_cnt_out_tolerance 1.
% 33.83/8.18 --trig_cnt_out_sk_spl false
% 33.83/8.18 --abstr_cl_out false
% 33.83/8.18
% 33.83/8.18 ------ Interactive Mode
% 33.83/8.18
% 33.83/8.18 --interactive_mode false
% 33.83/8.18 --external_ip_address ""
% 33.83/8.18 --external_port 0
% 33.83/8.18
% 33.83/8.18 ------ Global Options
% 33.83/8.18
% 33.83/8.18 --schedule none
% 33.83/8.18 --add_important_lit false
% 33.83/8.18 --prop_solver_per_cl 500
% 33.83/8.18 --subs_bck_mult 8
% 33.83/8.18 --min_unsat_core false
% 33.83/8.18 --soft_assumptions false
% 33.83/8.18 --soft_lemma_size 3
% 33.83/8.18 --prop_impl_unit_size 0
% 33.83/8.18 --prop_impl_unit []
% 33.83/8.18 --share_sel_clauses true
% 33.83/8.18 --reset_solvers false
% 33.83/8.18 --bc_imp_inh [conj_cone]
% 33.83/8.18 --conj_cone_tolerance 3.
% 33.83/8.18 --extra_neg_conj none
% 33.83/8.18 --large_theory_mode true
% 33.83/8.18 --prolific_symb_bound 200
% 33.83/8.18 --lt_threshold 2000
% 33.83/8.18 --clause_weak_htbl true
% 33.83/8.18 --gc_record_bc_elim false
% 33.83/8.18
% 33.83/8.18 ------ Preprocessing Options
% 33.83/8.18
% 33.83/8.18 --preprocessing_flag true
% 33.83/8.18 --time_out_prep_mult 0.1
% 33.83/8.18 --splitting_mode input
% 33.83/8.18 --splitting_grd true
% 33.83/8.18 --splitting_cvd false
% 33.83/8.18 --splitting_cvd_svl false
% 33.83/8.18 --splitting_nvd 32
% 33.83/8.18 --sub_typing false
% 33.83/8.18 --prep_gs_sim true
% 33.83/8.18 --prep_unflatten true
% 33.83/8.18 --prep_res_sim true
% 33.83/8.18 --prep_sup_sim_all true
% 33.83/8.18 --prep_sup_sim_sup false
% 33.83/8.18 --prep_upred true
% 33.83/8.18 --prep_well_definedness true
% 33.83/8.18 --prep_sem_filter exhaustive
% 33.83/8.18 --prep_sem_filter_out false
% 33.83/8.18 --pred_elim true
% 33.83/8.18 --res_sim_input true
% 33.83/8.18 --eq_ax_congr_red true
% 33.83/8.18 --pure_diseq_elim true
% 33.83/8.18 --brand_transform false
% 33.83/8.18 --non_eq_to_eq false
% 33.83/8.18 --prep_def_merge true
% 33.83/8.18 --prep_def_merge_prop_impl false
% 33.83/8.18 --prep_def_merge_mbd true
% 33.83/8.18 --prep_def_merge_tr_red false
% 33.83/8.18 --prep_def_merge_tr_cl false
% 33.83/8.18 --smt_preprocessing false
% 33.83/8.18 --smt_ac_axioms fast
% 33.83/8.18 --preprocessed_out false
% 33.83/8.18 --preprocessed_stats false
% 33.83/8.18
% 33.83/8.18 ------ Abstraction refinement Options
% 33.83/8.18
% 33.83/8.18 --abstr_ref []
% 33.83/8.18 --abstr_ref_prep false
% 33.83/8.18 --abstr_ref_until_sat false
% 33.83/8.18 --abstr_ref_sig_restrict funpre
% 33.83/8.18 --abstr_ref_af_restrict_to_split_sk false
% 33.83/8.18 --abstr_ref_under []
% 33.83/8.18
% 33.83/8.18 ------ SAT Options
% 33.83/8.18
% 33.83/8.18 --sat_mode false
% 33.83/8.18 --sat_fm_restart_options ""
% 33.83/8.18 --sat_gr_def false
% 33.83/8.18 --sat_epr_types true
% 33.83/8.18 --sat_non_cyclic_types false
% 33.83/8.18 --sat_finite_models false
% 33.83/8.18 --sat_fm_lemmas false
% 33.83/8.18 --sat_fm_prep false
% 33.83/8.18 --sat_fm_uc_incr true
% 33.83/8.18 --sat_out_model small
% 33.83/8.18 --sat_out_clauses false
% 33.83/8.18
% 33.83/8.18 ------ QBF Options
% 33.83/8.18
% 33.83/8.18 --qbf_mode false
% 33.83/8.18 --qbf_elim_univ false
% 33.83/8.18 --qbf_dom_inst none
% 33.83/8.18 --qbf_dom_pre_inst false
% 33.83/8.18 --qbf_sk_in false
% 33.83/8.18 --qbf_pred_elim true
% 33.83/8.18 --qbf_split 512
% 33.83/8.18
% 33.83/8.18 ------ BMC1 Options
% 33.83/8.18
% 33.83/8.18 --bmc1_incremental false
% 33.83/8.18 --bmc1_axioms reachable_all
% 33.83/8.18 --bmc1_min_bound 0
% 33.83/8.18 --bmc1_max_bound -1
% 33.83/8.18 --bmc1_max_bound_default -1
% 33.83/8.18 --bmc1_symbol_reachability true
% 33.83/8.18 --bmc1_property_lemmas false
% 33.83/8.18 --bmc1_k_induction false
% 33.83/8.18 --bmc1_non_equiv_states false
% 33.83/8.18 --bmc1_deadlock false
% 33.83/8.18 --bmc1_ucm false
% 33.83/8.18 --bmc1_add_unsat_core none
% 33.83/8.18 --bmc1_unsat_core_children false
% 33.83/8.18 --bmc1_unsat_core_extrapolate_axioms false
% 33.83/8.18 --bmc1_out_stat full
% 33.83/8.18 --bmc1_ground_init false
% 33.83/8.18 --bmc1_pre_inst_next_state false
% 33.83/8.18 --bmc1_pre_inst_state false
% 33.83/8.18 --bmc1_pre_inst_reach_state false
% 33.83/8.18 --bmc1_out_unsat_core false
% 33.83/8.18 --bmc1_aig_witness_out false
% 33.83/8.18 --bmc1_verbose false
% 33.83/8.18 --bmc1_dump_clauses_tptp false
% 33.83/8.18 --bmc1_dump_unsat_core_tptp false
% 33.83/8.18 --bmc1_dump_file -
% 33.83/8.18 --bmc1_ucm_expand_uc_limit 128
% 33.83/8.18 --bmc1_ucm_n_expand_iterations 6
% 33.83/8.18 --bmc1_ucm_extend_mode 1
% 33.83/8.18 --bmc1_ucm_init_mode 2
% 33.83/8.18 --bmc1_ucm_cone_mode none
% 33.83/8.18 --bmc1_ucm_reduced_relation_type 0
% 33.83/8.18 --bmc1_ucm_relax_model 4
% 33.83/8.18 --bmc1_ucm_full_tr_after_sat true
% 33.83/8.18 --bmc1_ucm_expand_neg_assumptions false
% 33.83/8.18 --bmc1_ucm_layered_model none
% 33.83/8.18 --bmc1_ucm_max_lemma_size 10
% 33.83/8.18
% 33.83/8.18 ------ AIG Options
% 33.83/8.18
% 33.83/8.18 --aig_mode false
% 33.83/8.18
% 33.83/8.18 ------ Instantiation Options
% 33.83/8.18
% 33.83/8.18 --instantiation_flag true
% 33.83/8.18 --inst_sos_flag false
% 33.83/8.18 --inst_sos_phase true
% 33.83/8.18 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 33.83/8.18 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 33.83/8.18 --inst_lit_sel_side num_symb
% 33.83/8.18 --inst_solver_per_active 1400
% 33.83/8.18 --inst_solver_calls_frac 1.
% 33.83/8.18 --inst_to_smt_solver true
% 33.83/8.18 --inst_passive_queue_type priority_queues
% 33.83/8.18 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 33.83/8.18 --inst_passive_queues_freq [25;2]
% 33.83/8.18 --inst_dismatching true
% 33.83/8.18 --inst_eager_unprocessed_to_passive true
% 33.83/8.18 --inst_unprocessed_bound 1000
% 33.83/8.18 --inst_prop_sim_given true
% 33.83/8.18 --inst_prop_sim_new false
% 33.83/8.18 --inst_subs_new false
% 33.83/8.18 --inst_eq_res_simp false
% 33.83/8.18 --inst_subs_given false
% 33.83/8.18 --inst_orphan_elimination true
% 33.83/8.18 --inst_learning_loop_flag true
% 33.83/8.18 --inst_learning_start 3000
% 33.83/8.18 --inst_learning_factor 2
% 33.83/8.18 --inst_start_prop_sim_after_learn 3
% 33.83/8.18 --inst_sel_renew solver
% 33.83/8.18 --inst_lit_activity_flag true
% 33.83/8.18 --inst_restr_to_given false
% 33.83/8.18 --inst_activity_threshold 500
% 33.83/8.18
% 33.83/8.18 ------ Resolution Options
% 33.83/8.18
% 33.83/8.18 --resolution_flag true
% 33.83/8.18 --res_lit_sel adaptive
% 33.83/8.18 --res_lit_sel_side none
% 33.83/8.18 --res_ordering kbo
% 33.83/8.18 --res_to_prop_solver active
% 33.83/8.18 --res_prop_simpl_new false
% 33.83/8.18 --res_prop_simpl_given true
% 33.83/8.18 --res_to_smt_solver true
% 33.83/8.18 --res_passive_queue_type priority_queues
% 33.83/8.18 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 33.83/8.18 --res_passive_queues_freq [15;5]
% 33.83/8.18 --res_forward_subs full
% 33.83/8.18 --res_backward_subs full
% 33.83/8.18 --res_forward_subs_resolution true
% 33.83/8.18 --res_backward_subs_resolution true
% 33.83/8.18 --res_orphan_elimination true
% 33.83/8.18 --res_time_limit 300.
% 33.83/8.18
% 33.83/8.18 ------ Superposition Options
% 33.83/8.18
% 33.83/8.18 --superposition_flag true
% 33.83/8.18 --sup_passive_queue_type priority_queues
% 33.83/8.18 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 33.83/8.18 --sup_passive_queues_freq [8;1;4;4]
% 33.83/8.18 --demod_completeness_check fast
% 33.83/8.18 --demod_use_ground true
% 33.83/8.18 --sup_unprocessed_bound 0
% 33.83/8.18 --sup_to_prop_solver passive
% 33.83/8.18 --sup_prop_simpl_new true
% 33.83/8.18 --sup_prop_simpl_given true
% 33.83/8.18 --sup_fun_splitting false
% 33.83/8.18 --sup_iter_deepening 2
% 33.83/8.18 --sup_restarts_mult 12
% 33.83/8.18 --sup_score sim_d_gen
% 33.83/8.18 --sup_share_score_frac 0.2
% 33.83/8.18 --sup_share_max_num_cl 500
% 33.83/8.18 --sup_ordering kbo
% 33.83/8.18 --sup_symb_ordering invfreq
% 33.83/8.18 --sup_term_weight default
% 33.83/8.18
% 33.83/8.18 ------ Superposition Simplification Setup
% 33.83/8.18
% 33.83/8.18 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 33.83/8.18 --sup_full_triv [SMTSimplify;PropSubs]
% 33.83/8.18 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 33.83/8.18 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 33.83/8.18 --sup_immed_triv []
% 33.83/8.18 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 33.83/8.18 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 33.83/8.18 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 33.83/8.18 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 33.83/8.18 --sup_input_triv [Unflattening;SMTSimplify]
% 33.83/8.18 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 33.83/8.18 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 33.83/8.18 --sup_full_fixpoint true
% 33.83/8.18 --sup_main_fixpoint true
% 33.83/8.18 --sup_immed_fixpoint false
% 33.83/8.18 --sup_input_fixpoint true
% 33.83/8.18 --sup_cache_sim none
% 33.83/8.18 --sup_smt_interval 500
% 33.83/8.18 --sup_bw_gjoin_interval 0
% 33.83/8.18
% 33.83/8.18 ------ Combination Options
% 33.83/8.18
% 33.83/8.18 --comb_mode clause_based
% 33.83/8.18 --comb_inst_mult 5
% 33.83/8.18 --comb_res_mult 1
% 33.83/8.18 --comb_sup_mult 8
% 33.83/8.18 --comb_sup_deep_mult 2
% 33.83/8.18
% 33.83/8.18 ------ Debug Options
% 33.83/8.18
% 33.83/8.18 --dbg_backtrace false
% 33.83/8.18 --dbg_dump_prop_clauses false
% 33.83/8.18 --dbg_dump_prop_clauses_file -
% 33.83/8.18 --dbg_out_stat false
% 33.83/8.18 --dbg_just_parse false
% 33.83/8.18
% 33.83/8.18
% 33.83/8.18
% 33.83/8.18
% 33.83/8.18 ------ Proving...
% 33.83/8.18
% 33.83/8.18
% 33.83/8.18 % SZS status Unsatisfiable for theBenchmark.p
% 33.83/8.18
% 33.83/8.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 33.83/8.18
% 33.83/8.18 ------ Statistics
% 33.83/8.18
% 33.83/8.18 ------ Problem properties
% 33.83/8.18
% 33.83/8.18 clauses: 21
% 33.83/8.18 conjectures: 1
% 33.83/8.18 epr: 0
% 33.83/8.18 horn: 21
% 33.83/8.18 ground: 2
% 33.83/8.18 unary: 21
% 33.83/8.18 binary: 0
% 33.83/8.18 lits: 21
% 33.83/8.18 lits_eq: 21
% 33.83/8.18 fd_pure: 0
% 33.83/8.18 fd_pseudo: 0
% 33.83/8.18 fd_cond: 0
% 33.83/8.18 fd_pseudo_cond: 0
% 33.83/8.18 ac_symbols: 2
% 33.83/8.18
% 33.83/8.18 ------ General
% 33.83/8.18
% 33.83/8.18 abstr_ref_over_cycles: 0
% 33.83/8.18 abstr_ref_under_cycles: 0
% 33.83/8.18 gc_basic_clause_elim: 0
% 33.83/8.18 num_of_symbols: 104
% 33.83/8.18 num_of_terms: 210688
% 33.83/8.18
% 33.83/8.18 parsing_time: 0.
% 33.83/8.18 unif_index_cands_time: 0.414
% 33.83/8.18 unif_index_add_time: 0.036
% 33.83/8.18 orderings_time: 0.092
% 33.83/8.18 out_proof_time: 0.003
% 33.83/8.18 total_time: 7.415
% 33.83/8.18
% 33.83/8.18 ------ Preprocessing
% 33.83/8.18
% 33.83/8.18 num_of_splits: 0
% 33.83/8.18 num_of_split_atoms: 0
% 33.83/8.18 num_of_reused_defs: 0
% 33.83/8.18 num_eq_ax_congr_red: 0
% 33.83/8.18 num_of_sem_filtered_clauses: 0
% 33.83/8.18 num_of_subtypes: 0
% 33.83/8.18 monotx_restored_types: 0
% 33.83/8.18 sat_num_of_epr_types: 0
% 33.83/8.18 sat_num_of_non_cyclic_types: 0
% 33.83/8.18 sat_guarded_non_collapsed_types: 0
% 33.83/8.18 num_pure_diseq_elim: 0
% 33.83/8.18 simp_replaced_by: 0
% 33.83/8.18 res_preprocessed: 0
% 33.83/8.18 sup_preprocessed: 0
% 33.83/8.18 prep_upred: 0
% 33.83/8.18 prep_unflattend: 0
% 33.83/8.18 prep_well_definedness: 0
% 33.83/8.18 smt_new_axioms: 0
% 33.83/8.18 pred_elim_cands: 0
% 33.83/8.18 pred_elim: 0
% 33.83/8.18 pred_elim_cl: 0
% 33.83/8.18 pred_elim_cycles: 0
% 33.83/8.18 merged_defs: 0
% 33.83/8.18 merged_defs_ncl: 0
% 33.83/8.18 bin_hyper_res: 0
% 33.83/8.18 prep_cycles: 2
% 33.83/8.18
% 33.83/8.18 splitting_time: 0.
% 33.83/8.18 sem_filter_time: 0.
% 33.83/8.18 monotx_time: 0.
% 33.83/8.18 subtype_inf_time: 0.
% 33.83/8.18 res_prep_time: 0.001
% 33.83/8.18 sup_prep_time: 0.001
% 33.83/8.18 pred_elim_time: 0.
% 33.83/8.18 bin_hyper_res_time: 0.
% 33.83/8.18 prep_time_total: 0.004
% 33.83/8.18
% 33.83/8.18 ------ Propositional Solver
% 33.83/8.18
% 33.83/8.18 prop_solver_calls: 89
% 33.83/8.18 prop_fast_solver_calls: 2493
% 33.83/8.18 smt_solver_calls: 1
% 33.83/8.18 smt_fast_solver_calls: 0
% 33.83/8.18 prop_num_of_clauses: 44216
% 33.83/8.18 prop_preprocess_simplified: 39589
% 33.83/8.18 prop_fo_subsumed: 0
% 33.83/8.18
% 33.83/8.18 prop_solver_time: 0.074
% 33.83/8.18 prop_fast_solver_time: 0.003
% 33.83/8.18 prop_unsat_core_time: 0.
% 33.83/8.18 smt_solver_time: 0.109
% 33.83/8.18 smt_fast_solver_time: 0.
% 33.83/8.18
% 33.83/8.18 ------ QBF
% 33.83/8.18
% 33.83/8.18 qbf_q_res: 0
% 33.83/8.18 qbf_num_tautologies: 0
% 33.83/8.18 qbf_prep_cycles: 0
% 33.83/8.18
% 33.83/8.18 ------ BMC1
% 33.83/8.18
% 33.83/8.18 bmc1_current_bound: -1
% 33.83/8.18 bmc1_last_solved_bound: -1
% 33.83/8.18 bmc1_unsat_core_size: -1
% 33.83/8.18 bmc1_unsat_core_parents_size: -1
% 33.83/8.18 bmc1_merge_next_fun: 0
% 33.83/8.18
% 33.83/8.18 bmc1_unsat_core_clauses_time: 0.
% 33.83/8.18
% 33.83/8.18 ------ Instantiation
% 33.83/8.18
% 33.83/8.18 inst_num_of_clauses: 8286
% 33.83/8.18 inst_num_in_passive: 5555
% 33.83/8.18 inst_num_in_active: 1943
% 33.83/8.18 inst_num_of_loops: 2195
% 33.83/8.18 inst_num_in_unprocessed: 788
% 33.83/8.18 inst_num_of_learning_restarts: 0
% 33.83/8.18 inst_num_moves_active_passive: 244
% 33.83/8.18 inst_lit_activity: 0
% 33.83/8.18 inst_lit_activity_moves: 2
% 33.83/8.18 inst_num_tautologies: 0
% 33.83/8.18 inst_num_prop_implied: 0
% 33.83/8.18 inst_num_existing_simplified: 0
% 33.83/8.18 inst_num_eq_res_simplified: 0
% 33.83/8.18 inst_num_child_elim: 0
% 33.83/8.18 inst_num_of_dismatching_blockings: 2307
% 33.83/8.18 inst_num_of_non_proper_insts: 4796
% 33.83/8.18 inst_num_of_duplicates: 0
% 33.83/8.18 inst_inst_num_from_inst_to_res: 0
% 33.83/8.18
% 33.83/8.18 inst_time_sim_new: 0.567
% 33.83/8.18 inst_time_sim_given: 0.
% 33.83/8.18 inst_time_dismatching_checking: 0.656
% 33.83/8.18 inst_time_total: 1.966
% 33.83/8.18
% 33.83/8.18 ------ Resolution
% 33.83/8.18
% 33.83/8.18 res_num_of_clauses: 1643
% 33.83/8.18 res_num_in_passive: 1312
% 33.83/8.18 res_num_in_active: 331
% 33.83/8.18 res_num_of_loops: 404
% 33.83/8.18 res_forward_subset_subsumed: 4357
% 33.83/8.18 res_backward_subset_subsumed: 0
% 33.83/8.18 res_forward_subsumed: 20
% 33.83/8.18 res_backward_subsumed: 0
% 33.83/8.18 res_forward_subsumption_resolution: 0
% 33.83/8.18 res_backward_subsumption_resolution: 0
% 33.83/8.18 res_clause_to_clause_subsumption: 6437
% 33.83/8.18 res_subs_bck_cnt: 3
% 33.83/8.18 res_orphan_elimination: 0
% 33.83/8.18 res_tautology_del: 471
% 33.83/8.18 res_num_eq_res_simplified: 0
% 33.83/8.18 res_num_sel_changes: 101
% 33.83/8.18 res_moves_from_active_to_pass: 1
% 33.83/8.18
% 33.83/8.18 res_time_sim_new: 0.101
% 33.83/8.18 res_time_sim_fw_given: 0.016
% 33.83/8.18 res_time_sim_bw_given: 0.034
% 33.83/8.18 res_time_total: 0.224
% 33.83/8.18
% 33.83/8.18 ------ Superposition
% 33.83/8.18
% 33.83/8.18 sup_num_of_clauses: 3293
% 33.83/8.18 sup_num_in_active: 187
% 33.83/8.18 sup_num_in_passive: 3106
% 33.83/8.18 sup_num_of_loops: 799
% 33.83/8.18 sup_fw_superposition: 28552
% 33.83/8.18 sup_bw_superposition: 22923
% 33.83/8.18 sup_eq_factoring: 0
% 33.83/8.18 sup_eq_resolution: 0
% 33.83/8.18 sup_immediate_simplified: 14
% 33.83/8.18 sup_given_eliminated: 4
% 33.83/8.18 comparisons_done: 101736
% 33.83/8.18 comparisons_avoided: 0
% 33.83/8.18 comparisons_inc_criteria: 0
% 33.83/8.18 sup_deep_cl_discarded: 0
% 33.83/8.18 sup_num_of_deepenings: 0
% 33.83/8.18 sup_num_of_restarts: 2
% 33.83/8.18
% 33.83/8.18 sup_time_generating: 1.348
% 33.83/8.18 sup_time_sim_fw_full: 0.159
% 33.83/8.18 sup_time_sim_bw_full: 0.129
% 33.83/8.18 sup_time_sim_fw_immed: 0.98
% 33.83/8.18 sup_time_sim_bw_immed: 0.263
% 33.83/8.18 sup_time_prep_sim_fw_input: 0.
% 33.83/8.18 sup_time_prep_sim_bw_input: 0.
% 33.83/8.18 sup_time_total: 4.989
% 33.83/8.18
% 33.83/8.18 ------ Simplifications
% 33.83/8.18
% 33.83/8.18 sim_repeated: 18384
% 33.83/8.18 sim_fw_subset_subsumed: 0
% 33.83/8.18 sim_bw_subset_subsumed: 0
% 33.83/8.18 sim_fw_subsumed: 0
% 33.83/8.18 sim_bw_subsumed: 0
% 33.83/8.18 sim_fw_subsumption_res: 0
% 33.83/8.18 sim_bw_subsumption_res: 0
% 33.83/8.18 sim_fw_unit_subs: 0
% 33.83/8.18 sim_bw_unit_subs: 24
% 33.83/8.18 sim_tautology_del: 0
% 33.83/8.18 sim_eq_tautology_del: 7092
% 33.83/8.18 sim_eq_res_simp: 0
% 33.83/8.18 sim_fw_demodulated: 129
% 33.83/8.18 sim_bw_demodulated: 82
% 33.83/8.18 sim_encompassment_demod: 0
% 33.83/8.18 sim_light_normalised: 15330
% 33.83/8.18 sim_ac_normalised: 7115
% 33.83/8.18 sim_joinable_taut: 144
% 33.83/8.18 sim_joinable_simp: 0
% 33.83/8.18 sim_fw_ac_demod: 0
% 33.83/8.18 sim_bw_ac_demod: 0
% 33.83/8.18 sim_smt_subsumption: 0
% 33.83/8.18 sim_smt_simplified: 0
% 33.83/8.18 sim_ground_joinable: 69
% 33.83/8.18 sim_bw_ground_joinable: 0
% 33.83/8.18 sim_connectedness: 0
% 33.83/8.18
% 33.83/8.18 sim_time_fw_subset_subs: 0.041
% 33.83/8.18 sim_time_bw_subset_subs: 0.035
% 33.83/8.18 sim_time_fw_subs: 0.
% 33.83/8.18 sim_time_bw_subs: 0.
% 33.83/8.18 sim_time_fw_subs_res: 0.
% 33.83/8.18 sim_time_bw_subs_res: 0.
% 33.83/8.18 sim_time_fw_unit_subs: 0.226
% 33.83/8.18 sim_time_bw_unit_subs: 0.134
% 33.83/8.18 sim_time_tautology_del: 0.022
% 33.83/8.18 sim_time_eq_tautology_del: 0.008
% 33.83/8.18 sim_time_eq_res_simp: 0.019
% 33.83/8.18 sim_time_fw_demod: 0.082
% 33.83/8.18 sim_time_bw_demod: 0.064
% 33.83/8.18 sim_time_light_norm: 0.378
% 33.83/8.18 sim_time_joinable: 0.
% 33.83/8.18 sim_time_ac_norm: 0.277
% 33.83/8.18 sim_time_fw_ac_demod: 0.
% 33.83/8.18 sim_time_bw_ac_demod: 0.
% 33.83/8.18 sim_time_smt_subs: 0.
% 33.83/8.18 sim_time_fw_gjoin: 0.043
% 33.83/8.18 sim_time_fw_connected: 0.
% 33.83/8.18
% 33.83/8.18
%------------------------------------------------------------------------------