%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP517-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 : n005.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:38 PM UTC 2026
% Result : Unsatisfiable 2.36s 1.28s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(X0,multiply(multiply(inverse(multiply(X0,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,multiply(multiply(inverse(multiply(X0,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_92,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(X0,multiply(multiply(inverse(X1),X2),multiply(multiply(inverse(multiply(X0,X3)),X1),X3))) = X2,
inference(superposition,[status(thm)],[c_51,c_51]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i] : multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_51,c_92]) ).
tcf(c_117,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(inverse(multiply(inverse(X0),X1)),X2),X1) = multiply(X2,X0),
inference(superposition,[status(thm)],[c_51,c_97]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_117,c_51]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i] : multiply(inverse(multiply(X0,X1)),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_139,c_139]) ).
tcf(c_233,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_183,c_51]) ).
tcf(c_253,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_233,c_97]) ).
tcf(c_259,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP517-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.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 14:57:32 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running UEQ theorem proving
% 0.09/0.40 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 2.36/1.28 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.36/1.28 % SZS status Started for theBenchmark.p
% 2.36/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.36/1.28
% 2.36/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.36/1.28
% 2.36/1.28 % ------ iProver source info
% 2.36/1.28
% 2.36/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.36/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.36/1.28 % git: non_committed_changes: false
% 2.36/1.28
% 2.36/1.28 % ------ Parsing...% successful
% 2.36/1.28
% 2.36/1.28
% 2.36/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.36/1.28
% 2.36/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.36/1.28
% 2.36/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.36/1.28
% 2.36/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.36/1.28 % ------ Proving...
% 2.36/1.28 % ------ Problem Properties
% 2.36/1.28
% 2.36/1.28 %
% 2.36/1.28 % clauses 2
% 2.36/1.28 % conjectures 1
% 2.36/1.28 % EPR 0
% 2.36/1.28 % Horn 2
% 2.36/1.28 % unary 2
% 2.36/1.28 % binary 0
% 2.36/1.28 % lits 2
% 2.36/1.28 % lits eq 2
% 2.36/1.28 % fd_pure 0
% 2.36/1.28 % fd_pseudo 0
% 2.36/1.28 % fd_cond 0
% 2.36/1.28 % fd_pseudo_cond 0
% 2.36/1.28 % AC symbols 0
% 2.36/1.28
% 2.36/1.28 % ------ Input Options Time Limit: Unbounded
% 2.36/1.28
% 2.36/1.28
% 2.36/1.28 % ------
% 2.36/1.28 % Current options:
% 2.36/1.28 % ------
% 2.36/1.28
% 2.36/1.28
% 2.36/1.28 %
% 2.36/1.28
% 2.36/1.28 % ------ Proving...
% 2.36/1.28 %
% 2.36/1.28
% 2.36/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.36/1.28
% 2.36/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.36/1.28
% 2.36/1.28
%------------------------------------------------------------------------------