%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP179-3 : 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 : 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:41 PM UTC 2026
% Result : Unsatisfiable 9.09s 2.21s
% Output : CNFRefutation 9.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 22
% Syntax : Number of formulae : 106 ( 106 unt; 5 def)
% Number of atoms : 229 ( 105 equ)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 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 : 130 ( 0 sgn 130 !; 0 ?; 95 :)
% 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(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
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(f16,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f17,axiom,
inverse(identity) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18_1) ).
fof(f18,plain,
identity = inverse(identity),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18_2) ).
fof(f20,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18_3) ).
fof(f21,negated_conjecture,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p18) ).
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_80,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X1,X2)),
inference(cnf_transformation,[],[f14]) ).
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_82,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
inference(cnf_transformation,[],[f16]) ).
tcf(c_83,plain,
inverse(identity) = identity,
inference(cnf_transformation,[],[f18]) ).
tcf(c_84,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(cnf_transformation,[],[f19]) ).
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,
inverse(greatest_lower_bound(a,identity)) != least_upper_bound(inverse(a),identity),
inference(cnf_transformation,[],[f21]) ).
tcf(c_148,definition,
iPr_def_10 = greatest_lower_bound(a,identity),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_149,definition,
iPr_def_11 = inverse(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_150,definition,
iPr_def_12 = inverse(a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_151,definition,
iPr_def_13 = least_upper_bound(iPr_def_12,identity),
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_11 != iPr_def_13,
inference(demodulation,[status(thm)],[c_86,c_150,c_151,c_148,c_149]) ).
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_157,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
inference(demodulation,[status(thm)],[c_82]) ).
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_159,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X1,X2)),
inference(demodulation,[status(thm)],[c_80]) ).
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_170,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_84]) ).
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,
! [X0: $i] : multiply(iPr_def_14,X0) = X0,
inference(demodulation,[status(thm)],[c_156,c_171]) ).
tcf(c_261,plain,
greatest_lower_bound(a,iPr_def_14) = iPr_def_10,
inference(demodulation,[status(thm)],[c_148,c_171]) ).
tcf(c_262,plain,
greatest_lower_bound(iPr_def_14,a) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_261,c_165,c_167,c_166,c_168]) ).
tcf(c_263,plain,
least_upper_bound(iPr_def_12,iPr_def_14) = iPr_def_13,
inference(demodulation,[status(thm)],[c_151,c_171]) ).
tcf(c_264,plain,
least_upper_bound(iPr_def_14,iPr_def_12) = iPr_def_13,
inference(theory_normalisation,[status(thm)],[c_263,c_165,c_167,c_166,c_168]) ).
tcf(c_265,plain,
! [X0: $i] : multiply(inverse(X0),X0) = iPr_def_14,
inference(demodulation,[status(thm)],[c_155,c_171]) ).
tcf(c_283,plain,
! [X0: $i] : multiply(X0,inverse(X0)) = iPr_def_14,
inference(superposition,[status(thm)],[c_170,c_265]) ).
tcf(c_284,plain,
multiply(iPr_def_12,a) = iPr_def_14,
inference(superposition,[status(thm)],[c_150,c_265]) ).
tcf(c_288,plain,
greatest_lower_bound(iPr_def_14,iPr_def_13) = iPr_def_14,
inference(superposition,[status(thm)],[c_264,c_161]) ).
tcf(c_291,plain,
least_upper_bound(iPr_def_14,iPr_def_10) = iPr_def_14,
inference(superposition,[status(thm)],[c_262,c_162]) ).
tcf(c_293,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_305,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_308,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = multiply(iPr_def_14,X1),
inference(superposition,[status(thm)],[c_265,c_154]) ).
tcf(c_334,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(iPr_def_14,X1),X0),
inference(superposition,[status(thm)],[c_260,c_157]) ).
tcf(c_354,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(iPr_def_14,X1),X0),
inference(superposition,[status(thm)],[c_260,c_158]) ).
tcf(c_491,plain,
! [X0: $i] : multiply(inverse(X0),iPr_def_14) = inverse(X0),
inference(demodulation,[status(thm)],[c_305,c_260]) ).
tcf(c_493,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_308,c_260]) ).
tcf(c_716,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_14,greatest_lower_bound(iPr_def_13,X0)) = greatest_lower_bound(iPr_def_14,X0),
inference(superposition,[status(thm)],[c_288,c_166]) ).
tcf(c_720,plain,
! [X0: $i] : least_upper_bound(iPr_def_14,least_upper_bound(iPr_def_10,X0)) = least_upper_bound(iPr_def_14,X0),
inference(superposition,[status(thm)],[c_291,c_165]) ).
tcf(c_728,plain,
multiply(a,iPr_def_12) = iPr_def_14,
inference(superposition,[status(thm)],[c_150,c_283]) ).
tcf(c_782,plain,
! [X0: $i] : multiply(X0,iPr_def_14) = X0,
inference(superposition,[status(thm)],[c_170,c_491]) ).
tcf(c_808,plain,
! [X0: $i] : multiply(iPr_def_11,multiply(iPr_def_10,X0)) = X0,
inference(superposition,[status(thm)],[c_149,c_493]) ).
tcf(c_1430,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,multiply(X0,X1)) = multiply(X0,least_upper_bound(iPr_def_14,X1)),
inference(superposition,[status(thm)],[c_782,c_160]) ).
tcf(c_1431,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,multiply(X0,X1)) = multiply(X0,greatest_lower_bound(iPr_def_14,X1)),
inference(superposition,[status(thm)],[c_782,c_159]) ).
tcf(c_5983,plain,
! [X0: $i] : greatest_lower_bound(X0,multiply(a,X0)) = multiply(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_262,c_334]) ).
tcf(c_6429,plain,
multiply(iPr_def_10,iPr_def_12) = greatest_lower_bound(iPr_def_12,iPr_def_14),
inference(superposition,[status(thm)],[c_728,c_5983]) ).
tcf(c_6477,plain,
multiply(iPr_def_10,iPr_def_12) = greatest_lower_bound(iPr_def_14,iPr_def_12),
inference(theory_normalisation,[status(thm)],[c_6429,c_165,c_167,c_166,c_168]) ).
tcf(c_6993,plain,
! [X0: $i] : least_upper_bound(X0,multiply(iPr_def_12,X0)) = multiply(iPr_def_13,X0),
inference(superposition,[status(thm)],[c_264,c_354]) ).
tcf(c_7440,plain,
multiply(iPr_def_13,a) = least_upper_bound(a,iPr_def_14),
inference(superposition,[status(thm)],[c_284,c_6993]) ).
tcf(c_7700,plain,
multiply(iPr_def_13,a) = least_upper_bound(iPr_def_14,a),
inference(theory_normalisation,[status(thm)],[c_7440,c_165,c_167,c_166,c_168]) ).
tcf(c_16001,plain,
! [X0: $i] : least_upper_bound(X0,multiply(X0,iPr_def_12)) = multiply(X0,iPr_def_13),
inference(superposition,[status(thm)],[c_264,c_1430]) ).
tcf(c_16598,plain,
multiply(a,iPr_def_13) = least_upper_bound(a,iPr_def_14),
inference(superposition,[status(thm)],[c_728,c_16001]) ).
tcf(c_16641,plain,
least_upper_bound(iPr_def_14,multiply(iPr_def_10,iPr_def_12)) = least_upper_bound(iPr_def_14,multiply(iPr_def_10,iPr_def_13)),
inference(superposition,[status(thm)],[c_16001,c_720]) ).
tcf(c_16986,plain,
multiply(a,iPr_def_13) = least_upper_bound(iPr_def_14,a),
inference(theory_normalisation,[status(thm)],[c_16598,c_165,c_167,c_166,c_168]) ).
tcf(c_17003,plain,
least_upper_bound(iPr_def_14,multiply(iPr_def_10,iPr_def_13)) = iPr_def_14,
inference(demodulation,[status(thm)],[c_16641,c_162,c_6477]) ).
tcf(c_17290,plain,
greatest_lower_bound(iPr_def_13,least_upper_bound(iPr_def_14,a)) = multiply(iPr_def_10,iPr_def_13),
inference(superposition,[status(thm)],[c_16986,c_5983]) ).
tcf(c_17864,plain,
! [X0: $i] : greatest_lower_bound(X0,multiply(X0,a)) = multiply(X0,iPr_def_10),
inference(superposition,[status(thm)],[c_262,c_1431]) ).
tcf(c_18675,plain,
greatest_lower_bound(iPr_def_13,least_upper_bound(iPr_def_14,a)) = multiply(iPr_def_13,iPr_def_10),
inference(superposition,[status(thm)],[c_7700,c_17864]) ).
tcf(c_18724,plain,
greatest_lower_bound(iPr_def_14,multiply(iPr_def_13,a)) = greatest_lower_bound(iPr_def_14,multiply(iPr_def_13,iPr_def_10)),
inference(superposition,[status(thm)],[c_17864,c_716]) ).
tcf(c_18744,plain,
greatest_lower_bound(multiply(iPr_def_10,iPr_def_13),iPr_def_14) = multiply(iPr_def_10,iPr_def_13),
inference(superposition,[status(thm)],[c_17003,c_293]) ).
tcf(c_18944,plain,
greatest_lower_bound(iPr_def_14,multiply(iPr_def_10,iPr_def_13)) = multiply(iPr_def_10,iPr_def_13),
inference(theory_normalisation,[status(thm)],[c_18744,c_165,c_167,c_166,c_168]) ).
tcf(c_18946,plain,
multiply(iPr_def_10,iPr_def_13) = multiply(iPr_def_13,iPr_def_10),
inference(demodulation,[status(thm)],[c_18675,c_17290]) ).
tcf(c_18961,plain,
greatest_lower_bound(iPr_def_14,multiply(iPr_def_13,a)) = multiply(iPr_def_10,iPr_def_13),
inference(demodulation,[status(thm)],[c_18724,c_18944,c_18946]) ).
tcf(c_18962,plain,
multiply(iPr_def_10,iPr_def_13) = iPr_def_14,
inference(demodulation,[status(thm)],[c_18961,c_161,c_7700]) ).
tcf(c_19553,plain,
multiply(iPr_def_11,iPr_def_14) = iPr_def_13,
inference(superposition,[status(thm)],[c_18962,c_808]) ).
tcf(c_19713,plain,
iPr_def_11 = iPr_def_13,
inference(demodulation,[status(thm)],[c_19553,c_782]) ).
tcf(c_19714,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_19713,c_153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP179-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/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.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Wed Sep 23 14:00:57 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40 Running UEQ theorem proving
% 0.12/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.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...
% 9.09/2.21 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 9.09/2.21 % SZS status Started for theBenchmark.p
% 9.09/2.21 % SZS status Unsatisfiable for theBenchmark.p
% 9.09/2.21
% 9.09/2.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 9.09/2.21
% 9.09/2.21 % ------ iProver source info
% 9.09/2.21
% 9.09/2.21 % git: date: 2026-07-19 20:42:38 +0200
% 9.09/2.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 9.09/2.21 % git: non_committed_changes: false
% 9.09/2.21
% 9.09/2.21 % ------ Parsing...% successful
% 9.09/2.21
% 9.09/2.21
% 9.09/2.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 9.09/2.21
% 9.09/2.21 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 9.09/2.21
% 9.09/2.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 9.09/2.21
% 9.09/2.21 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 9.09/2.21 % ------ Proving...
% 9.09/2.21 % ------ Problem Properties
% 9.09/2.21
% 9.09/2.21 %
% 9.09/2.21 % clauses 24
% 9.09/2.21 % conjectures 1
% 9.09/2.21 % EPR 2
% 9.09/2.21 % Horn 24
% 9.09/2.21 % unary 24
% 9.09/2.21 % binary 0
% 9.09/2.21 % lits 24
% 9.09/2.21 % lits eq 24
% 9.09/2.21 % fd_pure 0
% 9.09/2.21 % fd_pseudo 0
% 9.09/2.21 % fd_cond 0
% 9.09/2.21 % fd_pseudo_cond 0
% 9.09/2.21 % AC symbols 2
% 9.09/2.21
% 9.09/2.21 % ------ Input Options Time Limit: Unbounded
% 9.09/2.21
% 9.09/2.21
% 9.09/2.21 % ------
% 9.09/2.21 % Current options:
% 9.09/2.21 % ------
% 9.09/2.21
% 9.09/2.21
% 9.09/2.21 %
% 9.09/2.21
% 9.09/2.21 % ------ Proving...
% 9.09/2.21 %
% 9.09/2.21
% 9.09/2.21 % SZS status Unsatisfiable for theBenchmark.p
% 9.09/2.21
% 9.09/2.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.09/2.21
% 9.09/2.21
%------------------------------------------------------------------------------