%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP193-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 : n011.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:46 PM UTC 2026
% Result : Unsatisfiable 3.05s 1.07s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 41 ( 41 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
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(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(f19,axiom,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9a_2) ).
fof(f20,plain,
b = least_upper_bound(identity,b),
inference(reorient_equations,[],[f19]) ).
fof(f23,axiom,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9a_4) ).
fof(f24,plain,
identity = greatest_lower_bound(a,b),
inference(reorient_equations,[],[f23]) ).
fof(f25,axiom,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9a_5) ).
fof(f26,plain,
multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
inference(reorient_equations,[],[f25]) ).
fof(f27,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p8_9a) ).
tcf(c_70,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_75,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_76,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_79,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_84,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_86,plain,
least_upper_bound(identity,b) = b,
inference(cnf_transformation,[],[f20]) ).
tcf(c_88,plain,
greatest_lower_bound(a,b) = identity,
inference(cnf_transformation,[],[f24]) ).
tcf(c_89,plain,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)),
inference(cnf_transformation,[],[f26]) ).
tcf(c_90,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
inference(cnf_transformation,[],[f27]) ).
tcf(c_107,plain,
least_upper_bound(b,identity) = b,
inference(theory_normalisation,[status(thm)],[c_86,c_75,c_73,c_76,c_74]) ).
tcf(c_151,plain,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c))) = multiply(identity,greatest_lower_bound(a,c)),
inference(light_normalisation,[status(thm)],[c_89,c_88]) ).
tcf(c_152,plain,
least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(a,multiply(b,c))) = greatest_lower_bound(a,c),
inference(demodulation,[status(thm)],[c_151,c_74,c_70]) ).
tcf(c_243,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_74,c_80]) ).
tcf(c_264,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(greatest_lower_bound(X0,X1),X0) = greatest_lower_bound(X0,X1),
inference(superposition,[status(thm)],[c_79,c_243]) ).
tcf(c_266,plain,
greatest_lower_bound(identity,b) = identity,
inference(superposition,[status(thm)],[c_107,c_243]) ).
tcf(c_269,plain,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)) = greatest_lower_bound(a,multiply(b,c)),
inference(superposition,[status(thm)],[c_152,c_243]) ).
tcf(c_273,plain,
greatest_lower_bound(b,identity) = identity,
inference(theory_normalisation,[status(thm)],[c_266,c_76,c_74,c_75,c_73]) ).
tcf(c_277,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,greatest_lower_bound(X1,X0)) = greatest_lower_bound(X0,X1),
inference(theory_normalisation,[status(thm)],[c_264,c_76,c_74,c_75,c_73]) ).
tcf(c_278,plain,
greatest_lower_bound(a,greatest_lower_bound(a,greatest_lower_bound(c,multiply(b,c)))) = greatest_lower_bound(a,multiply(b,c)),
inference(theory_normalisation,[status(thm)],[c_269,c_76,c_74,c_75,c_73]) ).
tcf(c_299,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,greatest_lower_bound(X0,X1)) = greatest_lower_bound(X0,X1),
inference(superposition,[status(thm)],[c_73,c_277]) ).
tcf(c_957,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_70,c_84]) ).
tcf(c_1704,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(demodulation,[status(thm)],[c_278,c_73,c_70,c_273,c_299,c_957]) ).
tcf(c_1705,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1704,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP193-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.08/0.36 % Computer : n011.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 14:06:13 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40 Running UEQ theorem proving
% 0.08/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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.42 % Proving...
% 3.05/1.07 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.05/1.07 % SZS status Started for theBenchmark.p
% 3.05/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 3.05/1.07
% 3.05/1.07 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.05/1.07
% 3.05/1.07 % ------ iProver source info
% 3.05/1.07
% 3.05/1.07 % git: date: 2026-07-19 20:42:38 +0200
% 3.05/1.07 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.05/1.07 % git: non_committed_changes: false
% 3.05/1.07
% 3.05/1.07 % ------ Parsing...% successful
% 3.05/1.07
% 3.05/1.07
% 3.05/1.07 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.05/1.07
% 3.05/1.07 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.05/1.07
% 3.05/1.07 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.05/1.07
% 3.05/1.07 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.05/1.07 % ------ Proving...
% 3.05/1.07 % ------ Problem Properties
% 3.05/1.07
% 3.05/1.07 %
% 3.05/1.07 % clauses 21
% 3.05/1.07 % conjectures 1
% 3.05/1.07 % EPR 0
% 3.05/1.07 % Horn 21
% 3.05/1.07 % unary 21
% 3.05/1.07 % binary 0
% 3.05/1.07 % lits 21
% 3.05/1.07 % lits eq 21
% 3.05/1.07 % fd_pure 0
% 3.05/1.07 % fd_pseudo 0
% 3.05/1.07 % fd_cond 0
% 3.05/1.07 % fd_pseudo_cond 0
% 3.05/1.07 % AC symbols 2
% 3.05/1.07
% 3.05/1.07 % ------ Input Options Time Limit: Unbounded
% 3.05/1.07
% 3.05/1.07
% 3.05/1.07 % ------
% 3.05/1.07 % Current options:
% 3.05/1.07 % ------
% 3.05/1.07
% 3.05/1.07
% 3.05/1.07 %
% 3.05/1.07
% 3.05/1.07 % ------ Proving...
% 3.05/1.07 %
% 3.05/1.07
% 3.05/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 3.05/1.07
% 3.05/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.05/1.07
% 3.05/1.07
%------------------------------------------------------------------------------