%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP149-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 : n004.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:34 PM UTC 2026
% Result : Unsatisfiable 2.63s 1.27s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 28 !; 0 ?; 16 :)
% 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) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1d_1) ).
fof(f18,plain,
a = greatest_lower_bound(a,c),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1d_2) ).
fof(f20,plain,
b = greatest_lower_bound(b,c),
inference(reorient_equations,[],[f19]) ).
fof(f21,negated_conjecture,
least_upper_bound(least_upper_bound(a,b),c) != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_lub1d) ).
fof(f22,plain,
c != least_upper_bound(least_upper_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) = a,
inference(cnf_transformation,[],[f18]) ).
tcf(c_83,plain,
greatest_lower_bound(b,c) = b,
inference(cnf_transformation,[],[f20]) ).
tcf(c_84,negated_conjecture,
least_upper_bound(least_upper_bound(a,b),c) != c,
inference(cnf_transformation,[],[f22]) ).
tcf(c_100,plain,
greatest_lower_bound(c,a) = a,
inference(theory_normalisation,[status(thm)],[c_82,c_73,c_71,c_72,c_70]) ).
tcf(c_101,plain,
greatest_lower_bound(c,b) = b,
inference(theory_normalisation,[status(thm)],[c_83,c_73,c_71,c_72,c_70]) ).
tcf(c_102,negated_conjecture,
least_upper_bound(c,least_upper_bound(a,b)) != c,
inference(theory_normalisation,[status(thm)],[c_84,c_73,c_71,c_72,c_70]) ).
tcf(c_214,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_73,c_71]) ).
tcf(c_233,plain,
least_upper_bound(c,a) = c,
inference(superposition,[status(thm)],[c_100,c_76]) ).
tcf(c_234,plain,
least_upper_bound(c,b) = c,
inference(superposition,[status(thm)],[c_101,c_76]) ).
tcf(c_254,plain,
! [X0: $i] : least_upper_bound(c,least_upper_bound(X0,b)) = least_upper_bound(X0,c),
inference(superposition,[status(thm)],[c_234,c_214]) ).
tcf(c_256,plain,
least_upper_bound(a,c) != c,
inference(demodulation,[status(thm)],[c_102,c_254]) ).
tcf(c_257,plain,
least_upper_bound(c,a) != c,
inference(theory_normalisation,[status(thm)],[c_256,c_72,c_70,c_73,c_71]) ).
tcf(c_258,plain,
$false,
inference(ground_joinability,[status(thm)],[c_257,c_233]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP149-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.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.02/0.36 % CPULimit : 300
% 0.02/0.36 % WCLimit : 300
% 0.02/0.36 % DateTime : Wed Sep 23 13:52:05 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/0.40 Running UEQ theorem proving
% 0.02/0.40 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.02/0.41
% 0.02/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.41
% 0.02/0.41 % Detected problem language: tptp
% 0.02/0.42 % Proving...
% 2.63/1.27 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.63/1.27 % SZS status Started for theBenchmark.p
% 2.63/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 2.63/1.27
% 2.63/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.63/1.27
% 2.63/1.27 % ------ iProver source info
% 2.63/1.27
% 2.63/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 2.63/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.63/1.27 % git: non_committed_changes: false
% 2.63/1.27
% 2.63/1.27 % ------ Parsing...% successful
% 2.63/1.27
% 2.63/1.27
% 2.63/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.63/1.27
% 2.63/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.63/1.27
% 2.63/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.63/1.27
% 2.63/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.63/1.27 % ------ Proving...
% 2.63/1.27 % ------ Problem Properties
% 2.63/1.27
% 2.63/1.27 %
% 2.63/1.27 % clauses 18
% 2.63/1.27 % conjectures 1
% 2.63/1.27 % EPR 0
% 2.63/1.27 % Horn 18
% 2.63/1.27 % unary 18
% 2.63/1.27 % binary 0
% 2.63/1.27 % lits 18
% 2.63/1.27 % lits eq 18
% 2.63/1.27 % fd_pure 0
% 2.63/1.27 % fd_pseudo 0
% 2.63/1.27 % fd_cond 0
% 2.63/1.27 % fd_pseudo_cond 0
% 2.63/1.27 % AC symbols 2
% 2.63/1.27
% 2.63/1.27 % ------ Input Options Time Limit: Unbounded
% 2.63/1.27
% 2.63/1.27
% 2.63/1.27 % ------
% 2.63/1.27 % Current options:
% 2.63/1.27 % ------
% 2.63/1.27
% 2.63/1.27
% 2.63/1.27 %
% 2.63/1.27
% 2.63/1.27 % ------ Proving...
% 2.63/1.27 %
% 2.63/1.27
% 2.63/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 2.63/1.27
% 2.63/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.63/1.27
% 2.63/1.27
%------------------------------------------------------------------------------