%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP185-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:31:44 PM UTC 2026
% Result : Unsatisfiable 12.35s 2.60s
% Output : CNFRefutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 19
% Syntax : Number of formulae : 88 ( 88 unt; 6 def)
% Number of atoms : 164 ( 87 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn 119 !; 0 ?; 92 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
fof(f7,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
fof(f8,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
fof(f9,axiom,
! [X0] : least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_lub) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
fof(f17,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) ).
fof(f18,plain,
least_upper_bound(multiply(a,b),identity) != greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))),
inference(reorient_equations,[],[f17]) ).
tcf(c_65,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_66,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_72,plain,
! [X0: $i] : least_upper_bound(X0,X0) = X0,
inference(cnf_transformation,[],[f9]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
inference(cnf_transformation,[],[f15]) ).
tcf(c_80,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),
inference(cnf_transformation,[],[f18]) ).
tcf(c_133,definition,
iPr_def_10 = multiply(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_134,definition,
iPr_def_11 = least_upper_bound(iPr_def_10,identity),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_135,definition,
iPr_def_12 = least_upper_bound(a,identity),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_136,definition,
iPr_def_13 = least_upper_bound(b,identity),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_137,definition,
iPr_def_14 = multiply(iPr_def_12,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_138,definition,
iPr_def_15 = greatest_lower_bound(iPr_def_11,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_139,negated_conjecture,
iPr_def_15 != iPr_def_11,
inference(demodulation,[status(thm)],[c_80,c_136,c_135,c_137,c_133,c_134,c_138]) ).
tcf(c_140,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_141,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_142,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
inference(demodulation,[status(thm)],[c_78]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
inference(demodulation,[status(thm)],[c_76]) ).
tcf(c_147,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_75]) ).
tcf(c_148,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_74]) ).
tcf(c_150,plain,
! [X0: $i] : least_upper_bound(X0,X0) = X0,
inference(demodulation,[status(thm)],[c_72]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(demodulation,[status(thm)],[c_69]) ).
tcf(c_154,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_232,plain,
least_upper_bound(identity,a) = iPr_def_12,
inference(theory_normalisation,[status(thm)],[c_135,c_151,c_153,c_152,c_154]) ).
tcf(c_233,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[status(thm)],[c_151,c_153]) ).
tcf(c_234,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),
inference(superposition,[status(thm)],[c_152,c_154]) ).
tcf(c_254,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_141,c_140]) ).
tcf(c_258,plain,
! [X0: $i] : least_upper_bound(b,least_upper_bound(identity,X0)) = least_upper_bound(iPr_def_13,X0),
inference(superposition,[status(thm)],[c_136,c_151]) ).
tcf(c_281,plain,
! [X0: $i] : least_upper_bound(b,least_upper_bound(X0,identity)) = least_upper_bound(X0,iPr_def_13),
inference(superposition,[status(thm)],[c_136,c_233]) ).
tcf(c_284,plain,
! [X0: $i] : least_upper_bound(iPr_def_10,least_upper_bound(X0,identity)) = least_upper_bound(X0,iPr_def_11),
inference(superposition,[status(thm)],[c_134,c_233]) ).
tcf(c_285,plain,
! [X0: $i] : least_upper_bound(identity,least_upper_bound(X0,a)) = least_upper_bound(X0,iPr_def_12),
inference(superposition,[status(thm)],[c_232,c_233]) ).
tcf(c_288,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X2))) = X0,
inference(superposition,[status(thm)],[c_233,c_147]) ).
tcf(c_338,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_142,c_144]) ).
tcf(c_420,plain,
! [X0: $i] : multiply(a,least_upper_bound(b,X0)) = least_upper_bound(iPr_def_10,multiply(a,X0)),
inference(superposition,[status(thm)],[c_133,c_146]) ).
tcf(c_492,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X0,X2))) = X0,
inference(superposition,[status(thm)],[c_234,c_148]) ).
tcf(c_499,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_254,c_142]) ).
tcf(c_725,plain,
! [X0: $i] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_141,c_499]) ).
tcf(c_727,plain,
multiply(inverse(iPr_def_12),iPr_def_14) = iPr_def_13,
inference(superposition,[status(thm)],[c_137,c_499]) ).
tcf(c_728,plain,
! [X0: $i,X1: $i] : multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_499,c_499]) ).
tcf(c_763,plain,
! [X0: $i] : least_upper_bound(iPr_def_13,greatest_lower_bound(identity,X0)) = least_upper_bound(b,identity),
inference(superposition,[status(thm)],[c_148,c_258]) ).
tcf(c_863,plain,
least_upper_bound(b,identity) = least_upper_bound(identity,iPr_def_13),
inference(superposition,[status(thm)],[c_150,c_281]) ).
tcf(c_941,plain,
least_upper_bound(b,identity) = least_upper_bound(iPr_def_13,identity),
inference(theory_normalisation,[status(thm)],[c_863,c_151,c_153,c_152,c_154]) ).
tcf(c_942,plain,
least_upper_bound(iPr_def_13,identity) = iPr_def_13,
inference(demodulation,[status(thm)],[c_941,c_136]) ).
tcf(c_963,plain,
! [X0: $i] : least_upper_bound(iPr_def_13,greatest_lower_bound(identity,X0)) = iPr_def_13,
inference(demodulation,[status(thm)],[c_763,c_136]) ).
tcf(c_1508,plain,
! [X0: $i] : least_upper_bound(iPr_def_13,least_upper_bound(identity,X0)) = least_upper_bound(iPr_def_13,X0),
inference(superposition,[status(thm)],[c_942,c_151]) ).
tcf(c_1513,plain,
least_upper_bound(iPr_def_10,iPr_def_13) = least_upper_bound(iPr_def_13,iPr_def_11),
inference(superposition,[status(thm)],[c_942,c_284]) ).
tcf(c_1756,plain,
least_upper_bound(iPr_def_13,iPr_def_10) = least_upper_bound(iPr_def_13,iPr_def_11),
inference(theory_normalisation,[status(thm)],[c_1513,c_151,c_153,c_152,c_154]) ).
tcf(c_2090,plain,
! [X0: $i,X1: $i] : least_upper_bound(iPr_def_13,greatest_lower_bound(X0,greatest_lower_bound(identity,X1))) = iPr_def_13,
inference(superposition,[status(thm)],[c_234,c_963]) ).
tcf(c_2361,plain,
! [X0: $i,X1: $i] : least_upper_bound(iPr_def_13,greatest_lower_bound(X0,greatest_lower_bound(identity,X1))) = least_upper_bound(b,identity),
inference(superposition,[status(thm)],[c_492,c_258]) ).
tcf(c_2444,plain,
least_upper_bound(b,identity) = iPr_def_13,
inference(demodulation,[status(thm)],[c_2361,c_2090]) ).
tcf(c_2596,plain,
! [X0: $i] : least_upper_bound(least_upper_bound(iPr_def_13,iPr_def_11),X0) = least_upper_bound(iPr_def_13,least_upper_bound(iPr_def_10,X0)),
inference(superposition,[status(thm)],[c_1756,c_151]) ).
tcf(c_2896,plain,
! [X0: $i] : least_upper_bound(iPr_def_13,least_upper_bound(iPr_def_10,X0)) = least_upper_bound(iPr_def_13,least_upper_bound(iPr_def_11,X0)),
inference(theory_normalisation,[status(thm)],[c_2596,c_151,c_153,c_152,c_154]) ).
tcf(c_3842,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[status(thm)],[c_728,c_499]) ).
tcf(c_3843,plain,
! [X0: $i] : multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_728,c_725]) ).
tcf(c_4165,plain,
multiply(iPr_def_12,iPr_def_13) = iPr_def_14,
inference(superposition,[status(thm)],[c_727,c_3842]) ).
tcf(c_4437,plain,
! [X0: $i] : least_upper_bound(iPr_def_13,least_upper_bound(X0,a)) = least_upper_bound(iPr_def_13,least_upper_bound(X0,iPr_def_12)),
inference(superposition,[status(thm)],[c_285,c_1508]) ).
tcf(c_8810,plain,
! [X0: $i] : least_upper_bound(X0,multiply(a,X0)) = multiply(iPr_def_12,X0),
inference(superposition,[status(thm)],[c_232,c_338]) ).
tcf(c_12632,plain,
least_upper_bound(iPr_def_10,multiply(a,identity)) = multiply(a,iPr_def_13),
inference(superposition,[status(thm)],[c_2444,c_420]) ).
tcf(c_12672,plain,
multiply(a,iPr_def_13) = least_upper_bound(iPr_def_10,a),
inference(demodulation,[status(thm)],[c_12632,c_3843]) ).
tcf(c_13035,plain,
least_upper_bound(iPr_def_13,least_upper_bound(iPr_def_10,a)) = multiply(iPr_def_12,iPr_def_13),
inference(superposition,[status(thm)],[c_12672,c_8810]) ).
tcf(c_13297,plain,
least_upper_bound(iPr_def_13,least_upper_bound(iPr_def_11,iPr_def_12)) = iPr_def_14,
inference(demodulation,[status(thm)],[c_13035,c_2896,c_4165,c_4437]) ).
tcf(c_14046,plain,
greatest_lower_bound(iPr_def_11,iPr_def_14) = iPr_def_11,
inference(superposition,[status(thm)],[c_13297,c_288]) ).
tcf(c_14456,plain,
iPr_def_11 = iPr_def_15,
inference(superposition,[status(thm)],[c_14046,c_138]) ).
tcf(c_15095,plain,
$false,
inference(superposition,[status(thm)],[c_14456,c_139]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP185-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 14:03:43 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running UEQ theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.43 % Proving...
% 12.35/2.60 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 12.35/2.60 % SZS status Started for theBenchmark.p
% 12.35/2.60 % SZS status Unsatisfiable for theBenchmark.p
% 12.35/2.60
% 12.35/2.60 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 12.35/2.60
% 12.35/2.60 % ------ iProver source info
% 12.35/2.60
% 12.35/2.60 % git: date: 2026-07-19 20:42:38 +0200
% 12.35/2.60 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 12.35/2.60 % git: non_committed_changes: false
% 12.35/2.60
% 12.35/2.60 % ------ Parsing...% successful
% 12.35/2.60
% 12.35/2.60
% 12.35/2.60 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 12.35/2.60
% 12.35/2.60 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 12.35/2.60
% 12.35/2.60 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 12.35/2.60
% 12.35/2.60 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 12.35/2.60 % ------ Proving...
% 12.35/2.60 % ------ Problem Properties
% 12.35/2.60
% 12.35/2.60 %
% 12.35/2.60 % clauses 22
% 12.35/2.60 % conjectures 1
% 12.35/2.60 % EPR 1
% 12.35/2.60 % Horn 22
% 12.35/2.60 % unary 22
% 12.35/2.60 % binary 0
% 12.35/2.60 % lits 22
% 12.35/2.60 % lits eq 22
% 12.35/2.60 % fd_pure 0
% 12.35/2.60 % fd_pseudo 0
% 12.35/2.60 % fd_cond 0
% 12.35/2.60 % fd_pseudo_cond 0
% 12.35/2.60 % AC symbols 2
% 12.35/2.60
% 12.35/2.60 % ------ Input Options Time Limit: Unbounded
% 12.35/2.60
% 12.35/2.60
% 12.35/2.60 % ------
% 12.35/2.60 % Current options:
% 12.35/2.60 % ------
% 12.35/2.60
% 12.35/2.60
% 12.35/2.60 %
% 12.35/2.60
% 12.35/2.60 % ------ Proving...
% 12.35/2.60 %
% 12.35/2.60
% 12.35/2.60 % SZS status Unsatisfiable for theBenchmark.p
% 12.35/2.60
% 12.35/2.60 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.07/2.61
% 3.07/2.61
%------------------------------------------------------------------------------