TSTP Solution File: GRP167-4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP167-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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 : Mon Jun 24 06:58:26 EDT 2024
% Result : Unsatisfiable 14.90s 2.65s
% Output : CNFRefutation 14.90s
% 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',p19_1) ).
cnf(c_50,plain,
inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p19_2) ).
cnf(c_51,plain,
multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p19_3) ).
cnf(c_52,negated_conjecture,
multiply(least_upper_bound(a,identity),greatest_lower_bound(a,identity)) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p19) ).
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_62,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_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_64,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_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,
multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a)) != a,
inference(theory_normalisation,[status(thm)],[c_52,c_55,c_53,c_56,c_54]) ).
cnf(c_130,plain,
least_upper_bound(identity,a) = sP0_iProver_def,
definition ).
cnf(c_131,plain,
greatest_lower_bound(identity,a) = sP1_iProver_def,
definition ).
cnf(c_132,plain,
multiply(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_133,negated_conjecture,
sP2_iProver_def != a,
inference(demodulation,[status(thm)],[c_85,c_131,c_130,c_132]) ).
cnf(c_224,plain,
multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_50,c_66]) ).
cnf(c_226,plain,
least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_53,c_59]) ).
cnf(c_229,plain,
least_upper_bound(identity,sP1_iProver_def) = identity,
inference(superposition,[status(thm)],[c_131,c_59]) ).
cnf(c_230,plain,
least_upper_bound(sP1_iProver_def,identity) = identity,
inference(theory_normalisation,[status(thm)],[c_229,c_56,c_54,c_55,c_53]) ).
cnf(c_231,plain,
greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_54,c_60]) ).
cnf(c_235,plain,
greatest_lower_bound(identity,sP0_iProver_def) = identity,
inference(superposition,[status(thm)],[c_130,c_60]) ).
cnf(c_237,plain,
greatest_lower_bound(sP0_iProver_def,identity) = identity,
inference(theory_normalisation,[status(thm)],[c_235,c_56,c_54,c_55,c_53]) ).
cnf(c_250,plain,
inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_251,plain,
inverse(multiply(inverse(X0),X1)) = multiply(inverse(X1),X0),
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_256,plain,
multiply(inverse(X0),identity) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_250,c_65]) ).
cnf(c_265,plain,
greatest_lower_bound(identity,greatest_lower_bound(a,X0)) = greatest_lower_bound(sP1_iProver_def,X0),
inference(superposition,[status(thm)],[c_131,c_55]) ).
cnf(c_283,plain,
least_upper_bound(identity,least_upper_bound(a,X0)) = least_upper_bound(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_130,c_56]) ).
cnf(c_300,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_66,c_67]) ).
cnf(c_302,plain,
multiply(X0,multiply(inverse(X0),X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_224,c_67]) ).
cnf(c_441,plain,
least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_65,c_63]) ).
cnf(c_482,plain,
greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_65,c_64]) ).
cnf(c_525,plain,
multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_50,c_256]) ).
cnf(c_541,plain,
greatest_lower_bound(X0,multiply(X0,X1)) = multiply(X0,greatest_lower_bound(identity,X1)),
inference(superposition,[status(thm)],[c_525,c_62]) ).
cnf(c_542,plain,
least_upper_bound(X0,multiply(X0,X1)) = multiply(X0,least_upper_bound(identity,X1)),
inference(superposition,[status(thm)],[c_525,c_61]) ).
cnf(c_586,plain,
greatest_lower_bound(sP1_iProver_def,least_upper_bound(a,X0)) = greatest_lower_bound(identity,a),
inference(superposition,[status(thm)],[c_60,c_265]) ).
cnf(c_596,plain,
greatest_lower_bound(sP1_iProver_def,least_upper_bound(a,X0)) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_586,c_131]) ).
cnf(c_629,plain,
least_upper_bound(least_upper_bound(a,X0),sP1_iProver_def) = least_upper_bound(a,X0),
inference(superposition,[status(thm)],[c_596,c_226]) ).
cnf(c_632,plain,
least_upper_bound(sP1_iProver_def,least_upper_bound(X0,a)) = least_upper_bound(a,X0),
inference(theory_normalisation,[status(thm)],[c_629,c_56,c_54,c_55,c_53]) ).
cnf(c_835,plain,
least_upper_bound(sP0_iProver_def,greatest_lower_bound(a,X0)) = least_upper_bound(identity,a),
inference(superposition,[status(thm)],[c_59,c_283]) ).
cnf(c_846,plain,
least_upper_bound(sP0_iProver_def,greatest_lower_bound(a,X0)) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_835,c_130]) ).
cnf(c_891,plain,
greatest_lower_bound(greatest_lower_bound(a,X0),sP0_iProver_def) = greatest_lower_bound(a,X0),
inference(superposition,[status(thm)],[c_846,c_231]) ).
cnf(c_894,plain,
greatest_lower_bound(sP0_iProver_def,greatest_lower_bound(X0,a)) = greatest_lower_bound(a,X0),
inference(theory_normalisation,[status(thm)],[c_891,c_56,c_54,c_55,c_53]) ).
cnf(c_3182,plain,
multiply(inverse(sP0_iProver_def),sP2_iProver_def) = multiply(identity,sP1_iProver_def),
inference(superposition,[status(thm)],[c_132,c_300]) ).
cnf(c_3242,plain,
inverse(multiply(identity,sP1_iProver_def)) = multiply(inverse(sP2_iProver_def),sP0_iProver_def),
inference(superposition,[status(thm)],[c_3182,c_251]) ).
cnf(c_3339,plain,
multiply(inverse(sP2_iProver_def),sP0_iProver_def) = inverse(sP1_iProver_def),
inference(superposition,[status(thm)],[c_65,c_3242]) ).
cnf(c_3351,plain,
inverse(multiply(identity,sP1_iProver_def)) = inverse(sP1_iProver_def),
inference(demodulation,[status(thm)],[c_3242,c_3339]) ).
cnf(c_3390,plain,
multiply(inverse(sP1_iProver_def),multiply(identity,sP1_iProver_def)) = identity,
inference(superposition,[status(thm)],[c_3351,c_66]) ).
cnf(c_3413,plain,
multiply(identity,multiply(identity,sP1_iProver_def)) = multiply(sP1_iProver_def,identity),
inference(superposition,[status(thm)],[c_3390,c_302]) ).
cnf(c_3621,plain,
multiply(identity,sP1_iProver_def) = multiply(sP1_iProver_def,identity),
inference(superposition,[status(thm)],[c_3413,c_65]) ).
cnf(c_3653,plain,
least_upper_bound(multiply(identity,X0),multiply(sP1_iProver_def,identity)) = multiply(identity,least_upper_bound(X0,sP1_iProver_def)),
inference(superposition,[status(thm)],[c_3621,c_61]) ).
cnf(c_3657,plain,
least_upper_bound(multiply(sP1_iProver_def,identity),multiply(identity,X0)) = multiply(identity,least_upper_bound(X0,sP1_iProver_def)),
inference(theory_normalisation,[status(thm)],[c_3653,c_56,c_54,c_55,c_53]) ).
cnf(c_3658,plain,
multiply(identity,least_upper_bound(X0,sP1_iProver_def)) = least_upper_bound(multiply(sP1_iProver_def,identity),X0),
inference(light_normalisation,[status(thm)],[c_3657,c_65]) ).
cnf(c_8817,plain,
multiply(least_upper_bound(identity,inverse(X0)),X0) = least_upper_bound(X0,identity),
inference(superposition,[status(thm)],[c_66,c_441]) ).
cnf(c_11174,plain,
multiply(greatest_lower_bound(identity,inverse(X0)),X0) = greatest_lower_bound(X0,identity),
inference(superposition,[status(thm)],[c_66,c_482]) ).
cnf(c_12929,plain,
multiply(inverse(X0),greatest_lower_bound(identity,X0)) = greatest_lower_bound(inverse(X0),identity),
inference(superposition,[status(thm)],[c_66,c_541]) ).
cnf(c_13025,plain,
multiply(inverse(X0),greatest_lower_bound(identity,X0)) = greatest_lower_bound(identity,inverse(X0)),
inference(theory_normalisation,[status(thm)],[c_12929,c_56,c_54,c_55,c_53]) ).
cnf(c_13202,plain,
multiply(inverse(X0),least_upper_bound(identity,X0)) = least_upper_bound(inverse(X0),identity),
inference(superposition,[status(thm)],[c_66,c_542]) ).
cnf(c_13307,plain,
multiply(inverse(X0),least_upper_bound(identity,X0)) = least_upper_bound(identity,inverse(X0)),
inference(theory_normalisation,[status(thm)],[c_13202,c_56,c_54,c_55,c_53]) ).
cnf(c_28695,plain,
multiply(identity,least_upper_bound(X0,sP1_iProver_def)) = least_upper_bound(sP1_iProver_def,X0),
inference(superposition,[status(thm)],[c_525,c_3658]) ).
cnf(c_28703,plain,
multiply(identity,least_upper_bound(X0,sP1_iProver_def)) = least_upper_bound(X0,multiply(sP1_iProver_def,identity)),
inference(superposition,[status(thm)],[c_3658,c_54]) ).
cnf(c_38351,plain,
multiply(inverse(a),sP1_iProver_def) = greatest_lower_bound(identity,inverse(a)),
inference(superposition,[status(thm)],[c_131,c_13025]) ).
cnf(c_38602,plain,
multiply(multiply(inverse(a),sP1_iProver_def),a) = greatest_lower_bound(a,identity),
inference(superposition,[status(thm)],[c_38351,c_11174]) ).
cnf(c_38603,plain,
multiply(multiply(inverse(a),sP1_iProver_def),a) = greatest_lower_bound(identity,a),
inference(theory_normalisation,[status(thm)],[c_38602,c_56,c_54,c_55,c_53]) ).
cnf(c_38604,plain,
multiply(multiply(inverse(a),sP1_iProver_def),a) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_38603,c_131]) ).
cnf(c_38929,plain,
multiply(inverse(a),multiply(sP1_iProver_def,a)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_38604,c_67]) ).
cnf(c_38979,plain,
multiply(identity,multiply(sP1_iProver_def,a)) = multiply(a,sP1_iProver_def),
inference(superposition,[status(thm)],[c_38929,c_302]) ).
cnf(c_39022,plain,
multiply(inverse(a),sP0_iProver_def) = least_upper_bound(identity,inverse(a)),
inference(superposition,[status(thm)],[c_130,c_13307]) ).
cnf(c_39548,plain,
multiply(multiply(inverse(a),sP0_iProver_def),a) = least_upper_bound(a,identity),
inference(superposition,[status(thm)],[c_39022,c_8817]) ).
cnf(c_39549,plain,
multiply(multiply(inverse(a),sP0_iProver_def),a) = least_upper_bound(identity,a),
inference(theory_normalisation,[status(thm)],[c_39548,c_56,c_54,c_55,c_53]) ).
cnf(c_39550,plain,
multiply(multiply(inverse(a),sP0_iProver_def),a) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_39549,c_130]) ).
cnf(c_39791,plain,
multiply(inverse(a),multiply(sP0_iProver_def,a)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_39550,c_67]) ).
cnf(c_39892,plain,
multiply(identity,multiply(sP0_iProver_def,a)) = multiply(a,sP0_iProver_def),
inference(superposition,[status(thm)],[c_39791,c_302]) ).
cnf(c_49538,plain,
least_upper_bound(X0,multiply(sP1_iProver_def,identity)) = least_upper_bound(sP1_iProver_def,X0),
inference(light_normalisation,[status(thm)],[c_28703,c_28695]) ).
cnf(c_49562,plain,
multiply(sP1_iProver_def,least_upper_bound(X0,identity)) = least_upper_bound(sP1_iProver_def,multiply(sP1_iProver_def,X0)),
inference(superposition,[status(thm)],[c_49538,c_61]) ).
cnf(c_73018,plain,
multiply(a,sP1_iProver_def) = multiply(sP1_iProver_def,a),
inference(superposition,[status(thm)],[c_38979,c_65]) ).
cnf(c_73045,plain,
multiply(a,least_upper_bound(identity,sP1_iProver_def)) = least_upper_bound(a,multiply(sP1_iProver_def,a)),
inference(superposition,[status(thm)],[c_73018,c_542]) ).
cnf(c_73057,plain,
multiply(least_upper_bound(identity,a),sP1_iProver_def) = least_upper_bound(sP1_iProver_def,multiply(sP1_iProver_def,a)),
inference(superposition,[status(thm)],[c_73018,c_441]) ).
cnf(c_73073,plain,
least_upper_bound(sP1_iProver_def,multiply(sP1_iProver_def,a)) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_73057,c_130,c_132]) ).
cnf(c_73081,plain,
multiply(a,least_upper_bound(sP1_iProver_def,identity)) = least_upper_bound(a,multiply(sP1_iProver_def,a)),
inference(theory_normalisation,[status(thm)],[c_73045,c_56,c_54,c_55,c_53]) ).
cnf(c_73082,plain,
least_upper_bound(a,multiply(sP1_iProver_def,a)) = multiply(a,identity),
inference(light_normalisation,[status(thm)],[c_73081,c_230]) ).
cnf(c_73506,plain,
least_upper_bound(sP1_iProver_def,least_upper_bound(multiply(sP1_iProver_def,a),X0)) = least_upper_bound(sP2_iProver_def,X0),
inference(superposition,[status(thm)],[c_73073,c_56]) ).
cnf(c_73523,plain,
multiply(sP1_iProver_def,least_upper_bound(a,identity)) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_73073,c_49562]) ).
cnf(c_73525,plain,
multiply(sP1_iProver_def,least_upper_bound(identity,a)) = sP2_iProver_def,
inference(theory_normalisation,[status(thm)],[c_73523,c_56,c_54,c_55,c_53]) ).
cnf(c_73526,plain,
multiply(sP1_iProver_def,sP0_iProver_def) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_73525,c_130]) ).
cnf(c_75540,plain,
multiply(a,sP0_iProver_def) = multiply(sP0_iProver_def,a),
inference(superposition,[status(thm)],[c_39892,c_65]) ).
cnf(c_75568,plain,
multiply(a,greatest_lower_bound(identity,sP0_iProver_def)) = greatest_lower_bound(a,multiply(sP0_iProver_def,a)),
inference(superposition,[status(thm)],[c_75540,c_541]) ).
cnf(c_75577,plain,
multiply(greatest_lower_bound(identity,a),sP0_iProver_def) = greatest_lower_bound(sP0_iProver_def,multiply(sP0_iProver_def,a)),
inference(superposition,[status(thm)],[c_75540,c_482]) ).
cnf(c_75588,plain,
greatest_lower_bound(sP0_iProver_def,multiply(sP0_iProver_def,a)) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_75577,c_131,c_73526]) ).
cnf(c_75591,plain,
multiply(a,greatest_lower_bound(sP0_iProver_def,identity)) = greatest_lower_bound(a,multiply(sP0_iProver_def,a)),
inference(theory_normalisation,[status(thm)],[c_75568,c_56,c_54,c_55,c_53]) ).
cnf(c_75592,plain,
greatest_lower_bound(a,multiply(sP0_iProver_def,a)) = multiply(a,identity),
inference(light_normalisation,[status(thm)],[c_75591,c_237]) ).
cnf(c_75659,plain,
least_upper_bound(a,multiply(sP1_iProver_def,a)) = least_upper_bound(sP2_iProver_def,a),
inference(superposition,[status(thm)],[c_73506,c_632]) ).
cnf(c_75753,plain,
multiply(a,identity) = least_upper_bound(sP2_iProver_def,a),
inference(light_normalisation,[status(thm)],[c_75659,c_73082]) ).
cnf(c_75898,plain,
greatest_lower_bound(sP0_iProver_def,greatest_lower_bound(multiply(sP0_iProver_def,a),X0)) = greatest_lower_bound(sP2_iProver_def,X0),
inference(superposition,[status(thm)],[c_75588,c_55]) ).
cnf(c_75932,plain,
greatest_lower_bound(sP2_iProver_def,multiply(a,identity)) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_75753,c_60]) ).
cnf(c_75934,plain,
greatest_lower_bound(a,multiply(a,identity)) = a,
inference(superposition,[status(thm)],[c_75753,c_231]) ).
cnf(c_76086,plain,
greatest_lower_bound(sP2_iProver_def,a) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_525,c_75932]) ).
cnf(c_82060,plain,
greatest_lower_bound(a,multiply(sP0_iProver_def,a)) = greatest_lower_bound(sP2_iProver_def,a),
inference(superposition,[status(thm)],[c_75898,c_894]) ).
cnf(c_82119,plain,
multiply(a,identity) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_82060,c_75592,c_76086]) ).
cnf(c_82175,plain,
greatest_lower_bound(a,sP2_iProver_def) = a,
inference(demodulation,[status(thm)],[c_75934,c_82119]) ).
cnf(c_82182,plain,
greatest_lower_bound(sP2_iProver_def,a) = a,
inference(theory_normalisation,[status(thm)],[c_82175,c_56,c_54,c_55,c_53]) ).
cnf(c_82183,plain,
a = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_82182,c_76086]) ).
cnf(c_82415,plain,
sP2_iProver_def != sP2_iProver_def,
inference(demodulation,[status(thm)],[c_133,c_82183]) ).
cnf(c_82416,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_82415]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP167-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n025.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 : 300
% 0.12/0.33 % DateTime : Thu Jun 20 09:46:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 14.90/2.65 % SZS status Started for theBenchmark.p
% 14.90/2.65 % SZS status Unsatisfiable for theBenchmark.p
% 14.90/2.65
% 14.90/2.65 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 14.90/2.65
% 14.90/2.65 ------ iProver source info
% 14.90/2.65
% 14.90/2.65 git: date: 2024-06-12 09:56:46 +0000
% 14.90/2.65 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 14.90/2.65 git: non_committed_changes: false
% 14.90/2.65
% 14.90/2.65 ------ Parsing...successful
% 14.90/2.65
% 14.90/2.65
% 14.90/2.65
% 14.90/2.65 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 14.90/2.65
% 14.90/2.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 14.90/2.65
% 14.90/2.65 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 14.90/2.65 ------ Proving...
% 14.90/2.65 ------ Problem Properties
% 14.90/2.65
% 14.90/2.65
% 14.90/2.65 clauses 22
% 14.90/2.65 conjectures 1
% 14.90/2.65 EPR 1
% 14.90/2.65 Horn 22
% 14.90/2.65 unary 22
% 14.90/2.65 binary 0
% 14.90/2.65 lits 22
% 14.90/2.65 lits eq 22
% 14.90/2.65 fd_pure 0
% 14.90/2.65 fd_pseudo 0
% 14.90/2.65 fd_cond 0
% 14.90/2.65 fd_pseudo_cond 0
% 14.90/2.65 AC symbols 2
% 14.90/2.65
% 14.90/2.65 ------ Input Options Time Limit: Unbounded
% 14.90/2.65
% 14.90/2.65
% 14.90/2.65 ------
% 14.90/2.65 Current options:
% 14.90/2.65 ------
% 14.90/2.65
% 14.90/2.65
% 14.90/2.65
% 14.90/2.65
% 14.90/2.65 ------ Proving...
% 14.90/2.65
% 14.90/2.65
% 14.90/2.65 % SZS status Unsatisfiable for theBenchmark.p
% 14.90/2.65
% 14.90/2.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.90/2.65
% 14.90/2.65
%------------------------------------------------------------------------------