%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP023-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.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:29:56 PM UTC 2026
% Result : Unsatisfiable 1.65s 1.30s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 15 unt; 1 def)
% Number of atoms : 22 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn 6 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : product(X0,identity,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_identity) ).
fof(f3,axiom,
! [X0] : product(inverse(X0),X0,identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
fof(f9,negated_conjecture,
inverse(identity) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse_of_id_is_id) ).
fof(f10,plain,
identity != inverse(identity),
inference(reorient_equations,[],[f9]) ).
tcf(c_59,plain,
! [X0: $i] : product(X0,identity,X0),
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i] : product(inverse(X0),X0,identity),
inference(cnf_transformation,[],[f3]) ).
tcf(c_66,negated_conjecture,
inverse(identity) != identity,
inference(cnf_transformation,[],[f10]) ).
tcf(c_73,plain,
! [X0: $i] : multiply(X0,identity) = X0,
inference(well_definedness,[status(thm)],[c_59]) ).
tcf(c_74,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(well_definedness,[status(thm)],[c_60]) ).
tcf(c_146,definition,
iPr_def_10 = inverse(identity),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_147,negated_conjecture,
iPr_def_10 != identity,
inference(demodulation,[status(thm)],[c_66,c_146]) ).
tcf(c_188,plain,
inverse(identity) = identity,
inference(superposition,[status(thm)],[c_74,c_73]) ).
tcf(c_189,plain,
identity = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_188,c_146]) ).
tcf(c_194,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_147,c_189]) ).
tcf(c_195,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP023-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.39 % Computer : n010.cluster.edu
% 0.09/0.39 % Model : x86_64 x86_64
% 0.09/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.39 % Memory : 8046.5625MB
% 0.09/0.39 % OS : Linux 6.8.0-71-generic
% 0.09/0.39 % CPULimit : 300
% 0.09/0.39 % WCLimit : 300
% 0.09/0.39 % DateTime : Wed Sep 23 13:16:27 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.43 Running first-order theorem proving
% 0.09/0.43 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.44
% 0.09/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.44
% 0.09/0.44 % Detected problem language: tptp
% 0.09/0.45 % Proving...
% 1.65/1.30 % SZS status Started for theBenchmark.p
% 1.65/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 1.65/1.30
% 1.65/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.65/1.30
% 1.65/1.30 % ------ iProver source info
% 1.65/1.30
% 1.65/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.65/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.65/1.30 % git: non_committed_changes: false
% 1.65/1.30
% 1.65/1.30 % ------ Parsing...% successful
% 1.65/1.30
% 1.65/1.30
% 1.65/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.65/1.30
% 1.65/1.30 % ------ Preprocessing... sup_sim: 4 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.65/1.30
% 1.65/1.30 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 1.65/1.30 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.65/1.30
% 1.65/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.65/1.30 % ------ Proving...
% 1.65/1.30 % ------ Problem Properties
% 1.65/1.30
% 1.65/1.30 %
% 1.65/1.30 % clauses 7
% 1.65/1.30 % conjectures 1
% 1.65/1.30 % EPR 1
% 1.65/1.30 % Horn 7
% 1.65/1.30 % unary 7
% 1.65/1.30 % binary 0
% 1.65/1.30 % lits 7
% 1.65/1.30 % lits eq 7
% 1.65/1.30 % fd_pure 0
% 1.65/1.30 % fd_pseudo 0
% 1.65/1.30 % fd_cond 0
% 1.65/1.30 % fd_pseudo_cond 0
% 1.65/1.30 % AC symbols 0
% 1.65/1.30
% 1.65/1.30 % ------ Schedule UEQ
% 1.65/1.30
% 1.65/1.30 % ------ Option_UEQ Time Limit: 10.
% 1.65/1.30
% 1.65/1.30
% 1.65/1.30 % ------
% 1.65/1.30 % Current options:
% 1.65/1.30 % ------
% 1.65/1.30
% 1.65/1.30
% 1.65/1.30 %
% 1.65/1.30
% 1.65/1.30 % ------ Proving...
% 1.65/1.30 %
% 1.65/1.30
% 1.65/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 1.65/1.30
% 1.65/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/1.30
% 1.65/1.30
%------------------------------------------------------------------------------