%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP424-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.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:33:53 PM UTC 2026
% Result : Unsatisfiable 2.89s 11.22s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 11 ( 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 36 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(inverse(multiply(inverse(multiply(X0,inverse(multiply(inverse(X1),X2)))),multiply(X0,inverse(X2)))),inverse(multiply(inverse(X2),X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(inverse(multiply(X0,inverse(multiply(inverse(X1),X2)))),multiply(X0,inverse(X2)))),inverse(multiply(inverse(X2),X2))) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_52,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cnf_transformation,[],[f2]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(inverse(multiply(inverse(multiply(X0,inverse(X1))),multiply(X0,inverse(inverse(multiply(inverse(X2),X2)))))),inverse(multiply(inverse(inverse(multiply(inverse(X2),X2))),inverse(multiply(inverse(X2),X2))))) = multiply(inverse(multiply(X3,inverse(multiply(inverse(X1),X2)))),multiply(X3,inverse(X2))),
inference(superposition,[status(thm)],[c_51,c_51]) ).
tcf(c_325,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,inverse(multiply(inverse(multiply(inverse(X1),inverse(multiply(inverse(X2),X2)))),X2)))),multiply(X0,inverse(X2))) = X1,
inference(superposition,[status(thm)],[c_164,c_51]) ).
tcf(c_330,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(inverse(multiply(X0,inverse(multiply(inverse(X1),X2)))),multiply(X0,inverse(X2))) = multiply(inverse(multiply(X3,inverse(multiply(inverse(X1),X2)))),multiply(X3,inverse(X2))),
inference(superposition,[status(thm)],[c_164,c_164]) ).
tcf(c_584,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : multiply(inverse(multiply(X0,inverse(X1))),multiply(X0,inverse(multiply(X2,inverse(X3))))) = multiply(inverse(multiply(X4,inverse(X1))),multiply(X4,inverse(multiply(X2,inverse(X3))))),
inference(superposition,[status(thm)],[c_325,c_330]) ).
tcf(c_1541,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(inverse(multiply(X0,inverse(X1))),multiply(X0,inverse(X2))) = multiply(inverse(multiply(X3,inverse(X1))),multiply(X3,inverse(X2))),
inference(superposition,[status(thm)],[c_51,c_584]) ).
tcf(c_1558,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : multiply(inverse(X0),multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X0),X2)))),multiply(X1,inverse(X2)))),inverse(X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),X2)))),multiply(X4,inverse(X3))),
inference(superposition,[status(thm)],[c_51,c_1541]) ).
tcf(c_1595,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,inverse(multiply(inverse(X1),X1)))),multiply(X0,inverse(multiply(inverse(X1),X1)))) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_51,c_1558]) ).
tcf(c_2058,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_1595,c_1595]) ).
tcf(c_2084,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_2058]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP424-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/10.40 % Computer : n013.cluster.edu
% 0.10/10.40 % Model : x86_64 x86_64
% 0.10/10.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.40 % Memory : 8046.5625MB
% 0.10/10.40 % OS : Linux 6.8.0-71-generic
% 0.10/10.40 % CPULimit : 300
% 0.10/10.40 % WCLimit : 300
% 0.10/10.40 % DateTime : Wed Sep 23 14:43:06 UTC 2026
% 0.15/10.40 % CPUTime :
% 0.15/10.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/10.43 Running UEQ theorem proving
% 0.15/10.44 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.15/10.45
% 0.15/10.45 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.45
% 0.15/10.45 % Detected problem language: tptp
% 0.15/10.46 % Proving...
% 2.89/11.22 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.89/11.22 % SZS status Started for theBenchmark.p
% 2.89/11.22 % SZS status Unsatisfiable for theBenchmark.p
% 2.89/11.22
% 2.89/11.22 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.89/11.22
% 2.89/11.22 % ------ iProver source info
% 2.89/11.22
% 2.89/11.22 % git: date: 2026-07-19 20:42:38 +0200
% 2.89/11.22 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.89/11.22 % git: non_committed_changes: false
% 2.89/11.22
% 2.89/11.22 % ------ Parsing...% successful
% 2.89/11.22
% 2.89/11.22
% 2.89/11.22 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.89/11.22
% 2.89/11.22 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.89/11.22
% 2.89/11.22 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.89/11.22
% 2.89/11.22 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.89/11.22 % ------ Proving...
% 2.89/11.22 % ------ Problem Properties
% 2.89/11.22
% 2.89/11.22 %
% 2.89/11.22 % clauses 2
% 2.89/11.22 % conjectures 1
% 2.89/11.22 % EPR 0
% 2.89/11.22 % Horn 2
% 2.89/11.22 % unary 2
% 2.89/11.22 % binary 0
% 2.89/11.22 % lits 2
% 2.89/11.22 % lits eq 2
% 2.89/11.22 % fd_pure 0
% 2.89/11.22 % fd_pseudo 0
% 2.89/11.22 % fd_cond 0
% 2.89/11.22 % fd_pseudo_cond 0
% 2.89/11.22 % AC symbols 0
% 2.89/11.22
% 2.89/11.22 % ------ Input Options Time Limit: Unbounded
% 2.89/11.22
% 2.89/11.22
% 2.89/11.22 % ------
% 2.89/11.22 % Current options:
% 2.89/11.22 % ------
% 2.89/11.22
% 2.89/11.22
% 2.89/11.22 %
% 2.89/11.22
% 2.89/11.22 % ------ Proving...
% 2.89/11.22 %
% 2.89/11.22
% 2.89/11.22 % SZS status Unsatisfiable for theBenchmark.p
% 2.89/11.22
% 2.89/11.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.89/11.22
% 2.89/11.22
%------------------------------------------------------------------------------