%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP406-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 : n001.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:40 PM UTC 2026
% Result : Unsatisfiable 11.66s 7.45s
% Output : CNFRefutation 11.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 15 unt; 0 def)
% Number of atoms : 15 ( 14 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 : 9 ( 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 : 40 ( 0 sgn 40 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(X1),multiply(inverse(X1),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(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(X1),multiply(inverse(X1),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(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),X3)),multiply(inverse(X2),multiply(inverse(X2),X2)))) = multiply(X0,inverse(multiply(inverse(X3),multiply(inverse(X1),multiply(inverse(X1),X1))))),
inference(superposition,[status(thm)],[c_51,c_51]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(multiply(inverse(X2),multiply(inverse(X1),multiply(inverse(X1),X1)))))) = X2,
inference(superposition,[status(thm)],[c_94,c_51]) ).
tcf(c_133,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(multiply(X0,X1)),X3))),multiply(inverse(X2),multiply(inverse(X2),X2)))) = X3,
inference(superposition,[status(thm)],[c_94,c_51]) ).
tcf(c_398,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,X2))),multiply(inverse(X1),multiply(inverse(X1),X1)))) = X2,
inference(superposition,[status(thm)],[c_133,c_133]) ).
tcf(c_435,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,X1)),inverse(multiply(X2,multiply(inverse(multiply(X0,X2)),multiply(inverse(multiply(X0,X2)),multiply(X0,X2)))))) = multiply(inverse(X1),multiply(inverse(X1),X1)),
inference(superposition,[status(thm)],[c_398,c_51]) ).
tcf(c_446,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_398,c_122]) ).
tcf(c_651,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : multiply(inverse(multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))),multiply(X0,X2)) = multiply(X3,multiply(inverse(multiply(inverse(multiply(X4,X1)),multiply(X4,X3))),X2)),
inference(superposition,[status(thm)],[c_398,c_446]) ).
tcf(c_1258,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(X2)))),multiply(inverse(X1),multiply(inverse(X1),X1))) = X2,
inference(superposition,[status(thm)],[c_435,c_122]) ).
tcf(c_6928,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))),multiply(X0,multiply(inverse(X1),multiply(inverse(X1),X1)))) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_1258,c_651]) ).
tcf(c_8143,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_6928,c_6928]) ).
tcf(c_8254,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_8143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP406-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.11/5.57 % Computer : n001.cluster.edu
% 0.11/5.57 % Model : x86_64 x86_64
% 0.11/5.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.57 % Memory : 8046.5625MB
% 0.11/5.57 % OS : Linux 6.8.0-71-generic
% 0.11/5.57 % CPULimit : 300
% 0.11/5.57 % WCLimit : 300
% 0.11/5.57 % DateTime : Wed Sep 23 14:46:56 UTC 2026
% 0.11/5.57 % CPUTime :
% 0.11/5.57 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.60 Running UEQ theorem proving
% 0.15/5.60 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.15/5.61
% 0.15/5.61 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.61
% 0.15/5.61 % Detected problem language: tptp
% 0.15/5.63 % Proving...
% 11.66/7.45 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 11.66/7.45 % SZS status Started for theBenchmark.p
% 11.66/7.45 % SZS status Unsatisfiable for theBenchmark.p
% 11.66/7.45
% 11.66/7.45 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 11.66/7.45
% 11.66/7.45 % ------ iProver source info
% 11.66/7.45
% 11.66/7.45 % git: date: 2026-07-19 20:42:38 +0200
% 11.66/7.45 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 11.66/7.45 % git: non_committed_changes: false
% 11.66/7.45
% 11.66/7.45 % ------ Parsing...% successful
% 11.66/7.45
% 11.66/7.45
% 11.66/7.45 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 11.66/7.45
% 11.66/7.45 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 11.66/7.45
% 11.66/7.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 11.66/7.45
% 11.66/7.45 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 11.66/7.45 % ------ Proving...
% 11.66/7.45 % ------ Problem Properties
% 11.66/7.45
% 11.66/7.45 %
% 11.66/7.45 % clauses 2
% 11.66/7.45 % conjectures 1
% 11.66/7.45 % EPR 0
% 11.66/7.45 % Horn 2
% 11.66/7.45 % unary 2
% 11.66/7.45 % binary 0
% 11.66/7.45 % lits 2
% 11.66/7.45 % lits eq 2
% 11.66/7.45 % fd_pure 0
% 11.66/7.45 % fd_pseudo 0
% 11.66/7.45 % fd_cond 0
% 11.66/7.45 % fd_pseudo_cond 0
% 11.66/7.45 % AC symbols 0
% 11.66/7.45
% 11.66/7.45 % ------ Input Options Time Limit: Unbounded
% 11.66/7.45
% 11.66/7.45
% 11.66/7.45 % ------
% 11.66/7.45 % Current options:
% 11.66/7.45 % ------
% 11.66/7.45
% 11.66/7.45
% 11.66/7.45 %
% 11.66/7.45
% 11.66/7.45 % ------ Proving...
% 11.66/7.45 %
% 11.66/7.45
% 11.66/7.45 % SZS status Unsatisfiable for theBenchmark.p
% 11.66/7.45
% 11.66/7.45 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.66/7.45
% 11.66/7.45
%------------------------------------------------------------------------------