%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP170-4 : 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 : 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:39 PM UTC 2026
% Result : Unsatisfiable 7.68s 2.19s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 70 ( 70 unt; 5 def)
% Number of atoms : 125 ( 69 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 : 7 ( 5 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 80 !; 0 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
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(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f17,axiom,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_1) ).
fof(f18,plain,
b = least_upper_bound(a,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
greatest_lower_bound(c,d) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_2) ).
fof(f20,plain,
c = greatest_lower_bound(c,d),
inference(reorient_equations,[],[f19]) ).
fof(f21,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p03d) ).
fof(f22,plain,
multiply(b,d) != least_upper_bound(multiply(a,c),multiply(b,d)),
inference(reorient_equations,[],[f21]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_72,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_73,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_74,plain,
! [X0: $i] : least_upper_bound(X0,X0) = X0,
inference(cnf_transformation,[],[f9]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_77,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] : 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] : greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
inference(cnf_transformation,[],[f16]) ).
tcf(c_82,plain,
least_upper_bound(a,b) = b,
inference(cnf_transformation,[],[f18]) ).
tcf(c_83,plain,
greatest_lower_bound(c,d) = c,
inference(cnf_transformation,[],[f20]) ).
tcf(c_84,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
inference(cnf_transformation,[],[f22]) ).
tcf(c_141,definition,
iPr_def_10 = multiply(a,c),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_142,definition,
iPr_def_11 = multiply(b,d),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_143,definition,
iPr_def_12 = least_upper_bound(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_144,definition,
iPr_def_13 = greatest_lower_bound(c,d),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_145,definition,
iPr_def_14 = least_upper_bound(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_146,negated_conjecture,
iPr_def_12 != iPr_def_11,
inference(demodulation,[status(thm)],[c_84,c_142,c_141,c_143]) ).
tcf(c_150,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_81]) ).
tcf(c_152,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_79]) ).
tcf(c_154,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_77]) ).
tcf(c_155,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_76]) ).
tcf(c_157,plain,
! [X0: $i] : least_upper_bound(X0,X0) = X0,
inference(demodulation,[status(thm)],[c_74]) ).
tcf(c_158,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_73]) ).
tcf(c_159,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_72]) ).
tcf(c_160,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_161,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_162,plain,
iPr_def_13 = c,
inference(demodulation,[status(thm)],[c_83,c_144]) ).
tcf(c_163,plain,
iPr_def_14 = b,
inference(demodulation,[status(thm)],[c_82,c_145]) ).
tcf(c_243,plain,
multiply(a,iPr_def_13) = iPr_def_10,
inference(demodulation,[status(thm)],[c_141,c_162]) ).
tcf(c_244,plain,
multiply(iPr_def_14,d) = iPr_def_11,
inference(demodulation,[status(thm)],[c_142,c_163]) ).
tcf(c_245,plain,
greatest_lower_bound(iPr_def_13,d) = iPr_def_13,
inference(demodulation,[status(thm)],[c_144,c_162]) ).
tcf(c_246,plain,
least_upper_bound(a,iPr_def_14) = iPr_def_14,
inference(demodulation,[status(thm)],[c_145,c_163]) ).
tcf(c_247,plain,
least_upper_bound(iPr_def_14,a) = iPr_def_14,
inference(theory_normalisation,[status(thm)],[c_246,c_158,c_160,c_159,c_161]) ).
tcf(c_248,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_158,c_160]) ).
tcf(c_249,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_159,c_161]) ).
tcf(c_266,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_160,c_154]) ).
tcf(c_276,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,least_upper_bound(X0,X1)) = least_upper_bound(X0,X1),
inference(superposition,[status(thm)],[c_157,c_158]) ).
tcf(c_298,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_11,multiply(X0,d)) = multiply(greatest_lower_bound(iPr_def_14,X0),d),
inference(superposition,[status(thm)],[c_244,c_150]) ).
tcf(c_358,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_10,multiply(a,X0)) = multiply(a,greatest_lower_bound(iPr_def_13,X0)),
inference(superposition,[status(thm)],[c_243,c_152]) ).
tcf(c_447,plain,
! [X0: $i] : least_upper_bound(iPr_def_10,least_upper_bound(X0,iPr_def_11)) = least_upper_bound(X0,iPr_def_12),
inference(superposition,[status(thm)],[c_143,c_248]) ).
tcf(c_507,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_249,c_155]) ).
tcf(c_686,plain,
greatest_lower_bound(a,iPr_def_14) = a,
inference(superposition,[status(thm)],[c_247,c_266]) ).
tcf(c_756,plain,
least_upper_bound(iPr_def_10,iPr_def_12) = iPr_def_12,
inference(superposition,[status(thm)],[c_143,c_276]) ).
tcf(c_838,plain,
least_upper_bound(iPr_def_10,iPr_def_11) = least_upper_bound(iPr_def_10,iPr_def_12),
inference(superposition,[status(thm)],[c_447,c_276]) ).
tcf(c_951,plain,
greatest_lower_bound(iPr_def_14,a) = a,
inference(theory_normalisation,[status(thm)],[c_686,c_158,c_160,c_159,c_161]) ).
tcf(c_953,plain,
least_upper_bound(iPr_def_10,iPr_def_11) = iPr_def_12,
inference(demodulation,[status(thm)],[c_838,c_756]) ).
tcf(c_4954,plain,
greatest_lower_bound(iPr_def_11,multiply(a,d)) = multiply(a,d),
inference(superposition,[status(thm)],[c_951,c_298]) ).
tcf(c_5561,plain,
greatest_lower_bound(iPr_def_10,multiply(a,d)) = multiply(a,iPr_def_13),
inference(superposition,[status(thm)],[c_245,c_358]) ).
tcf(c_5677,plain,
! [X0: $i] : least_upper_bound(iPr_def_11,greatest_lower_bound(X0,multiply(a,d))) = iPr_def_11,
inference(superposition,[status(thm)],[c_4954,c_507]) ).
tcf(c_5773,plain,
greatest_lower_bound(iPr_def_10,multiply(a,d)) = iPr_def_10,
inference(demodulation,[status(thm)],[c_5561,c_243]) ).
tcf(c_6125,plain,
least_upper_bound(iPr_def_11,iPr_def_10) = iPr_def_11,
inference(superposition,[status(thm)],[c_5773,c_5677]) ).
tcf(c_6237,plain,
least_upper_bound(iPr_def_10,iPr_def_11) = iPr_def_11,
inference(theory_normalisation,[status(thm)],[c_6125,c_158,c_160,c_159,c_161]) ).
tcf(c_6238,plain,
iPr_def_11 = iPr_def_12,
inference(demodulation,[status(thm)],[c_6237,c_953]) ).
tcf(c_6541,plain,
$false,
inference(superposition,[status(thm)],[c_6238,c_146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP170-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 13:58:11 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running UEQ theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 7.68/2.19 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 7.68/2.19 % SZS status Started for theBenchmark.p
% 7.68/2.19 % SZS status Unsatisfiable for theBenchmark.p
% 7.68/2.19
% 7.68/2.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.68/2.19
% 7.68/2.19 % ------ iProver source info
% 7.68/2.19
% 7.68/2.19 % git: date: 2026-07-19 20:42:38 +0200
% 7.68/2.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.68/2.19 % git: non_committed_changes: false
% 7.68/2.19
% 7.68/2.19 % ------ Parsing...% successful
% 7.68/2.19
% 7.68/2.19
% 7.68/2.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.68/2.19
% 7.68/2.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 7.68/2.19
% 7.68/2.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.68/2.19
% 7.68/2.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 7.68/2.19 % ------ Proving...
% 7.68/2.19 % ------ Problem Properties
% 7.68/2.19
% 7.68/2.19 %
% 7.68/2.19 % clauses 23
% 7.68/2.19 % conjectures 1
% 7.68/2.19 % EPR 3
% 7.68/2.19 % Horn 23
% 7.68/2.19 % unary 23
% 7.68/2.19 % binary 0
% 7.68/2.19 % lits 23
% 7.68/2.19 % lits eq 23
% 7.68/2.19 % fd_pure 0
% 7.68/2.19 % fd_pseudo 0
% 7.68/2.19 % fd_cond 0
% 7.68/2.19 % fd_pseudo_cond 0
% 7.68/2.19 % AC symbols 2
% 7.68/2.19
% 7.68/2.19 % ------ Input Options Time Limit: Unbounded
% 7.68/2.19
% 7.68/2.19
% 7.68/2.19 % ------
% 7.68/2.19 % Current options:
% 7.68/2.19 % ------
% 7.68/2.19
% 7.68/2.19
% 7.68/2.19 %
% 7.68/2.19
% 7.68/2.19 % ------ Proving...
% 7.68/2.19 %
% 7.68/2.19
% 7.68/2.19 % SZS status Unsatisfiable for theBenchmark.p
% 7.68/2.19
% 7.68/2.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.68/2.19
%------------------------------------------------------------------------------