TSTP Solution File: GRP185-4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP185-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:21:39 EDT 2024
% Result : Unsatisfiable 8.03s 1.66s
% Output : CNFRefutation 8.03s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22b_1) ).
cnf(c_50,plain,
inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22b_2) ).
cnf(c_51,plain,
multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22b_3) ).
cnf(c_52,negated_conjecture,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p22b) ).
cnf(c_53,plain,
greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(c_54,plain,
least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(c_55,plain,
greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(c_56,plain,
least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(c_59,plain,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(c_60,plain,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_61,plain,
least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(c_63,plain,
least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(c_65,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_66,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_67,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_85,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),multiply(least_upper_bound(identity,a),least_upper_bound(identity,b))) != least_upper_bound(identity,multiply(a,b)),
inference(theory_normalisation,[status(thm)],[c_52,c_55,c_53,c_56,c_54]) ).
cnf(c_130,plain,
multiply(a,b) = sP0_iProver_def,
definition ).
cnf(c_131,plain,
least_upper_bound(identity,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_132,plain,
least_upper_bound(identity,a) = sP2_iProver_def,
definition ).
cnf(c_133,plain,
least_upper_bound(identity,b) = sP3_iProver_def,
definition ).
cnf(c_134,plain,
multiply(sP2_iProver_def,sP3_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_135,plain,
greatest_lower_bound(sP1_iProver_def,sP4_iProver_def) = sP5_iProver_def,
definition ).
cnf(c_136,negated_conjecture,
sP5_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_85,c_133,c_132,c_134,c_130,c_131,c_135]) ).
cnf(c_226,plain,
least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[status(thm)],[c_56,c_54]) ).
cnf(c_232,plain,
least_upper_bound(sP0_iProver_def,identity) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_131,c_56,c_54,c_55,c_53]) ).
cnf(c_240,plain,
least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_53,c_59]) ).
cnf(c_243,plain,
least_upper_bound(sP1_iProver_def,sP5_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_135,c_59]) ).
cnf(c_244,plain,
greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_54,c_60]) ).
cnf(c_249,plain,
greatest_lower_bound(identity,sP3_iProver_def) = identity,
inference(superposition,[status(thm)],[c_133,c_60]) ).
cnf(c_250,plain,
greatest_lower_bound(sP0_iProver_def,sP1_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_232,c_60]) ).
cnf(c_253,plain,
greatest_lower_bound(sP3_iProver_def,identity) = identity,
inference(theory_normalisation,[status(thm)],[c_249,c_56,c_54,c_55,c_53]) ).
cnf(c_256,plain,
least_upper_bound(sP3_iProver_def,identity) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_253,c_59]) ).
cnf(c_264,plain,
least_upper_bound(sP4_iProver_def,sP5_iProver_def) = sP4_iProver_def,
inference(superposition,[status(thm)],[c_135,c_240]) ).
cnf(c_285,plain,
least_upper_bound(identity,least_upper_bound(X0,a)) = least_upper_bound(X0,sP2_iProver_def),
inference(superposition,[status(thm)],[c_132,c_226]) ).
cnf(c_287,plain,
least_upper_bound(X0,least_upper_bound(X1,greatest_lower_bound(X2,X0))) = least_upper_bound(X1,X0),
inference(superposition,[status(thm)],[c_240,c_226]) ).
cnf(c_288,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(X0,identity)) = least_upper_bound(X0,sP1_iProver_def),
inference(superposition,[status(thm)],[c_232,c_226]) ).
cnf(c_294,plain,
greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X2))) = X0,
inference(superposition,[status(thm)],[c_226,c_60]) ).
cnf(c_313,plain,
inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_321,plain,
multiply(inverse(X0),identity) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_313,c_65]) ).
cnf(c_329,plain,
greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X0,X1),X2)) = greatest_lower_bound(X0,X2),
inference(superposition,[status(thm)],[c_60,c_55]) ).
cnf(c_330,plain,
greatest_lower_bound(sP1_iProver_def,greatest_lower_bound(sP4_iProver_def,X0)) = greatest_lower_bound(sP5_iProver_def,X0),
inference(superposition,[status(thm)],[c_135,c_55]) ).
cnf(c_331,plain,
greatest_lower_bound(sP0_iProver_def,greatest_lower_bound(sP1_iProver_def,X0)) = greatest_lower_bound(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_250,c_55]) ).
cnf(c_361,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(identity,X0)) = least_upper_bound(sP1_iProver_def,X0),
inference(superposition,[status(thm)],[c_232,c_56]) ).
cnf(c_362,plain,
least_upper_bound(sP1_iProver_def,least_upper_bound(sP5_iProver_def,X0)) = least_upper_bound(sP1_iProver_def,X0),
inference(superposition,[status(thm)],[c_243,c_56]) ).
cnf(c_414,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_66,c_67]) ).
cnf(c_426,plain,
least_upper_bound(sP4_iProver_def,least_upper_bound(X0,sP5_iProver_def)) = least_upper_bound(X0,sP4_iProver_def),
inference(superposition,[status(thm)],[c_264,c_226]) ).
cnf(c_440,plain,
greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X2,X0))) = X0,
inference(superposition,[status(thm)],[c_56,c_244]) ).
cnf(c_564,plain,
multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_50,c_321]) ).
cnf(c_641,plain,
multiply(a,least_upper_bound(b,X0)) = least_upper_bound(sP0_iProver_def,multiply(a,X0)),
inference(superposition,[status(thm)],[c_130,c_61]) ).
cnf(c_643,plain,
multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[status(thm)],[c_66,c_61]) ).
cnf(c_1187,plain,
least_upper_bound(sP0_iProver_def,sP3_iProver_def) = least_upper_bound(sP3_iProver_def,sP1_iProver_def),
inference(superposition,[status(thm)],[c_256,c_288]) ).
cnf(c_1199,plain,
least_upper_bound(sP0_iProver_def,sP3_iProver_def) = least_upper_bound(sP1_iProver_def,sP3_iProver_def),
inference(theory_normalisation,[status(thm)],[c_1187,c_56,c_54,c_55,c_53]) ).
cnf(c_1550,plain,
greatest_lower_bound(sP1_iProver_def,least_upper_bound(X0,least_upper_bound(sP0_iProver_def,sP3_iProver_def))) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_1199,c_294]) ).
cnf(c_1867,plain,
greatest_lower_bound(sP0_iProver_def,sP4_iProver_def) = greatest_lower_bound(sP0_iProver_def,sP5_iProver_def),
inference(superposition,[status(thm)],[c_135,c_331]) ).
cnf(c_2975,plain,
least_upper_bound(sP0_iProver_def,sP2_iProver_def) = least_upper_bound(sP1_iProver_def,a),
inference(superposition,[status(thm)],[c_132,c_361]) ).
cnf(c_2976,plain,
least_upper_bound(sP0_iProver_def,sP3_iProver_def) = least_upper_bound(sP1_iProver_def,b),
inference(superposition,[status(thm)],[c_133,c_361]) ).
cnf(c_3548,plain,
greatest_lower_bound(sP5_iProver_def,least_upper_bound(sP1_iProver_def,X0)) = sP5_iProver_def,
inference(superposition,[status(thm)],[c_362,c_294]) ).
cnf(c_3858,plain,
greatest_lower_bound(sP5_iProver_def,least_upper_bound(X0,least_upper_bound(sP1_iProver_def,X1))) = sP5_iProver_def,
inference(superposition,[status(thm)],[c_226,c_3548]) ).
cnf(c_3874,plain,
greatest_lower_bound(sP5_iProver_def,least_upper_bound(sP0_iProver_def,sP2_iProver_def)) = sP5_iProver_def,
inference(superposition,[status(thm)],[c_2975,c_3548]) ).
cnf(c_3944,plain,
least_upper_bound(least_upper_bound(sP0_iProver_def,sP2_iProver_def),sP5_iProver_def) = least_upper_bound(sP0_iProver_def,sP2_iProver_def),
inference(superposition,[status(thm)],[c_3874,c_240]) ).
cnf(c_3952,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(sP2_iProver_def,sP5_iProver_def)) = least_upper_bound(sP0_iProver_def,sP2_iProver_def),
inference(theory_normalisation,[status(thm)],[c_3944,c_56,c_54,c_55,c_53]) ).
cnf(c_7680,plain,
greatest_lower_bound(sP1_iProver_def,least_upper_bound(sP0_iProver_def,least_upper_bound(X0,sP3_iProver_def))) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_226,c_1550]) ).
cnf(c_11451,plain,
greatest_lower_bound(sP5_iProver_def,least_upper_bound(X0,least_upper_bound(sP0_iProver_def,sP3_iProver_def))) = sP5_iProver_def,
inference(superposition,[status(thm)],[c_2976,c_3858]) ).
cnf(c_15839,plain,
greatest_lower_bound(sP5_iProver_def,least_upper_bound(sP0_iProver_def,least_upper_bound(X0,sP3_iProver_def))) = sP5_iProver_def,
inference(superposition,[status(thm)],[c_226,c_11451]) ).
cnf(c_17409,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_414,c_65]) ).
cnf(c_17412,plain,
multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[status(thm)],[c_50,c_17409]) ).
cnf(c_17420,plain,
multiply(inverse(sP2_iProver_def),sP4_iProver_def) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_134,c_17409]) ).
cnf(c_19930,plain,
multiply(a,least_upper_bound(b,identity)) = least_upper_bound(sP0_iProver_def,a),
inference(superposition,[status(thm)],[c_564,c_641]) ).
cnf(c_19950,plain,
multiply(a,least_upper_bound(identity,b)) = least_upper_bound(sP0_iProver_def,a),
inference(theory_normalisation,[status(thm)],[c_19930,c_56,c_54,c_55,c_53]) ).
cnf(c_19951,plain,
multiply(a,sP3_iProver_def) = least_upper_bound(sP0_iProver_def,a),
inference(light_normalisation,[status(thm)],[c_19950,c_133]) ).
cnf(c_20020,plain,
greatest_lower_bound(sP0_iProver_def,least_upper_bound(X0,multiply(a,sP3_iProver_def))) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_19951,c_294]) ).
cnf(c_20022,plain,
greatest_lower_bound(a,least_upper_bound(X0,multiply(a,sP3_iProver_def))) = a,
inference(superposition,[status(thm)],[c_19951,c_440]) ).
cnf(c_20113,plain,
greatest_lower_bound(sP0_iProver_def,multiply(least_upper_bound(X0,a),sP3_iProver_def)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_63,c_20020]) ).
cnf(c_20158,plain,
greatest_lower_bound(a,multiply(least_upper_bound(X0,a),sP3_iProver_def)) = a,
inference(superposition,[status(thm)],[c_63,c_20022]) ).
cnf(c_20937,plain,
greatest_lower_bound(sP0_iProver_def,multiply(sP2_iProver_def,sP3_iProver_def)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_132,c_20113]) ).
cnf(c_20961,plain,
greatest_lower_bound(sP0_iProver_def,sP4_iProver_def) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_20937,c_134]) ).
cnf(c_20967,plain,
greatest_lower_bound(sP0_iProver_def,sP5_iProver_def) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_1867,c_20961]) ).
cnf(c_21127,plain,
least_upper_bound(sP5_iProver_def,least_upper_bound(X0,sP0_iProver_def)) = least_upper_bound(X0,sP5_iProver_def),
inference(superposition,[status(thm)],[c_20967,c_287]) ).
cnf(c_21142,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(X0,sP5_iProver_def)) = least_upper_bound(X0,sP5_iProver_def),
inference(theory_normalisation,[status(thm)],[c_21127,c_56,c_54,c_55,c_53]) ).
cnf(c_21145,plain,
least_upper_bound(sP0_iProver_def,sP2_iProver_def) = least_upper_bound(sP2_iProver_def,sP5_iProver_def),
inference(demodulation,[status(thm)],[c_3952,c_21142]) ).
cnf(c_21567,plain,
least_upper_bound(sP4_iProver_def,least_upper_bound(sP0_iProver_def,sP2_iProver_def)) = least_upper_bound(sP2_iProver_def,sP4_iProver_def),
inference(superposition,[status(thm)],[c_21145,c_426]) ).
cnf(c_21579,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(sP2_iProver_def,sP4_iProver_def)) = least_upper_bound(sP2_iProver_def,sP4_iProver_def),
inference(theory_normalisation,[status(thm)],[c_21567,c_56,c_54,c_55,c_53]) ).
cnf(c_22042,plain,
greatest_lower_bound(a,multiply(sP2_iProver_def,sP3_iProver_def)) = a,
inference(superposition,[status(thm)],[c_132,c_20158]) ).
cnf(c_22066,plain,
greatest_lower_bound(a,sP4_iProver_def) = a,
inference(light_normalisation,[status(thm)],[c_22042,c_134]) ).
cnf(c_22067,plain,
greatest_lower_bound(sP4_iProver_def,a) = a,
inference(theory_normalisation,[status(thm)],[c_22066,c_56,c_54,c_55,c_53]) ).
cnf(c_22113,plain,
least_upper_bound(sP4_iProver_def,a) = sP4_iProver_def,
inference(superposition,[status(thm)],[c_22067,c_59]) ).
cnf(c_22172,plain,
least_upper_bound(identity,sP4_iProver_def) = least_upper_bound(sP4_iProver_def,sP2_iProver_def),
inference(superposition,[status(thm)],[c_22113,c_285]) ).
cnf(c_22178,plain,
least_upper_bound(sP2_iProver_def,sP4_iProver_def) = least_upper_bound(sP4_iProver_def,identity),
inference(theory_normalisation,[status(thm)],[c_22172,c_56,c_54,c_55,c_53]) ).
cnf(c_22514,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(sP2_iProver_def,sP4_iProver_def)) = least_upper_bound(sP4_iProver_def,sP1_iProver_def),
inference(superposition,[status(thm)],[c_22178,c_288]) ).
cnf(c_22518,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(sP2_iProver_def,sP4_iProver_def)) = least_upper_bound(sP1_iProver_def,sP4_iProver_def),
inference(theory_normalisation,[status(thm)],[c_22514,c_56,c_54,c_55,c_53]) ).
cnf(c_22519,plain,
least_upper_bound(sP1_iProver_def,sP4_iProver_def) = least_upper_bound(sP2_iProver_def,sP4_iProver_def),
inference(light_normalisation,[status(thm)],[c_22518,c_21579]) ).
cnf(c_27681,plain,
multiply(inverse(sP2_iProver_def),least_upper_bound(sP2_iProver_def,sP4_iProver_def)) = least_upper_bound(identity,sP3_iProver_def),
inference(superposition,[status(thm)],[c_17420,c_643]) ).
cnf(c_27728,plain,
multiply(inverse(sP2_iProver_def),least_upper_bound(sP2_iProver_def,sP4_iProver_def)) = least_upper_bound(sP3_iProver_def,identity),
inference(theory_normalisation,[status(thm)],[c_27681,c_56,c_54,c_55,c_53]) ).
cnf(c_27729,plain,
multiply(inverse(sP2_iProver_def),least_upper_bound(sP1_iProver_def,sP4_iProver_def)) = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_27728,c_256,c_22519]) ).
cnf(c_28964,plain,
multiply(sP2_iProver_def,sP3_iProver_def) = least_upper_bound(sP1_iProver_def,sP4_iProver_def),
inference(superposition,[status(thm)],[c_27729,c_17412]) ).
cnf(c_28968,plain,
least_upper_bound(sP1_iProver_def,sP4_iProver_def) = sP4_iProver_def,
inference(light_normalisation,[status(thm)],[c_28964,c_134]) ).
cnf(c_29003,plain,
greatest_lower_bound(sP1_iProver_def,greatest_lower_bound(sP4_iProver_def,X0)) = greatest_lower_bound(sP1_iProver_def,X0),
inference(superposition,[status(thm)],[c_28968,c_329]) ).
cnf(c_29035,plain,
greatest_lower_bound(sP1_iProver_def,X0) = greatest_lower_bound(sP5_iProver_def,X0),
inference(demodulation,[status(thm)],[c_330,c_29003]) ).
cnf(c_29060,plain,
greatest_lower_bound(sP1_iProver_def,least_upper_bound(sP0_iProver_def,least_upper_bound(X0,sP3_iProver_def))) = sP5_iProver_def,
inference(demodulation,[status(thm)],[c_15839,c_29035]) ).
cnf(c_29061,plain,
sP1_iProver_def = sP5_iProver_def,
inference(light_normalisation,[status(thm)],[c_29060,c_7680]) ).
cnf(c_29108,plain,
sP1_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_136,c_29061]) ).
cnf(c_29109,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_29108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP185-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 00:08:28 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 8.03/1.66 % SZS status Started for theBenchmark.p
% 8.03/1.66 % SZS status Unsatisfiable for theBenchmark.p
% 8.03/1.66
% 8.03/1.66 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.03/1.66
% 8.03/1.66 ------ iProver source info
% 8.03/1.66
% 8.03/1.66 git: date: 2024-05-02 19:28:25 +0000
% 8.03/1.66 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.03/1.66 git: non_committed_changes: false
% 8.03/1.66
% 8.03/1.66 ------ Parsing...successful
% 8.03/1.66
% 8.03/1.66
% 8.03/1.66
% 8.03/1.66 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 8.03/1.66
% 8.03/1.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.03/1.66
% 8.03/1.66 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 8.03/1.66 ------ Proving...
% 8.03/1.66 ------ Problem Properties
% 8.03/1.66
% 8.03/1.66
% 8.03/1.66 clauses 25
% 8.03/1.66 conjectures 1
% 8.03/1.66 EPR 1
% 8.03/1.66 Horn 25
% 8.03/1.66 unary 25
% 8.03/1.66 binary 0
% 8.03/1.66 lits 25
% 8.03/1.66 lits eq 25
% 8.03/1.66 fd_pure 0
% 8.03/1.66 fd_pseudo 0
% 8.03/1.66 fd_cond 0
% 8.03/1.66 fd_pseudo_cond 0
% 8.03/1.66 AC symbols 2
% 8.03/1.66
% 8.03/1.66 ------ Input Options Time Limit: Unbounded
% 8.03/1.66
% 8.03/1.66
% 8.03/1.66 ------
% 8.03/1.66 Current options:
% 8.03/1.66 ------
% 8.03/1.66
% 8.03/1.66
% 8.03/1.66
% 8.03/1.66
% 8.03/1.66 ------ Proving...
% 8.03/1.66
% 8.03/1.66
% 8.03/1.66 % SZS status Unsatisfiable for theBenchmark.p
% 8.03/1.66
% 8.03/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.03/1.66
% 8.03/1.67
%------------------------------------------------------------------------------