%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP175-2 : 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:40 PM UTC 2026
% Result : Unsatisfiable 2.63s 1.19s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
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,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p06b_1) ).
fof(f18,plain,
identity = greatest_lower_bound(identity,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p06b) ).
fof(f20,plain,
identity != greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))),
inference(reorient_equations,[],[f19]) ).
tcf(c_66,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_67,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_78,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_80,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_81,plain,
greatest_lower_bound(identity,b) = identity,
inference(cnf_transformation,[],[f18]) ).
tcf(c_82,negated_conjecture,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
inference(cnf_transformation,[],[f20]) ).
tcf(c_578,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[status(thm)],[c_67,c_78]) ).
tcf(c_595,plain,
multiply(inverse(a),greatest_lower_bound(a,multiply(b,a))) != identity,
inference(demodulation,[status(thm)],[c_82,c_578]) ).
tcf(c_1004,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_66,c_80]) ).
tcf(c_1026,plain,
multiply(inverse(a),multiply(greatest_lower_bound(identity,b),a)) != identity,
inference(demodulation,[status(thm)],[c_595,c_1004]) ).
tcf(c_1027,plain,
$false,
inference(ground_joinability,[status(thm)],[c_1026,c_81,c_66,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP175-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n004.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 13:58:36 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running UEQ theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 2.63/1.19 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.63/1.19 % SZS status Started for theBenchmark.p
% 2.63/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.63/1.19
% 2.63/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.63/1.19
% 2.63/1.19 % ------ iProver source info
% 2.63/1.19
% 2.63/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 2.63/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.63/1.19 % git: non_committed_changes: false
% 2.63/1.19
% 2.63/1.19 % ------ Parsing...% successful
% 2.63/1.19
% 2.63/1.19
% 2.63/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.63/1.19
% 2.63/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.63/1.19
% 2.63/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.63/1.19
% 2.63/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.63/1.19 % ------ Proving...
% 2.63/1.19 % ------ Problem Properties
% 2.63/1.19
% 2.63/1.19 %
% 2.63/1.19 % clauses 17
% 2.63/1.19 % conjectures 1
% 2.63/1.19 % EPR 0
% 2.63/1.19 % Horn 17
% 2.63/1.19 % unary 17
% 2.63/1.19 % binary 0
% 2.63/1.19 % lits 17
% 2.63/1.19 % lits eq 17
% 2.63/1.19 % fd_pure 0
% 2.63/1.19 % fd_pseudo 0
% 2.63/1.19 % fd_cond 0
% 2.63/1.19 % fd_pseudo_cond 0
% 2.63/1.19 % AC symbols 2
% 2.63/1.19
% 2.63/1.19 % ------ Input Options Time Limit: Unbounded
% 2.63/1.19
% 2.63/1.19
% 2.63/1.19 % ------
% 2.63/1.19 % Current options:
% 2.63/1.19 % ------
% 2.63/1.19
% 2.63/1.19
% 2.63/1.19 %
% 2.63/1.19
% 2.63/1.19 % ------ Proving...
% 2.63/1.19 %
% 2.63/1.19
% 2.63/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.63/1.19
% 2.63/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.63/1.19
% 2.63/1.19
%------------------------------------------------------------------------------