%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP434-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 : n003.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:34:05 PM UTC 2026
% Result : Unsatisfiable 2.86s 6.18s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 2
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 13 ( 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 : 76 ( 0 sgn 76 !; 0 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] : inverse(multiply(multiply(multiply(inverse(multiply(multiply(X0,X1),X2)),X0),X1),multiply(X3,inverse(X3)))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f3,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f2]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(multiply(multiply(multiply(inverse(multiply(multiply(X0,X1),X2)),X0),X1),multiply(X3,inverse(X3)))) = X2,
inference(cnf_transformation,[],[f1]) ).
tcf(c_52,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnf_transformation,[],[f3]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : inverse(multiply(multiply(multiply(X0,multiply(inverse(multiply(multiply(X1,X2),X0)),X1)),X2),multiply(X3,inverse(X3)))) = multiply(X4,inverse(X4)),
inference(superposition,[status(thm)],[c_51,c_51]) ).
tcf(c_113,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(X0)) = multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_93,c_93]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(multiply(multiply(multiply(inverse(multiply(multiply(X0,inverse(X0)),X1)),X2),inverse(X2)),multiply(X3,inverse(X3)))) = X1,
inference(superposition,[status(thm)],[c_113,c_51]) ).
tcf(c_184,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(multiply(multiply(multiply(inverse(multiply(X0,inverse(X0))),X1),X2),multiply(X3,inverse(X3)))) = inverse(multiply(X1,X2)),
inference(superposition,[status(thm)],[c_113,c_51]) ).
tcf(c_281,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(multiply(multiply(inverse(multiply(multiply(X0,X1),inverse(multiply(X2,inverse(X2))))),X0),X1)) = multiply(X3,inverse(X3)),
inference(superposition,[status(thm)],[c_184,c_93]) ).
tcf(c_284,plain,
! [X0: $i,X1: $i] : inverse(multiply(X0,inverse(X0))) = inverse(multiply(X1,inverse(X1))),
inference(superposition,[status(thm)],[c_184,c_183]) ).
tcf(c_387,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,inverse(X0)),inverse(multiply(X1,inverse(X1)))) = multiply(X2,inverse(X2)),
inference(superposition,[status(thm)],[c_284,c_113]) ).
tcf(c_720,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(multiply(multiply(inverse(multiply(X0,inverse(X0))),X1),inverse(X1))) = multiply(X2,inverse(X2)),
inference(superposition,[status(thm)],[c_387,c_281]) ).
tcf(c_990,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(multiply(multiply(multiply(multiply(X0,inverse(X0)),inverse(multiply(X1,inverse(X1)))),X2),multiply(X3,inverse(X3)))) = inverse(X2),
inference(superposition,[status(thm)],[c_720,c_51]) ).
tcf(c_4369,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(multiply(multiply(multiply(X0,inverse(X0)),X1),multiply(X2,inverse(X2)))) = inverse(X1),
inference(superposition,[status(thm)],[c_387,c_990]) ).
tcf(c_4799,plain,
! [X0: $i,X1: $i] : inverse(inverse(inverse(inverse(multiply(multiply(X0,inverse(X0)),X1))))) = X1,
inference(superposition,[status(thm)],[c_4369,c_183]) ).
tcf(c_4800,plain,
! [X0: $i,X1: $i] : inverse(multiply(inverse(inverse(multiply(X0,inverse(X0)))),X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_4369,c_184]) ).
tcf(c_5071,plain,
! [X0: $i,X1: $i] : inverse(inverse(inverse(inverse(inverse(multiply(X0,inverse(X0))))))) = multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_4369,c_4799]) ).
tcf(c_5384,plain,
! [X0: $i,X1: $i] : inverse(multiply(inverse(inverse(inverse(inverse(inverse(multiply(X0,inverse(X0))))))),X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_4800,c_4800]) ).
tcf(c_6601,plain,
! [X0: $i,X1: $i] : inverse(inverse(inverse(inverse(multiply(inverse(inverse(inverse(inverse(inverse(multiply(X0,inverse(X0))))))),X1))))) = X1,
inference(superposition,[status(thm)],[c_5071,c_4799]) ).
tcf(c_6663,plain,
! [X0: $i] : inverse(inverse(inverse(inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_6601,c_5384]) ).
tcf(c_6668,plain,
! [X0: $i,X1: $i] : multiply(multiply(X0,inverse(X0)),X1) = X1,
inference(demodulation,[status(thm)],[c_4799,c_6663]) ).
tcf(c_6669,plain,
! [X0: $i,X1: $i] : inverse(multiply(X0,multiply(X1,inverse(X1)))) = inverse(X0),
inference(demodulation,[status(thm)],[c_4369,c_6668]) ).
tcf(c_6679,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(multiply(multiply(inverse(multiply(multiply(X0,X1),X2)),X0),X1)) = X2,
inference(demodulation,[status(thm)],[c_51,c_6669]) ).
tcf(c_7750,plain,
! [X0: $i,X1: $i] : multiply(multiply(inverse(inverse(inverse(X0))),X0),X1) = X1,
inference(superposition,[status(thm)],[c_6663,c_6668]) ).
tcf(c_7799,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X1,inverse(X1))) = inverse(inverse(inverse(inverse(X0)))),
inference(superposition,[status(thm)],[c_6669,c_6663]) ).
tcf(c_7806,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X1,inverse(X1))) = X0,
inference(light_normalisation,[status(thm)],[c_7799,c_6663]) ).
tcf(c_10864,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(multiply(inverse(multiply(multiply(multiply(X0,inverse(X0)),X1),X2)),X1)) = X2,
inference(superposition,[status(thm)],[c_7806,c_6679]) ).
tcf(c_10965,plain,
! [X0: $i,X1: $i] : inverse(multiply(inverse(multiply(X0,X1)),X0)) = X1,
inference(light_normalisation,[status(thm)],[c_10864,c_6668]) ).
tcf(c_11069,plain,
! [X0: $i,X1: $i] : inverse(inverse(multiply(multiply(X0,inverse(X0)),X1))) = X1,
inference(superposition,[status(thm)],[c_7806,c_10965]) ).
tcf(c_11145,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_11069,c_6668]) ).
tcf(c_11162,plain,
! [X0: $i,X1: $i] : multiply(multiply(inverse(X0),X0),X1) = X1,
inference(demodulation,[status(thm)],[c_7750,c_11145]) ).
tcf(c_11174,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_11162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP434-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.09/5.37 % Computer : n003.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Wed Sep 23 14:46:40 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.40 Running UEQ theorem proving
% 0.14/5.40 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.14/5.41
% 0.14/5.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.41
% 0.14/5.41 % Detected problem language: tptp
% 0.14/5.43 % Proving...
% 2.86/6.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.86/6.18 % SZS status Started for theBenchmark.p
% 2.86/6.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.86/6.18
% 2.86/6.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.86/6.18
% 2.86/6.18 % ------ iProver source info
% 2.86/6.18
% 2.86/6.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.86/6.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.86/6.18 % git: non_committed_changes: false
% 2.86/6.18
% 2.86/6.18 % ------ Parsing...% successful
% 2.86/6.18
% 2.86/6.18
% 2.86/6.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.86/6.18
% 2.86/6.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.86/6.18
% 2.86/6.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.86/6.18
% 2.86/6.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.86/6.18 % ------ Proving...
% 2.86/6.18 % ------ Problem Properties
% 2.86/6.18
% 2.86/6.18 %
% 2.86/6.18 % clauses 2
% 2.86/6.18 % conjectures 1
% 2.86/6.18 % EPR 0
% 2.86/6.18 % Horn 2
% 2.86/6.18 % unary 2
% 2.86/6.18 % binary 0
% 2.86/6.18 % lits 2
% 2.86/6.18 % lits eq 2
% 2.86/6.18 % fd_pure 0
% 2.86/6.18 % fd_pseudo 0
% 2.86/6.18 % fd_cond 0
% 2.86/6.18 % fd_pseudo_cond 0
% 2.86/6.18 % AC symbols 0
% 2.86/6.18
% 2.86/6.18 % ------ Input Options Time Limit: Unbounded
% 2.86/6.18
% 2.86/6.18
% 2.86/6.18 % ------
% 2.86/6.18 % Current options:
% 2.86/6.18 % ------
% 2.86/6.18
% 2.86/6.18
% 2.86/6.18 %
% 2.86/6.18
% 2.86/6.18 % ------ Proving...
% 2.86/6.18 %
% 2.86/6.18
% 2.86/6.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.86/6.18
% 2.86/6.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.86/6.18
% 2.86/6.18
%------------------------------------------------------------------------------