%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP140-1 : 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 : n016.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:33 PM UTC 2026
% Result : Unsatisfiable 2.71s 1.19s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 49 ( 49 unt; 4 def)
% Number of atoms : 94 ( 48 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 : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 30 :)
% 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(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(f17,axiom,
greatest_lower_bound(a,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1c_1) ).
fof(f18,plain,
c = greatest_lower_bound(a,c),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
greatest_lower_bound(b,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1c_2) ).
fof(f20,plain,
c = greatest_lower_bound(b,c),
inference(reorient_equations,[],[f19]) ).
fof(f21,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb1c) ).
fof(f22,plain,
greatest_lower_bound(a,b) != least_upper_bound(greatest_lower_bound(a,b),c),
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_76,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_82,plain,
greatest_lower_bound(a,c) = c,
inference(cnf_transformation,[],[f18]) ).
tcf(c_83,plain,
greatest_lower_bound(b,c) = c,
inference(cnf_transformation,[],[f20]) ).
tcf(c_84,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
inference(cnf_transformation,[],[f22]) ).
tcf(c_141,definition,
iPr_def_10 = greatest_lower_bound(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_142,definition,
iPr_def_11 = least_upper_bound(iPr_def_10,c),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_143,definition,
iPr_def_12 = greatest_lower_bound(b,c),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_144,definition,
iPr_def_13 = greatest_lower_bound(a,c),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_145,negated_conjecture,
iPr_def_11 != iPr_def_10,
inference(demodulation,[status(thm)],[c_84,c_141,c_142]) ).
tcf(c_154,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,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_158,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_159,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_160,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_161,plain,
iPr_def_12 = c,
inference(demodulation,[status(thm)],[c_83,c_143]) ).
tcf(c_162,plain,
iPr_def_13 = c,
inference(demodulation,[status(thm)],[c_82,c_144]) ).
tcf(c_240,plain,
greatest_lower_bound(b,a) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_141,c_158,c_160,c_157,c_159]) ).
tcf(c_241,plain,
least_upper_bound(iPr_def_10,iPr_def_13) = iPr_def_11,
inference(demodulation,[status(thm)],[c_142,c_162]) ).
tcf(c_242,plain,
least_upper_bound(iPr_def_13,iPr_def_10) = iPr_def_11,
inference(theory_normalisation,[status(thm)],[c_241,c_158,c_160,c_157,c_159]) ).
tcf(c_243,plain,
greatest_lower_bound(b,iPr_def_13) = iPr_def_12,
inference(demodulation,[status(thm)],[c_143,c_162]) ).
tcf(c_244,plain,
greatest_lower_bound(iPr_def_13,b) = iPr_def_12,
inference(theory_normalisation,[status(thm)],[c_243,c_158,c_160,c_157,c_159]) ).
tcf(c_245,plain,
greatest_lower_bound(a,iPr_def_13) = iPr_def_13,
inference(demodulation,[status(thm)],[c_144,c_162]) ).
tcf(c_246,plain,
greatest_lower_bound(iPr_def_13,a) = iPr_def_13,
inference(theory_normalisation,[status(thm)],[c_245,c_158,c_160,c_157,c_159]) ).
tcf(c_247,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_158,c_160]) ).
tcf(c_260,plain,
iPr_def_12 = iPr_def_13,
inference(superposition,[status(thm)],[c_161,c_162]) ).
tcf(c_272,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_160,c_154]) ).
tcf(c_305,plain,
! [X0: $i] : greatest_lower_bound(iPr_def_13,greatest_lower_bound(X0,a)) = greatest_lower_bound(X0,iPr_def_13),
inference(superposition,[status(thm)],[c_246,c_247]) ).
tcf(c_786,plain,
greatest_lower_bound(b,iPr_def_13) = greatest_lower_bound(iPr_def_13,iPr_def_10),
inference(superposition,[status(thm)],[c_240,c_305]) ).
tcf(c_903,plain,
greatest_lower_bound(iPr_def_13,b) = greatest_lower_bound(iPr_def_13,iPr_def_10),
inference(theory_normalisation,[status(thm)],[c_786,c_158,c_160,c_157,c_159]) ).
tcf(c_904,plain,
greatest_lower_bound(iPr_def_13,iPr_def_10) = iPr_def_13,
inference(demodulation,[status(thm)],[c_903,c_244,c_260]) ).
tcf(c_1437,plain,
least_upper_bound(iPr_def_10,iPr_def_13) = iPr_def_10,
inference(superposition,[status(thm)],[c_904,c_272]) ).
tcf(c_1669,plain,
least_upper_bound(iPr_def_13,iPr_def_10) = iPr_def_10,
inference(theory_normalisation,[status(thm)],[c_1437,c_158,c_160,c_157,c_159]) ).
tcf(c_1670,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_1669,c_242]) ).
tcf(c_1799,plain,
$false,
inference(superposition,[status(thm)],[c_1670,c_145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP140-1 : 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.38 % Computer : n016.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 13:55:26 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.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 2.71/1.19 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.71/1.19 % SZS status Started for theBenchmark.p
% 2.71/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.71/1.19
% 2.71/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.71/1.19
% 2.71/1.19 % ------ iProver source info
% 2.71/1.19
% 2.71/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 2.71/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.71/1.19 % git: non_committed_changes: false
% 2.71/1.19
% 2.71/1.19 % ------ Parsing...% successful
% 2.71/1.19
% 2.71/1.19
% 2.71/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.71/1.19
% 2.71/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.71/1.19
% 2.71/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.71/1.19
% 2.71/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.71/1.19 % ------ Proving...
% 2.71/1.19 % ------ Problem Properties
% 2.71/1.19
% 2.71/1.19 %
% 2.71/1.19 % clauses 22
% 2.71/1.19 % conjectures 1
% 2.71/1.19 % EPR 3
% 2.71/1.19 % Horn 22
% 2.71/1.19 % unary 22
% 2.71/1.19 % binary 0
% 2.71/1.19 % lits 22
% 2.71/1.19 % lits eq 22
% 2.71/1.19 % fd_pure 0
% 2.71/1.19 % fd_pseudo 0
% 2.71/1.19 % fd_cond 0
% 2.71/1.19 % fd_pseudo_cond 0
% 2.71/1.19 % AC symbols 2
% 2.71/1.19
% 2.71/1.19 % ------ Input Options Time Limit: Unbounded
% 2.71/1.19
% 2.71/1.19
% 2.71/1.19 % ------
% 2.71/1.19 % Current options:
% 2.71/1.19 % ------
% 2.71/1.19
% 2.71/1.19
% 2.71/1.19 %
% 2.71/1.19
% 2.71/1.19 % ------ Proving...
% 2.71/1.19 %
% 2.71/1.19
% 2.71/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.71/1.19
% 2.71/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.71/1.19
%------------------------------------------------------------------------------