%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP002-2 : 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 : n012.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:29:51 PM UTC 2026
% Result : Unsatisfiable 3.57s 1.08s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 63 ( 63 unt; 0 def)
% Number of atoms : 63 ( 62 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0] : multiply(X0,identity) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).
fof(f6,axiom,
! [X0] : multiply(X0,inverse(X0)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).
fof(f7,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(reorient_equations,[],[f6]) ).
fof(f8,axiom,
! [X0] : multiply(X0,multiply(X0,X0)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_cubed_is_identity) ).
fof(f9,plain,
! [X0] : identity = multiply(X0,multiply(X0,X0)),
inference(reorient_equations,[],[f8]) ).
fof(f10,negated_conjecture,
multiply(a,b) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b_is_c) ).
fof(f11,negated_conjecture,
multiply(c,inverse(a)) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_times_inverse_a_is_d) ).
fof(f12,negated_conjecture,
multiply(d,inverse(b)) = h,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_times_inverse_b_is_h) ).
fof(f13,negated_conjecture,
multiply(h,b) = j,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_times_b_is_j) ).
fof(f14,negated_conjecture,
multiply(j,inverse(h)) = k,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',j_times_inverse_h_is_k) ).
fof(f15,negated_conjecture,
multiply(k,inverse(b)) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_k_times_inverse_b_is_e) ).
fof(f16,plain,
identity != multiply(k,inverse(b)),
inference(reorient_equations,[],[f15]) ).
tcf(c_61,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_62,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_64,plain,
! [X0: $i] : multiply(X0,identity) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_65,plain,
! [X0: $i] : multiply(X0,inverse(X0)) = identity,
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i] : multiply(X0,multiply(X0,X0)) = identity,
inference(cnf_transformation,[],[f9]) ).
tcf(c_67,negated_conjecture,
multiply(a,b) = c,
inference(cnf_transformation,[],[f10]) ).
tcf(c_68,negated_conjecture,
multiply(c,inverse(a)) = d,
inference(cnf_transformation,[],[f11]) ).
tcf(c_69,negated_conjecture,
multiply(d,inverse(b)) = h,
inference(cnf_transformation,[],[f12]) ).
tcf(c_70,negated_conjecture,
multiply(h,b) = j,
inference(cnf_transformation,[],[f13]) ).
tcf(c_71,negated_conjecture,
multiply(j,inverse(h)) = k,
inference(cnf_transformation,[],[f14]) ).
tcf(c_72,negated_conjecture,
multiply(k,inverse(b)) != identity,
inference(cnf_transformation,[],[f16]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(inverse(X0),X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_65,c_63]) ).
tcf(c_167,plain,
! [X0: $i] : multiply(a,multiply(b,X0)) = multiply(c,X0),
inference(superposition,[status(thm)],[c_67,c_63]) ).
tcf(c_168,plain,
! [X0: $i] : multiply(c,multiply(inverse(a),X0)) = multiply(d,X0),
inference(superposition,[status(thm)],[c_68,c_63]) ).
tcf(c_169,plain,
! [X0: $i] : multiply(d,multiply(inverse(b),X0)) = multiply(h,X0),
inference(superposition,[status(thm)],[c_69,c_63]) ).
tcf(c_196,plain,
multiply(c,inverse(b)) = multiply(a,identity),
inference(superposition,[status(thm)],[c_65,c_167]) ).
tcf(c_201,plain,
multiply(c,inverse(b)) = a,
inference(demodulation,[status(thm)],[c_196,c_64]) ).
tcf(c_221,plain,
multiply(c,identity) = multiply(d,a),
inference(superposition,[status(thm)],[c_62,c_168]) ).
tcf(c_228,plain,
multiply(d,identity) = multiply(h,b),
inference(superposition,[status(thm)],[c_62,c_169]) ).
tcf(c_230,plain,
multiply(d,identity) = j,
inference(light_normalisation,[status(thm)],[c_228,c_70]) ).
tcf(c_234,plain,
d = j,
inference(demodulation,[status(thm)],[c_230,c_64]) ).
tcf(c_236,plain,
multiply(d,inverse(h)) = k,
inference(demodulation,[status(thm)],[c_71,c_234]) ).
tcf(c_237,plain,
multiply(h,b) = d,
inference(demodulation,[status(thm)],[c_70,c_234]) ).
tcf(c_247,plain,
! [X0: $i] : multiply(d,multiply(inverse(h),X0)) = multiply(k,X0),
inference(superposition,[status(thm)],[c_236,c_63]) ).
tcf(c_252,plain,
multiply(d,a) = c,
inference(demodulation,[status(thm)],[c_221,c_64]) ).
tcf(c_256,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_165,c_61]) ).
tcf(c_260,plain,
! [X0: $i] : multiply(X0,identity) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_65,c_256]) ).
tcf(c_261,plain,
! [X0: $i] : multiply(inverse(X0),inverse(X0)) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_66,c_256]) ).
tcf(c_274,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_260,c_64]) ).
tcf(c_275,plain,
! [X0: $i] : multiply(inverse(X0),inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_261,c_64]) ).
tcf(c_287,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_274,c_256]) ).
tcf(c_314,plain,
! [X0: $i] : multiply(X0,X0) = inverse(X0),
inference(superposition,[status(thm)],[c_275,c_256]) ).
tcf(c_326,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X0,X1)) = multiply(inverse(X0),X1),
inference(superposition,[status(thm)],[c_314,c_63]) ).
tcf(c_327,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X1,multiply(X0,X1))) = inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_314,c_63]) ).
tcf(c_345,plain,
multiply(inverse(h),d) = b,
inference(superposition,[status(thm)],[c_237,c_287]) ).
tcf(c_353,plain,
multiply(inverse(c),a) = inverse(b),
inference(superposition,[status(thm)],[c_201,c_287]) ).
tcf(c_413,plain,
! [X0: $i] : multiply(inverse(h),multiply(d,X0)) = multiply(b,X0),
inference(superposition,[status(thm)],[c_345,c_63]) ).
tcf(c_1073,plain,
! [X0: $i] : multiply(inverse(a),multiply(b,X0)) = multiply(a,multiply(c,X0)),
inference(superposition,[status(thm)],[c_167,c_326]) ).
tcf(c_1408,plain,
multiply(inverse(h),c) = multiply(b,a),
inference(superposition,[status(thm)],[c_252,c_413]) ).
tcf(c_1667,plain,
multiply(d,multiply(b,a)) = multiply(k,c),
inference(superposition,[status(thm)],[c_1408,c_247]) ).
tcf(c_1686,plain,
! [X0: $i] : multiply(c,multiply(a,multiply(c,X0))) = multiply(d,multiply(b,X0)),
inference(superposition,[status(thm)],[c_1073,c_168]) ).
tcf(c_3038,plain,
multiply(d,multiply(b,a)) = inverse(multiply(c,a)),
inference(superposition,[status(thm)],[c_327,c_1686]) ).
tcf(c_3046,plain,
inverse(multiply(c,a)) = multiply(k,c),
inference(light_normalisation,[status(thm)],[c_3038,c_1667]) ).
tcf(c_4517,plain,
multiply(multiply(k,c),multiply(c,a)) = identity,
inference(superposition,[status(thm)],[c_3046,c_62]) ).
tcf(c_5040,plain,
multiply(k,inverse(b)) = identity,
inference(demodulation,[status(thm)],[c_4517,c_63,c_326,c_353]) ).
tcf(c_5041,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5040,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP002-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Wed Sep 23 13:10:51 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.33 Running UEQ theorem proving
% 0.07/0.33 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.07/0.34
% 0.07/0.34 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.34
% 0.07/0.34 % Detected problem language: tptp
% 0.07/0.35 % Proving...
% 3.57/1.08 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.57/1.08 % SZS status Started for theBenchmark.p
% 3.57/1.08 % SZS status Unsatisfiable for theBenchmark.p
% 3.57/1.08
% 3.57/1.08 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.57/1.08
% 3.57/1.08 % ------ iProver source info
% 3.57/1.08
% 3.57/1.08 % git: date: 2026-07-19 20:42:38 +0200
% 3.57/1.08 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.57/1.08 % git: non_committed_changes: false
% 3.57/1.08
% 3.57/1.08 % ------ Parsing...% successful
% 3.57/1.08
% 3.57/1.08
% 3.57/1.08 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.57/1.08
% 3.57/1.08 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.57/1.08
% 3.57/1.08 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.57/1.08
% 3.57/1.08 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.57/1.08 % ------ Proving...
% 3.57/1.08 % ------ Problem Properties
% 3.57/1.08
% 3.57/1.08 %
% 3.57/1.08 % clauses 12
% 3.57/1.08 % conjectures 6
% 3.57/1.08 % EPR 0
% 3.57/1.08 % Horn 12
% 3.57/1.08 % unary 12
% 3.57/1.08 % binary 0
% 3.57/1.08 % lits 12
% 3.57/1.08 % lits eq 12
% 3.57/1.08 % fd_pure 0
% 3.57/1.08 % fd_pseudo 0
% 3.57/1.08 % fd_cond 0
% 3.57/1.08 % fd_pseudo_cond 0
% 3.57/1.08 % AC symbols 0
% 3.57/1.08
% 3.57/1.08 % ------ Input Options Time Limit: Unbounded
% 3.57/1.08
% 3.57/1.08
% 3.57/1.08 % ------
% 3.57/1.08 % Current options:
% 3.57/1.08 % ------
% 3.57/1.08
% 3.57/1.08
% 3.57/1.08 %
% 3.57/1.08
% 3.57/1.08 % ------ Proving...
% 3.57/1.08 %
% 3.57/1.08
% 3.57/1.08 % SZS status Unsatisfiable for theBenchmark.p
% 3.57/1.08
% 3.57/1.08 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.57/1.08
% 3.57/1.08
%------------------------------------------------------------------------------