%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP183-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n003.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:43 PM UTC 2026
% Result : Unsatisfiable 7.98s 2.73s
% Output : CNFRefutation 7.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 19
% Syntax : Number of formulae : 101 ( 101 unt; 5 def)
% Number of atoms : 235 ( 100 equ)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 5 ( 5 ~; 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 : 7 ( 5 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 109 !; 0 ?; 81 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
fof(f17,axiom,
inverse(identity) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p20x_1) ).
fof(f18,plain,
identity = inverse(identity),
inference(reorient_equations,[],[f17]) ).
fof(f20,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p20x_3) ).
fof(f21,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_20x) ).
fof(f22,plain,
identity != greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)),
inference(reorient_equations,[],[f21]) ).
tcf(c_68,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_69,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_73,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_74,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_77,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_79,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_81,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_83,plain,
inverse(identity) = identity,
inference(cnf_transformation,[],[f18]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_86,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)) != identity,
inference(cnf_transformation,[],[f22]) ).
tcf(c_148,definition,
iPr_def_10 = least_upper_bound(a,identity),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_149,definition,
iPr_def_11 = inverse(a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_150,definition,
iPr_def_12 = least_upper_bound(iPr_def_11,identity),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_151,definition,
iPr_def_13 = greatest_lower_bound(iPr_def_10,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_152,definition,
iPr_def_14 = inverse(identity),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_153,negated_conjecture,
iPr_def_13 != identity,
inference(demodulation,[status(thm)],[c_86,c_149,c_150,c_148,c_151]) ).
tcf(c_154,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_155,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(demodulation,[status(thm)],[c_69]) ).
tcf(c_156,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_158,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_81]) ).
tcf(c_160,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_79]) ).
tcf(c_161,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_78]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_77]) ).
tcf(c_165,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_74]) ).
tcf(c_166,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_73]) ).
tcf(c_167,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(demodulation,[status(thm)],[c_72]) ).
tcf(c_168,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_169,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
inference(demodulation,[status(thm)],[c_85]) ).
tcf(c_171,plain,
iPr_def_14 = identity,
inference(demodulation,[status(thm)],[c_83,c_152]) ).
tcf(c_259,plain,
inverse(iPr_def_14) = iPr_def_14,
inference(demodulation,[status(thm)],[c_152,c_171]) ).
tcf(c_260,plain,
iPr_def_13 != iPr_def_14,
inference(demodulation,[status(thm)],[c_153,c_171]) ).
tcf(c_261,plain,
! [X0: $i] : multiply(iPr_def_14,X0) = X0,
inference(demodulation,[status(thm)],[c_156,c_171]) ).
tcf(c_262,plain,
least_upper_bound(a,iPr_def_14) = iPr_def_10,
inference(demodulation,[status(thm)],[c_148,c_171]) ).
tcf(c_263,plain,
least_upper_bound(iPr_def_14,a) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_262,c_165,c_167,c_166,c_168]) ).
tcf(c_264,plain,
least_upper_bound(iPr_def_11,iPr_def_14) = iPr_def_12,
inference(demodulation,[status(thm)],[c_150,c_171]) ).
tcf(c_265,plain,
greatest_lower_bound(iPr_def_12,iPr_def_10) = iPr_def_13,
inference(theory_normalisation,[status(thm)],[c_151,c_165,c_167,c_166,c_168]) ).
tcf(c_266,plain,
! [X0: $i] : multiply(inverse(X0),X0) = iPr_def_14,
inference(demodulation,[status(thm)],[c_155,c_171]) ).
tcf(c_268,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_166,c_168]) ).
tcf(c_285,plain,
multiply(iPr_def_11,a) = iPr_def_14,
inference(superposition,[status(thm)],[c_149,c_266]) ).
tcf(c_288,plain,
greatest_lower_bound(iPr_def_14,iPr_def_10) = iPr_def_14,
inference(superposition,[status(thm)],[c_263,c_161]) ).
tcf(c_292,plain,
least_upper_bound(iPr_def_12,iPr_def_13) = iPr_def_12,
inference(superposition,[status(thm)],[c_265,c_162]) ).
tcf(c_294,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_167,c_161]) ).
tcf(c_296,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_168,c_162]) ).
tcf(c_304,plain,
! [X0: $i] : inverse(multiply(iPr_def_14,X0)) = multiply(inverse(X0),iPr_def_14),
inference(superposition,[status(thm)],[c_259,c_169]) ).
tcf(c_307,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = multiply(iPr_def_14,X1),
inference(superposition,[status(thm)],[c_266,c_154]) ).
tcf(c_352,plain,
! [X0: $i,X1: $i] : least_upper_bound(multiply(X0,X1),X1) = multiply(least_upper_bound(X0,iPr_def_14),X1),
inference(superposition,[status(thm)],[c_261,c_158]) ).
tcf(c_418,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_12,greatest_lower_bound(X0,iPr_def_10)) = greatest_lower_bound(X0,iPr_def_13),
inference(superposition,[status(thm)],[c_265,c_268]) ).
tcf(c_503,plain,
least_upper_bound(iPr_def_13,iPr_def_12) = iPr_def_12,
inference(theory_normalisation,[status(thm)],[c_292,c_165,c_167,c_166,c_168]) ).
tcf(c_508,plain,
! [X0: $i] : multiply(inverse(X0),iPr_def_14) = inverse(X0),
inference(demodulation,[status(thm)],[c_304,c_261]) ).
tcf(c_510,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_307,c_261]) ).
tcf(c_527,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(X1,iPr_def_14),X0),
inference(theory_normalisation,[status(thm)],[c_352,c_165,c_167,c_166,c_168]) ).
tcf(c_700,plain,
! [X0: $i] : multiply(least_upper_bound(iPr_def_11,X0),a) = least_upper_bound(iPr_def_14,multiply(X0,a)),
inference(superposition,[status(thm)],[c_285,c_158]) ).
tcf(c_703,plain,
! [X0: $i] : multiply(iPr_def_11,least_upper_bound(X0,a)) = least_upper_bound(multiply(iPr_def_11,X0),iPr_def_14),
inference(superposition,[status(thm)],[c_285,c_160]) ).
tcf(c_748,plain,
greatest_lower_bound(iPr_def_14,iPr_def_12) = iPr_def_14,
inference(superposition,[status(thm)],[c_264,c_294]) ).
tcf(c_765,plain,
least_upper_bound(iPr_def_10,iPr_def_13) = iPr_def_10,
inference(superposition,[status(thm)],[c_265,c_296]) ).
tcf(c_778,plain,
multiply(iPr_def_11,iPr_def_14) = iPr_def_11,
inference(superposition,[status(thm)],[c_149,c_508]) ).
tcf(c_940,plain,
least_upper_bound(iPr_def_13,iPr_def_10) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_765,c_165,c_167,c_166,c_168]) ).
tcf(c_984,plain,
! [X0: $i] : multiply(iPr_def_11,least_upper_bound(X0,a)) = least_upper_bound(iPr_def_14,multiply(iPr_def_11,X0)),
inference(theory_normalisation,[status(thm)],[c_703,c_165,c_167,c_166,c_168]) ).
tcf(c_1993,plain,
greatest_lower_bound(iPr_def_12,iPr_def_14) = greatest_lower_bound(iPr_def_14,iPr_def_13),
inference(superposition,[status(thm)],[c_288,c_418]) ).
tcf(c_2084,plain,
greatest_lower_bound(iPr_def_13,iPr_def_14) = greatest_lower_bound(iPr_def_14,iPr_def_12),
inference(theory_normalisation,[status(thm)],[c_1993,c_165,c_167,c_166,c_168]) ).
tcf(c_2085,plain,
greatest_lower_bound(iPr_def_13,iPr_def_14) = iPr_def_14,
inference(demodulation,[status(thm)],[c_2084,c_748]) ).
tcf(c_2387,plain,
least_upper_bound(iPr_def_13,iPr_def_14) = iPr_def_13,
inference(superposition,[status(thm)],[c_2085,c_162]) ).
tcf(c_2924,plain,
! [X0: $i] : least_upper_bound(iPr_def_13,least_upper_bound(iPr_def_14,X0)) = least_upper_bound(iPr_def_13,X0),
inference(superposition,[status(thm)],[c_2387,c_165]) ).
tcf(c_5267,plain,
least_upper_bound(iPr_def_13,a) = least_upper_bound(iPr_def_13,iPr_def_10),
inference(superposition,[status(thm)],[c_263,c_2924]) ).
tcf(c_5358,plain,
least_upper_bound(iPr_def_13,a) = iPr_def_10,
inference(demodulation,[status(thm)],[c_5267,c_940]) ).
tcf(c_9398,plain,
! [X0: $i] : least_upper_bound(X0,multiply(iPr_def_11,X0)) = multiply(iPr_def_12,X0),
inference(superposition,[status(thm)],[c_264,c_527]) ).
tcf(c_9765,plain,
multiply(iPr_def_12,a) = least_upper_bound(a,iPr_def_14),
inference(superposition,[status(thm)],[c_285,c_9398]) ).
tcf(c_9778,plain,
! [X0: $i] : multiply(iPr_def_11,least_upper_bound(X0,multiply(iPr_def_11,X0))) = multiply(iPr_def_12,multiply(iPr_def_11,X0)),
inference(superposition,[status(thm)],[c_9398,c_160]) ).
tcf(c_10000,plain,
multiply(iPr_def_12,a) = least_upper_bound(iPr_def_14,a),
inference(theory_normalisation,[status(thm)],[c_9765,c_165,c_167,c_166,c_168]) ).
tcf(c_10001,plain,
multiply(iPr_def_12,a) = iPr_def_10,
inference(demodulation,[status(thm)],[c_10000,c_263]) ).
tcf(c_10048,plain,
! [X0: $i] : multiply(iPr_def_11,multiply(iPr_def_12,X0)) = multiply(iPr_def_12,multiply(iPr_def_11,X0)),
inference(demodulation,[status(thm)],[c_9778,c_9398]) ).
tcf(c_11944,plain,
least_upper_bound(iPr_def_14,multiply(multiply(iPr_def_11,iPr_def_11),a)) = multiply(multiply(iPr_def_12,iPr_def_11),a),
inference(superposition,[status(thm)],[c_9398,c_700]) ).
tcf(c_12373,plain,
multiply(iPr_def_11,iPr_def_10) = iPr_def_12,
inference(demodulation,[status(thm)],[c_11944,c_167,c_154,c_264,c_285,c_778,c_10001,c_10048]) ).
tcf(c_13769,plain,
least_upper_bound(iPr_def_14,multiply(iPr_def_11,iPr_def_13)) = multiply(iPr_def_11,iPr_def_10),
inference(superposition,[status(thm)],[c_5358,c_984]) ).
tcf(c_13872,plain,
least_upper_bound(iPr_def_14,multiply(iPr_def_11,iPr_def_13)) = iPr_def_12,
inference(demodulation,[status(thm)],[c_13769,c_12373]) ).
tcf(c_16271,plain,
least_upper_bound(iPr_def_13,multiply(iPr_def_11,iPr_def_13)) = least_upper_bound(iPr_def_13,iPr_def_12),
inference(superposition,[status(thm)],[c_13872,c_2924]) ).
tcf(c_16483,plain,
multiply(iPr_def_12,iPr_def_13) = iPr_def_12,
inference(demodulation,[status(thm)],[c_16271,c_503,c_9398]) ).
tcf(c_17180,plain,
multiply(inverse(iPr_def_12),iPr_def_12) = iPr_def_13,
inference(superposition,[status(thm)],[c_16483,c_510]) ).
tcf(c_17262,plain,
iPr_def_13 = iPr_def_14,
inference(demodulation,[status(thm)],[c_17180,c_266]) ).
tcf(c_17263,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_17262,c_260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP183-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 14:04:35 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.40 Running UEQ theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 7.98/2.73 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 7.98/2.73 % SZS status Started for theBenchmark.p
% 7.98/2.73 % SZS status Unsatisfiable for theBenchmark.p
% 7.98/2.73
% 7.98/2.73 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.98/2.73
% 7.98/2.73 % ------ iProver source info
% 7.98/2.73
% 7.98/2.73 % git: date: 2026-07-19 20:42:38 +0200
% 7.98/2.73 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.98/2.73 % git: non_committed_changes: false
% 7.98/2.73
% 7.98/2.73 % ------ Parsing...% successful
% 7.98/2.73
% 7.98/2.73
% 7.98/2.73 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.98/2.73
% 7.98/2.73 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 7.98/2.73
% 7.98/2.73 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.98/2.73
% 7.98/2.73 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 7.98/2.73 % ------ Proving...
% 7.98/2.73 % ------ Problem Properties
% 7.98/2.73
% 7.98/2.73 %
% 7.98/2.73 % clauses 24
% 7.98/2.73 % conjectures 1
% 7.98/2.73 % EPR 2
% 7.98/2.73 % Horn 24
% 7.98/2.73 % unary 24
% 7.98/2.73 % binary 0
% 7.98/2.73 % lits 24
% 7.98/2.73 % lits eq 24
% 7.98/2.73 % fd_pure 0
% 7.98/2.73 % fd_pseudo 0
% 7.98/2.73 % fd_cond 0
% 7.98/2.73 % fd_pseudo_cond 0
% 7.98/2.73 % AC symbols 2
% 7.98/2.73
% 7.98/2.73 % ------ Input Options Time Limit: Unbounded
% 7.98/2.73
% 7.98/2.73
% 7.98/2.73 % ------
% 7.98/2.73 % Current options:
% 7.98/2.73 % ------
% 7.98/2.73
% 7.98/2.73
% 7.98/2.73 %
% 7.98/2.73
% 7.98/2.73 % ------ Proving...
% 7.98/2.73 %
% 7.98/2.73
% 7.98/2.73 % SZS status Unsatisfiable for theBenchmark.p
% 7.98/2.73
% 7.98/2.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.98/2.73
% 7.98/2.73
%------------------------------------------------------------------------------