TSTP Solution File: GRP179-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP179-2 : 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:37 EDT 2024
% Result : Unsatisfiable 90.57s 12.19s
% Output : CNFRefutation 90.57s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
inverse(greatest_lower_bound(a,identity)) != least_upper_bound(inverse(a),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p18) ).
cnf(c_50,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_51,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_52,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_53,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_55,plain,
greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
cnf(c_56,plain,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(c_57,plain,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_58,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_59,plain,
greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(c_60,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_61,plain,
greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(c_62,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_63,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_64,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_80,negated_conjecture,
inverse(greatest_lower_bound(identity,a)) != least_upper_bound(identity,inverse(a)),
inference(theory_normalisation,[status(thm)],[c_49,c_52,c_50,c_53,c_51]) ).
cnf(c_119,plain,
greatest_lower_bound(identity,a) = sP0_iProver_def,
definition ).
cnf(c_120,plain,
inverse(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_121,plain,
inverse(a) = sP2_iProver_def,
definition ).
cnf(c_122,plain,
least_upper_bound(identity,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_123,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_80,c_121,c_122,c_119,c_120]) ).
cnf(c_203,plain,
least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[status(thm)],[c_53,c_51]) ).
cnf(c_204,plain,
greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_209,plain,
least_upper_bound(sP2_iProver_def,identity) = sP3_iProver_def,
inference(theory_normalisation,[status(thm)],[c_122,c_53,c_51,c_52,c_50]) ).
cnf(c_215,plain,
least_upper_bound(sP2_iProver_def,least_upper_bound(X0,identity)) = least_upper_bound(X0,sP3_iProver_def),
inference(superposition,[status(thm)],[c_209,c_203]) ).
cnf(c_224,plain,
multiply(sP2_iProver_def,a) = identity,
inference(superposition,[status(thm)],[c_121,c_63]) ).
cnf(c_225,plain,
multiply(sP1_iProver_def,sP0_iProver_def) = identity,
inference(superposition,[status(thm)],[c_120,c_63]) ).
cnf(c_226,plain,
least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_229,plain,
least_upper_bound(identity,sP0_iProver_def) = identity,
inference(superposition,[status(thm)],[c_119,c_56]) ).
cnf(c_232,plain,
least_upper_bound(sP0_iProver_def,identity) = identity,
inference(theory_normalisation,[status(thm)],[c_229,c_53,c_51,c_52,c_50]) ).
cnf(c_237,plain,
greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_51,c_57]) ).
cnf(c_282,plain,
greatest_lower_bound(identity,sP3_iProver_def) = identity,
inference(superposition,[status(thm)],[c_209,c_237]) ).
cnf(c_288,plain,
greatest_lower_bound(sP3_iProver_def,identity) = identity,
inference(theory_normalisation,[status(thm)],[c_282,c_53,c_51,c_52,c_50]) ).
cnf(c_308,plain,
greatest_lower_bound(identity,greatest_lower_bound(X0,a)) = greatest_lower_bound(X0,sP0_iProver_def),
inference(superposition,[status(thm)],[c_119,c_204]) ).
cnf(c_377,plain,
least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = X0,
inference(superposition,[status(thm)],[c_52,c_226]) ).
cnf(c_426,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_63,c_64]) ).
cnf(c_427,plain,
multiply(sP2_iProver_def,multiply(a,X0)) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_224,c_64]) ).
cnf(c_428,plain,
multiply(sP1_iProver_def,multiply(sP0_iProver_def,X0)) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_225,c_64]) ).
cnf(c_429,plain,
multiply(sP1_iProver_def,multiply(sP0_iProver_def,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_428,c_62]) ).
cnf(c_430,plain,
multiply(sP2_iProver_def,multiply(a,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_427,c_62]) ).
cnf(c_444,plain,
multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[status(thm)],[c_63,c_58]) ).
cnf(c_446,plain,
least_upper_bound(identity,multiply(sP2_iProver_def,X0)) = multiply(sP2_iProver_def,least_upper_bound(a,X0)),
inference(superposition,[status(thm)],[c_224,c_58]) ).
cnf(c_447,plain,
least_upper_bound(identity,multiply(sP1_iProver_def,X0)) = multiply(sP1_iProver_def,least_upper_bound(sP0_iProver_def,X0)),
inference(superposition,[status(thm)],[c_225,c_58]) ).
cnf(c_733,plain,
greatest_lower_bound(identity,multiply(sP2_iProver_def,X0)) = multiply(sP2_iProver_def,greatest_lower_bound(a,X0)),
inference(superposition,[status(thm)],[c_224,c_59]) ).
cnf(c_809,plain,
least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_62,c_60]) ).
cnf(c_813,plain,
least_upper_bound(identity,multiply(X0,sP0_iProver_def)) = multiply(least_upper_bound(sP1_iProver_def,X0),sP0_iProver_def),
inference(superposition,[status(thm)],[c_225,c_60]) ).
cnf(c_909,plain,
greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_62,c_61]) ).
cnf(c_913,plain,
greatest_lower_bound(identity,multiply(X0,sP0_iProver_def)) = multiply(greatest_lower_bound(sP1_iProver_def,X0),sP0_iProver_def),
inference(superposition,[status(thm)],[c_225,c_61]) ).
cnf(c_917,plain,
multiply(greatest_lower_bound(X0,inverse(X1)),X1) = greatest_lower_bound(multiply(X0,X1),identity),
inference(superposition,[status(thm)],[c_63,c_61]) ).
cnf(c_939,plain,
multiply(greatest_lower_bound(X0,inverse(X1)),X1) = greatest_lower_bound(identity,multiply(X0,X1)),
inference(theory_normalisation,[status(thm)],[c_917,c_53,c_51,c_52,c_50]) ).
cnf(c_7409,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_426,c_62]) ).
cnf(c_7413,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_63,c_7409]) ).
cnf(c_7418,plain,
multiply(inverse(sP2_iProver_def),X0) = multiply(a,X0),
inference(superposition,[status(thm)],[c_430,c_7409]) ).
cnf(c_7420,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_7409,c_7409]) ).
cnf(c_7497,plain,
multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_7413,c_7420]) ).
cnf(c_7504,plain,
greatest_lower_bound(X0,multiply(X0,X1)) = multiply(X0,greatest_lower_bound(identity,X1)),
inference(superposition,[status(thm)],[c_7497,c_59]) ).
cnf(c_7569,plain,
multiply(a,multiply(sP2_iProver_def,X0)) = X0,
inference(superposition,[status(thm)],[c_7418,c_7409]) ).
cnf(c_8776,plain,
inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_7420,c_7497]) ).
cnf(c_8777,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_8776,c_7497]) ).
cnf(c_9911,plain,
multiply(sP2_iProver_def,least_upper_bound(a,identity)) = least_upper_bound(identity,sP2_iProver_def),
inference(superposition,[status(thm)],[c_7497,c_446]) ).
cnf(c_9935,plain,
multiply(sP2_iProver_def,least_upper_bound(identity,a)) = least_upper_bound(sP2_iProver_def,identity),
inference(theory_normalisation,[status(thm)],[c_9911,c_53,c_51,c_52,c_50]) ).
cnf(c_9936,plain,
multiply(sP2_iProver_def,least_upper_bound(identity,a)) = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_9935,c_209]) ).
cnf(c_10843,plain,
least_upper_bound(identity,a) = multiply(a,sP3_iProver_def),
inference(superposition,[status(thm)],[c_9936,c_7569]) ).
cnf(c_10866,plain,
greatest_lower_bound(identity,multiply(a,sP3_iProver_def)) = identity,
inference(superposition,[status(thm)],[c_10843,c_57]) ).
cnf(c_11730,plain,
multiply(sP1_iProver_def,least_upper_bound(sP0_iProver_def,identity)) = least_upper_bound(identity,sP1_iProver_def),
inference(superposition,[status(thm)],[c_7497,c_447]) ).
cnf(c_11754,plain,
multiply(sP1_iProver_def,least_upper_bound(sP0_iProver_def,identity)) = least_upper_bound(sP1_iProver_def,identity),
inference(theory_normalisation,[status(thm)],[c_11730,c_53,c_51,c_52,c_50]) ).
cnf(c_11755,plain,
least_upper_bound(sP1_iProver_def,identity) = multiply(sP1_iProver_def,identity),
inference(light_normalisation,[status(thm)],[c_11754,c_232]) ).
cnf(c_11948,plain,
least_upper_bound(sP1_iProver_def,identity) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_11755,c_7497]) ).
cnf(c_11967,plain,
least_upper_bound(sP1_iProver_def,sP3_iProver_def) = least_upper_bound(sP2_iProver_def,sP1_iProver_def),
inference(superposition,[status(thm)],[c_11948,c_215]) ).
cnf(c_11970,plain,
least_upper_bound(sP1_iProver_def,sP2_iProver_def) = least_upper_bound(sP1_iProver_def,sP3_iProver_def),
inference(theory_normalisation,[status(thm)],[c_11967,c_53,c_51,c_52,c_50]) ).
cnf(c_12337,plain,
greatest_lower_bound(sP3_iProver_def,least_upper_bound(sP1_iProver_def,sP2_iProver_def)) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_11970,c_237]) ).
cnf(c_19724,plain,
least_upper_bound(identity,multiply(inverse(X0),greatest_lower_bound(X0,X1))) = multiply(inverse(X0),X0),
inference(superposition,[status(thm)],[c_56,c_444]) ).
cnf(c_19743,plain,
multiply(inverse(X0),least_upper_bound(X0,identity)) = least_upper_bound(identity,inverse(X0)),
inference(superposition,[status(thm)],[c_7497,c_444]) ).
cnf(c_19795,plain,
least_upper_bound(identity,multiply(inverse(X0),greatest_lower_bound(X0,X1))) = identity,
inference(light_normalisation,[status(thm)],[c_19724,c_63]) ).
cnf(c_22784,plain,
least_upper_bound(identity,multiply(inverse(sP3_iProver_def),identity)) = identity,
inference(superposition,[status(thm)],[c_288,c_19795]) ).
cnf(c_23049,plain,
least_upper_bound(identity,inverse(sP3_iProver_def)) = identity,
inference(demodulation,[status(thm)],[c_22784,c_444,c_19743]) ).
cnf(c_23060,plain,
greatest_lower_bound(inverse(sP3_iProver_def),identity) = inverse(sP3_iProver_def),
inference(superposition,[status(thm)],[c_23049,c_237]) ).
cnf(c_23079,plain,
greatest_lower_bound(identity,inverse(sP3_iProver_def)) = inverse(sP3_iProver_def),
inference(theory_normalisation,[status(thm)],[c_23060,c_53,c_51,c_52,c_50]) ).
cnf(c_23210,plain,
greatest_lower_bound(identity,greatest_lower_bound(inverse(sP3_iProver_def),X0)) = greatest_lower_bound(inverse(sP3_iProver_def),X0),
inference(superposition,[status(thm)],[c_23079,c_52]) ).
cnf(c_33144,plain,
multiply(sP2_iProver_def,greatest_lower_bound(a,identity)) = greatest_lower_bound(identity,sP2_iProver_def),
inference(superposition,[status(thm)],[c_7497,c_733]) ).
cnf(c_33176,plain,
multiply(sP2_iProver_def,greatest_lower_bound(identity,a)) = greatest_lower_bound(sP2_iProver_def,identity),
inference(theory_normalisation,[status(thm)],[c_33144,c_53,c_51,c_52,c_50]) ).
cnf(c_33177,plain,
greatest_lower_bound(sP2_iProver_def,identity) = multiply(sP2_iProver_def,sP0_iProver_def),
inference(light_normalisation,[status(thm)],[c_33176,c_119]) ).
cnf(c_33588,plain,
least_upper_bound(identity,greatest_lower_bound(X0,multiply(sP2_iProver_def,sP0_iProver_def))) = identity,
inference(superposition,[status(thm)],[c_33177,c_377]) ).
cnf(c_39128,plain,
multiply(least_upper_bound(identity,sP2_iProver_def),a) = least_upper_bound(a,identity),
inference(superposition,[status(thm)],[c_224,c_809]) ).
cnf(c_39275,plain,
multiply(least_upper_bound(sP2_iProver_def,identity),a) = least_upper_bound(identity,a),
inference(theory_normalisation,[status(thm)],[c_39128,c_53,c_51,c_52,c_50]) ).
cnf(c_39276,plain,
multiply(a,sP3_iProver_def) = multiply(sP3_iProver_def,a),
inference(light_normalisation,[status(thm)],[c_39275,c_209,c_10843]) ).
cnf(c_41082,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(X0,sP2_iProver_def),sP0_iProver_def)) = identity,
inference(superposition,[status(thm)],[c_61,c_33588]) ).
cnf(c_41874,plain,
multiply(least_upper_bound(sP1_iProver_def,greatest_lower_bound(X0,sP2_iProver_def)),sP0_iProver_def) = identity,
inference(demodulation,[status(thm)],[c_41082,c_813]) ).
cnf(c_41882,plain,
multiply(least_upper_bound(sP1_iProver_def,sP2_iProver_def),sP0_iProver_def) = identity,
inference(superposition,[status(thm)],[c_55,c_41874]) ).
cnf(c_42056,plain,
multiply(inverse(least_upper_bound(sP1_iProver_def,sP2_iProver_def)),identity) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_41882,c_7409]) ).
cnf(c_42320,plain,
inverse(least_upper_bound(sP1_iProver_def,sP2_iProver_def)) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_42056,c_7497]) ).
cnf(c_42329,plain,
least_upper_bound(sP1_iProver_def,sP2_iProver_def) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_42320,c_8777]) ).
cnf(c_42339,plain,
least_upper_bound(sP1_iProver_def,sP2_iProver_def) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_42329,c_120]) ).
cnf(c_42350,plain,
greatest_lower_bound(sP3_iProver_def,sP1_iProver_def) = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_12337,c_42339]) ).
cnf(c_42352,plain,
greatest_lower_bound(sP1_iProver_def,sP3_iProver_def) = sP3_iProver_def,
inference(theory_normalisation,[status(thm)],[c_42350,c_53,c_51,c_52,c_50]) ).
cnf(c_80442,plain,
greatest_lower_bound(sP3_iProver_def,multiply(sP3_iProver_def,a)) = multiply(greatest_lower_bound(identity,a),sP3_iProver_def),
inference(superposition,[status(thm)],[c_39276,c_909]) ).
cnf(c_80580,plain,
greatest_lower_bound(sP3_iProver_def,multiply(sP3_iProver_def,a)) = multiply(sP0_iProver_def,sP3_iProver_def),
inference(light_normalisation,[status(thm)],[c_80442,c_119]) ).
cnf(c_90317,plain,
multiply(sP0_iProver_def,sP3_iProver_def) = multiply(sP3_iProver_def,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_80580,c_119,c_7504]) ).
cnf(c_90324,plain,
multiply(inverse(sP3_iProver_def),multiply(sP0_iProver_def,sP3_iProver_def)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_90317,c_7409]) ).
cnf(c_90346,plain,
greatest_lower_bound(identity,multiply(sP0_iProver_def,sP3_iProver_def)) = multiply(greatest_lower_bound(sP1_iProver_def,sP3_iProver_def),sP0_iProver_def),
inference(superposition,[status(thm)],[c_90317,c_913]) ).
cnf(c_90353,plain,
greatest_lower_bound(identity,multiply(sP0_iProver_def,sP3_iProver_def)) = multiply(sP0_iProver_def,sP3_iProver_def),
inference(light_normalisation,[status(thm)],[c_90346,c_42352,c_90317]) ).
cnf(c_111812,plain,
multiply(inverse(sP3_iProver_def),greatest_lower_bound(identity,multiply(sP0_iProver_def,sP3_iProver_def))) = greatest_lower_bound(inverse(sP3_iProver_def),sP0_iProver_def),
inference(superposition,[status(thm)],[c_90324,c_7504]) ).
cnf(c_112025,plain,
multiply(inverse(sP3_iProver_def),greatest_lower_bound(identity,multiply(sP0_iProver_def,sP3_iProver_def))) = greatest_lower_bound(sP0_iProver_def,inverse(sP3_iProver_def)),
inference(theory_normalisation,[status(thm)],[c_111812,c_53,c_51,c_52,c_50]) ).
cnf(c_112026,plain,
greatest_lower_bound(sP0_iProver_def,inverse(sP3_iProver_def)) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_112025,c_90324,c_90353]) ).
cnf(c_245668,plain,
greatest_lower_bound(inverse(sP3_iProver_def),a) = greatest_lower_bound(inverse(sP3_iProver_def),sP0_iProver_def),
inference(superposition,[status(thm)],[c_23210,c_308]) ).
cnf(c_245764,plain,
greatest_lower_bound(a,inverse(sP3_iProver_def)) = greatest_lower_bound(sP0_iProver_def,inverse(sP3_iProver_def)),
inference(theory_normalisation,[status(thm)],[c_245668,c_53,c_51,c_52,c_50]) ).
cnf(c_245765,plain,
greatest_lower_bound(a,inverse(sP3_iProver_def)) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_245764,c_112026]) ).
cnf(c_246668,plain,
greatest_lower_bound(identity,multiply(a,sP3_iProver_def)) = multiply(sP0_iProver_def,sP3_iProver_def),
inference(superposition,[status(thm)],[c_245765,c_939]) ).
cnf(c_246703,plain,
multiply(sP0_iProver_def,sP3_iProver_def) = identity,
inference(light_normalisation,[status(thm)],[c_246668,c_10866]) ).
cnf(c_246808,plain,
multiply(sP1_iProver_def,identity) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_246703,c_429]) ).
cnf(c_247222,plain,
sP1_iProver_def = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_246808,c_7497]) ).
cnf(c_247223,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_247222,c_123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP179-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 00:02:13 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running UEQ theorem proving
% 0.20/0.48 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
% 90.57/12.19 % SZS status Started for theBenchmark.p
% 90.57/12.19 % SZS status Unsatisfiable for theBenchmark.p
% 90.57/12.19
% 90.57/12.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 90.57/12.19
% 90.57/12.19 ------ iProver source info
% 90.57/12.19
% 90.57/12.19 git: date: 2024-05-02 19:28:25 +0000
% 90.57/12.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 90.57/12.19 git: non_committed_changes: false
% 90.57/12.19
% 90.57/12.19 ------ Parsing...successful
% 90.57/12.19
% 90.57/12.19
% 90.57/12.19
% 90.57/12.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 90.57/12.19
% 90.57/12.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 90.57/12.19
% 90.57/12.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 90.57/12.19 ------ Proving...
% 90.57/12.19 ------ Problem Properties
% 90.57/12.19
% 90.57/12.19
% 90.57/12.19 clauses 20
% 90.57/12.19 conjectures 1
% 90.57/12.19 EPR 1
% 90.57/12.19 Horn 20
% 90.57/12.19 unary 20
% 90.57/12.19 binary 0
% 90.57/12.19 lits 20
% 90.57/12.19 lits eq 20
% 90.57/12.19 fd_pure 0
% 90.57/12.19 fd_pseudo 0
% 90.57/12.19 fd_cond 0
% 90.57/12.19 fd_pseudo_cond 0
% 90.57/12.19 AC symbols 2
% 90.57/12.19
% 90.57/12.19 ------ Input Options Time Limit: Unbounded
% 90.57/12.19
% 90.57/12.19
% 90.57/12.19 ------
% 90.57/12.19 Current options:
% 90.57/12.19 ------
% 90.57/12.19
% 90.57/12.19
% 90.57/12.19
% 90.57/12.19
% 90.57/12.19 ------ Proving...
% 90.57/12.19
% 90.57/12.19
% 90.57/12.19 % SZS status Unsatisfiable for theBenchmark.p
% 90.57/12.19
% 90.57/12.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 90.57/12.19
% 90.57/12.20
%------------------------------------------------------------------------------