%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP412-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:33:51 PM UTC 2026
% Result : Unsatisfiable 9.14s 2.17s
% Output : CNFRefutation 9.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 17 unt; 0 def)
% Number of atoms : 17 ( 16 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 : 48 ( 0 sgn 48 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(X0,inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X0,inverse(X1))),X2))),X1))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X0,inverse(X1))),X2))),X1))) = X2,
inference(cnf_transformation,[],[f1]) ).
tcf(c_52,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cnf_transformation,[],[f2]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(multiply(multiply(multiply(inverse(X0),X0),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X0))),X3))),X0)) = multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(X3)),X2))),
inference(superposition,[status(thm)],[c_51,c_51]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,inverse(X1))),multiply(X0,inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(X2)),X1)))) = X2,
inference(superposition,[status(thm)],[c_94,c_51]) ).
tcf(c_131,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(multiply(multiply(multiply(inverse(X0),X0),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X0))),multiply(inverse(multiply(X1,inverse(X2))),X3)))),X0)) = X3,
inference(superposition,[status(thm)],[c_94,c_51]) ).
tcf(c_236,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(multiply(multiply(inverse(X0),X0),inverse(multiply(inverse(multiply(multiply(inverse(X1),X1),inverse(X0))),X2))),X0) = multiply(inverse(multiply(X3,inverse(X1))),multiply(X3,inverse(multiply(X2,X1)))),
inference(superposition,[status(thm)],[c_51,c_120]) ).
tcf(c_362,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(multiply(multiply(multiply(inverse(X0),X0),inverse(multiply(inverse(multiply(X1,inverse(X0))),multiply(X1,X2)))),X0)) = X2,
inference(superposition,[status(thm)],[c_131,c_131]) ).
tcf(c_394,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(inverse(multiply(X0,inverse(X1))),multiply(X0,X2)) = multiply(inverse(multiply(X3,inverse(X1))),multiply(X3,X2)),
inference(superposition,[status(thm)],[c_362,c_120]) ).
tcf(c_489,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(inverse(multiply(X0,X1)),multiply(X0,X2)) = multiply(inverse(multiply(X3,X1)),multiply(X3,X2)),
inference(superposition,[status(thm)],[c_362,c_394]) ).
tcf(c_620,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : multiply(X0,multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X2,inverse(X1))),multiply(X2,X0)))),X3)) = multiply(inverse(multiply(X4,X1)),multiply(X4,X3)),
inference(superposition,[status(thm)],[c_362,c_489]) ).
tcf(c_4842,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(multiply(inverse(X0),X0),inverse(multiply(inverse(multiply(multiply(inverse(X1),X1),inverse(X0))),multiply(multiply(inverse(X1),X1),inverse(X2))))),X0) = X2,
inference(superposition,[status(thm)],[c_236,c_120]) ).
tcf(c_8188,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(multiply(inverse(X0),X0),inverse(multiply(inverse(multiply(X1,inverse(X0))),multiply(X1,inverse(X2))))),X0) = X2,
inference(superposition,[status(thm)],[c_489,c_4842]) ).
tcf(c_8503,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,X1)),multiply(X0,X1)) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_8188,c_620]) ).
tcf(c_8863,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_8503,c_8503]) ).
tcf(c_8997,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_8863]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP412-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Wed Sep 23 14:41:57 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running UEQ theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 9.14/2.17 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 9.14/2.17 % SZS status Started for theBenchmark.p
% 9.14/2.17 % SZS status Unsatisfiable for theBenchmark.p
% 9.14/2.17
% 9.14/2.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 9.14/2.17
% 9.14/2.17 % ------ iProver source info
% 9.14/2.17
% 9.14/2.17 % git: date: 2026-07-19 20:42:38 +0200
% 9.14/2.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 9.14/2.17 % git: non_committed_changes: false
% 9.14/2.17
% 9.14/2.17 % ------ Parsing...% successful
% 9.14/2.17
% 9.14/2.17
% 9.14/2.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 9.14/2.17
% 9.14/2.17 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 9.14/2.17
% 9.14/2.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 9.14/2.17
% 9.14/2.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 9.14/2.17 % ------ Proving...
% 9.14/2.17 % ------ Problem Properties
% 9.14/2.17
% 9.14/2.17 %
% 9.14/2.17 % clauses 2
% 9.14/2.17 % conjectures 1
% 9.14/2.17 % EPR 0
% 9.14/2.17 % Horn 2
% 9.14/2.17 % unary 2
% 9.14/2.17 % binary 0
% 9.14/2.17 % lits 2
% 9.14/2.17 % lits eq 2
% 9.14/2.17 % fd_pure 0
% 9.14/2.17 % fd_pseudo 0
% 9.14/2.17 % fd_cond 0
% 9.14/2.17 % fd_pseudo_cond 0
% 9.14/2.17 % AC symbols 0
% 9.14/2.17
% 9.14/2.17 % ------ Input Options Time Limit: Unbounded
% 9.14/2.17
% 9.14/2.17
% 9.14/2.17 % ------
% 9.14/2.17 % Current options:
% 9.14/2.17 % ------
% 9.14/2.17
% 9.14/2.17
% 9.14/2.17 %
% 9.14/2.17
% 9.14/2.17 % ------ Proving...
% 9.14/2.17 %
% 9.14/2.17
% 9.14/2.17 % SZS status Unsatisfiable for theBenchmark.p
% 9.14/2.17
% 9.14/2.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.14/2.17
% 9.14/2.17
%------------------------------------------------------------------------------