%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP178-1 : 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 : n008.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 17.33s 8.27s
% Output : CNFRefutation 17.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 23
% Syntax : Number of formulae : 109 ( 109 unt; 7 def)
% Number of atoms : 231 ( 108 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 : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 8 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn 108 !; 0 ?; 82 :)
% 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(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(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,
least_upper_bound(identity,a) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p09a_1) ).
fof(f18,plain,
a = least_upper_bound(identity,a),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p09a_2) ).
fof(f20,plain,
b = least_upper_bound(identity,b),
inference(reorient_equations,[],[f19]) ).
fof(f21,axiom,
least_upper_bound(identity,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p09a_3) ).
fof(f22,plain,
c = least_upper_bound(identity,c),
inference(reorient_equations,[],[f21]) ).
fof(f23,axiom,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p09a_4) ).
fof(f24,plain,
identity = greatest_lower_bound(a,b),
inference(reorient_equations,[],[f23]) ).
fof(f25,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p09a) ).
tcf(c_69,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_70,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_74,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_75,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_78,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_81,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_83,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_84,plain,
least_upper_bound(identity,a) = a,
inference(cnf_transformation,[],[f18]) ).
tcf(c_85,plain,
least_upper_bound(identity,b) = b,
inference(cnf_transformation,[],[f20]) ).
tcf(c_86,plain,
least_upper_bound(identity,c) = c,
inference(cnf_transformation,[],[f22]) ).
tcf(c_87,plain,
greatest_lower_bound(a,b) = identity,
inference(cnf_transformation,[],[f24]) ).
tcf(c_88,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
inference(cnf_transformation,[],[f25]) ).
tcf(c_104,plain,
least_upper_bound(a,identity) = a,
inference(theory_normalisation,[status(thm)],[c_84,c_74,c_72,c_75,c_73]) ).
tcf(c_105,plain,
least_upper_bound(b,identity) = b,
inference(theory_normalisation,[status(thm)],[c_85,c_74,c_72,c_75,c_73]) ).
tcf(c_106,plain,
least_upper_bound(c,identity) = c,
inference(theory_normalisation,[status(thm)],[c_86,c_74,c_72,c_75,c_73]) ).
tcf(c_107,plain,
greatest_lower_bound(b,a) = identity,
inference(theory_normalisation,[status(thm)],[c_87,c_74,c_72,c_75,c_73]) ).
tcf(c_153,definition,
iPr_def_10 = multiply(b,c),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_154,definition,
iPr_def_11 = greatest_lower_bound(a,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_155,definition,
iPr_def_12 = greatest_lower_bound(a,c),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_156,definition,
iPr_def_13 = greatest_lower_bound(b,a),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_157,definition,
iPr_def_14 = least_upper_bound(c,identity),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_158,definition,
iPr_def_15 = least_upper_bound(b,identity),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_159,definition,
iPr_def_16 = least_upper_bound(a,identity),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_160,negated_conjecture,
iPr_def_11 != iPr_def_12,
inference(demodulation,[status(thm)],[c_88,c_155,c_153,c_154]) ).
tcf(c_161,plain,
iPr_def_13 = identity,
inference(demodulation,[status(thm)],[c_107,c_156]) ).
tcf(c_162,plain,
iPr_def_14 = c,
inference(demodulation,[status(thm)],[c_106,c_157]) ).
tcf(c_163,plain,
iPr_def_15 = b,
inference(demodulation,[status(thm)],[c_105,c_158]) ).
tcf(c_164,plain,
iPr_def_16 = a,
inference(demodulation,[status(thm)],[c_104,c_159]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_166,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_167,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_69]) ).
tcf(c_168,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_83]) ).
tcf(c_170,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_81]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_79]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_78]) ).
tcf(c_176,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_75]) ).
tcf(c_177,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_74]) ).
tcf(c_178,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(demodulation,[status(thm)],[c_73]) ).
tcf(c_179,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(demodulation,[status(thm)],[c_72]) ).
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_177,c_179]) ).
tcf(c_273,plain,
multiply(iPr_def_15,iPr_def_14) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_153,c_162,c_163]) ).
tcf(c_274,plain,
greatest_lower_bound(iPr_def_16,iPr_def_10) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_154,c_164]) ).
tcf(c_275,plain,
greatest_lower_bound(iPr_def_16,iPr_def_14) = iPr_def_12,
inference(light_normalisation,[status(thm)],[c_155,c_162,c_164]) ).
tcf(c_276,plain,
greatest_lower_bound(iPr_def_15,iPr_def_16) = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_156,c_163,c_164]) ).
tcf(c_277,plain,
least_upper_bound(iPr_def_14,iPr_def_13) = iPr_def_14,
inference(light_normalisation,[status(thm)],[c_157,c_161,c_162]) ).
tcf(c_278,plain,
least_upper_bound(iPr_def_15,iPr_def_13) = iPr_def_15,
inference(light_normalisation,[status(thm)],[c_158,c_161,c_163]) ).
tcf(c_280,plain,
! [X0: $i] : multiply(iPr_def_13,X0) = X0,
inference(light_normalisation,[status(thm)],[c_167,c_161]) ).
tcf(c_281,plain,
! [X0: $i] : multiply(inverse(X0),X0) = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_166,c_161]) ).
tcf(c_293,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = multiply(iPr_def_13,X1),
inference(superposition,[status(thm)],[c_281,c_165]) ).
tcf(c_296,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_293,c_280]) ).
tcf(c_303,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(iPr_def_13,X1),X0),
inference(superposition,[status(thm)],[c_280,c_168]) ).
tcf(c_306,plain,
! [X0: $i] : greatest_lower_bound(multiply(X0,iPr_def_14),iPr_def_10) = multiply(greatest_lower_bound(X0,iPr_def_15),iPr_def_14),
inference(superposition,[status(thm)],[c_273,c_168]) ).
tcf(c_311,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_10,multiply(X0,iPr_def_14)) = multiply(greatest_lower_bound(X0,iPr_def_15),iPr_def_14),
inference(demodulation,[status(thm)],[c_306,c_179]) ).
tcf(c_364,plain,
least_upper_bound(iPr_def_13,iPr_def_14) = iPr_def_14,
inference(demodulation,[status(thm)],[c_277,c_178]) ).
tcf(c_365,plain,
least_upper_bound(iPr_def_13,iPr_def_15) = iPr_def_15,
inference(demodulation,[status(thm)],[c_278,c_178]) ).
tcf(c_373,plain,
greatest_lower_bound(iPr_def_13,iPr_def_14) = iPr_def_13,
inference(superposition,[status(thm)],[c_364,c_172]) ).
tcf(c_374,plain,
greatest_lower_bound(iPr_def_13,iPr_def_15) = iPr_def_13,
inference(superposition,[status(thm)],[c_365,c_172]) ).
tcf(c_406,plain,
! [X0: $i] : least_upper_bound(iPr_def_13,least_upper_bound(iPr_def_14,X0)) = least_upper_bound(iPr_def_14,X0),
inference(superposition,[status(thm)],[c_364,c_176]) ).
tcf(c_430,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_16,greatest_lower_bound(iPr_def_10,X0)) = greatest_lower_bound(iPr_def_11,X0),
inference(superposition,[status(thm)],[c_274,c_177]) ).
tcf(c_432,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_15,greatest_lower_bound(iPr_def_16,X0)) = greatest_lower_bound(iPr_def_13,X0),
inference(superposition,[status(thm)],[c_276,c_177]) ).
tcf(c_437,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_16,greatest_lower_bound(iPr_def_15,X0)) = greatest_lower_bound(iPr_def_13,X0),
inference(demodulation,[status(thm)],[c_432,c_268]) ).
tcf(c_616,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_16,greatest_lower_bound(X0,iPr_def_10)) = greatest_lower_bound(X0,iPr_def_11),
inference(superposition,[status(thm)],[c_274,c_268]) ).
tcf(c_674,plain,
! [X0: $i] : multiply(inverse(inverse(X0)),iPr_def_13) = X0,
inference(superposition,[status(thm)],[c_281,c_296]) ).
tcf(c_680,plain,
! [X0: $i,X1: $i] : multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_296,c_296]) ).
tcf(c_805,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,multiply(inverse(inverse(X0)),X1)) = multiply(inverse(inverse(X0)),greatest_lower_bound(iPr_def_13,X1)),
inference(superposition,[status(thm)],[c_674,c_170]) ).
tcf(c_815,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,multiply(X0,X1)) = multiply(X0,greatest_lower_bound(iPr_def_13,X1)),
inference(demodulation,[status(thm)],[c_805,c_680]) ).
tcf(c_1014,plain,
! [X0: $i] : greatest_lower_bound(X0,multiply(iPr_def_15,X0)) = multiply(iPr_def_13,X0),
inference(superposition,[status(thm)],[c_374,c_303]) ).
tcf(c_1038,plain,
! [X0: $i] : greatest_lower_bound(X0,multiply(iPr_def_15,X0)) = X0,
inference(demodulation,[status(thm)],[c_1014,c_280]) ).
tcf(c_1112,plain,
greatest_lower_bound(iPr_def_14,iPr_def_10) = iPr_def_14,
inference(superposition,[status(thm)],[c_273,c_1038]) ).
tcf(c_1125,plain,
greatest_lower_bound(iPr_def_10,iPr_def_14) = iPr_def_14,
inference(demodulation,[status(thm)],[c_1112,c_179]) ).
tcf(c_1131,plain,
least_upper_bound(iPr_def_10,iPr_def_14) = iPr_def_10,
inference(superposition,[status(thm)],[c_1125,c_173]) ).
tcf(c_1669,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_13,least_upper_bound(iPr_def_14,X0)) = iPr_def_13,
inference(superposition,[status(thm)],[c_406,c_172]) ).
tcf(c_2023,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_13,least_upper_bound(X0,iPr_def_14)) = iPr_def_13,
inference(superposition,[status(thm)],[c_178,c_1669]) ).
tcf(c_2052,plain,
greatest_lower_bound(iPr_def_13,iPr_def_10) = iPr_def_13,
inference(superposition,[status(thm)],[c_1131,c_2023]) ).
tcf(c_11274,plain,
greatest_lower_bound(iPr_def_13,iPr_def_10) = greatest_lower_bound(iPr_def_15,iPr_def_11),
inference(superposition,[status(thm)],[c_616,c_437]) ).
tcf(c_11277,plain,
greatest_lower_bound(iPr_def_11,iPr_def_15) = iPr_def_13,
inference(demodulation,[status(thm)],[c_11274,c_179,c_2052]) ).
tcf(c_12609,plain,
greatest_lower_bound(iPr_def_10,multiply(iPr_def_11,iPr_def_14)) = multiply(iPr_def_13,iPr_def_14),
inference(superposition,[status(thm)],[c_11277,c_311]) ).
tcf(c_12611,plain,
greatest_lower_bound(iPr_def_10,multiply(iPr_def_11,iPr_def_14)) = iPr_def_14,
inference(demodulation,[status(thm)],[c_12609,c_280]) ).
tcf(c_20259,plain,
! [X0: $i] : multiply(X0,iPr_def_13) = X0,
inference(demodulation,[status(thm)],[c_674,c_680]) ).
tcf(c_32029,plain,
! [X0: $i] : greatest_lower_bound(X0,multiply(X0,iPr_def_14)) = multiply(X0,iPr_def_13),
inference(superposition,[status(thm)],[c_373,c_815]) ).
tcf(c_32217,plain,
! [X0: $i] : greatest_lower_bound(X0,multiply(X0,iPr_def_14)) = X0,
inference(demodulation,[status(thm)],[c_32029,c_20259]) ).
tcf(c_37994,plain,
greatest_lower_bound(iPr_def_11,multiply(iPr_def_11,iPr_def_14)) = greatest_lower_bound(iPr_def_16,iPr_def_14),
inference(superposition,[status(thm)],[c_12611,c_430]) ).
tcf(c_37998,plain,
iPr_def_11 = iPr_def_12,
inference(demodulation,[status(thm)],[c_37994,c_275,c_32217]) ).
tcf(c_37999,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_37998,c_160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP178-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n008.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Wed Sep 23 14:00:57 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running UEQ theorem proving
% 0.15/5.42 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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 17.33/8.27 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 17.33/8.27 % SZS status Started for theBenchmark.p
% 17.33/8.27 % SZS status Unsatisfiable for theBenchmark.p
% 17.33/8.27
% 17.33/8.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 17.33/8.27
% 17.33/8.27 % ------ iProver source info
% 17.33/8.27
% 17.33/8.27 % git: date: 2026-07-19 20:42:38 +0200
% 17.33/8.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 17.33/8.27 % git: non_committed_changes: false
% 17.33/8.27
% 17.33/8.27 % ------ Parsing...% successful
% 17.33/8.27
% 17.33/8.27
% 17.33/8.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 17.33/8.27
% 17.33/8.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 17.33/8.27
% 17.33/8.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 17.33/8.27
% 17.33/8.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 17.33/8.27 % ------ Proving...
% 17.33/8.27 % ------ Problem Properties
% 17.33/8.27
% 17.33/8.27 %
% 17.33/8.27 % clauses 27
% 17.33/8.27 % conjectures 1
% 17.33/8.27 % EPR 5
% 17.33/8.27 % Horn 27
% 17.33/8.27 % unary 27
% 17.33/8.27 % binary 0
% 17.33/8.27 % lits 27
% 17.33/8.27 % lits eq 27
% 17.33/8.27 % fd_pure 0
% 17.33/8.27 % fd_pseudo 0
% 17.33/8.27 % fd_cond 0
% 17.33/8.27 % fd_pseudo_cond 0
% 17.33/8.27 % AC symbols 2
% 17.33/8.27
% 17.33/8.27 % ------ Input Options Time Limit: Unbounded
% 17.33/8.27
% 17.33/8.27
% 17.33/8.27 % ------
% 17.33/8.27 % Current options:
% 17.33/8.27 % ------
% 17.33/8.27
% 17.33/8.27
% 17.33/8.27 %
% 17.33/8.27
% 17.33/8.27 % ------ Proving...
% 17.33/8.27 %
% 17.33/8.27
% 17.33/8.27 % SZS status Unsatisfiable for theBenchmark.p
% 17.33/8.27
% 17.33/8.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.33/8.28
% 17.33/8.28
%------------------------------------------------------------------------------