%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP001-1 : TPTP v9.3.1. Released v1.0.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:29:50 PM UTC 2026
% Result : Unsatisfiable 3.14s 1.25s
% Output : CNFRefutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 39 unt; 2 def)
% Number of atoms : 106 ( 30 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 23 ( 14 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 6 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : product(identity,X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : product(X0,identity,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_identity) ).
fof(f4,axiom,
! [X0] : product(X0,inverse(X0),identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
fof(f8,axiom,
! [X2,X3,X0,X1,X4,X5] :
( product(X2,X3,X5)
| ~ product(X0,X4,X5)
| ~ product(X1,X3,X4)
| ~ product(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',associativity2) ).
fof(f9,axiom,
! [X0] : product(X0,X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',square_element) ).
fof(f10,negated_conjecture,
product(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b_is_c) ).
fof(f11,negated_conjecture,
~ product(b,a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_times_a_is_c) ).
tcf(c_60,plain,
! [X0: $i] : product(identity,X0,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_61,plain,
! [X0: $i] : product(X0,identity,X0),
inference(cnf_transformation,[],[f2]) ).
tcf(c_63,plain,
! [X0: $i] : product(X0,inverse(X0),identity),
inference(cnf_transformation,[],[f4]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( product(X2,X5,X4)
| ~ product(X1,X5,X3)
| ~ product(X0,X3,X4)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_68,plain,
! [X0: $i] : product(X0,X0,identity),
inference(cnf_transformation,[],[f9]) ).
tcf(c_69,negated_conjecture,
product(a,b,c),
inference(cnf_transformation,[],[f10]) ).
tcf(c_70,negated_conjecture,
~ product(b,a,c),
inference(cnf_transformation,[],[f11]) ).
tcf(c_76,plain,
! [X0: $i] : multiply(X0,X0) = identity,
inference(well_definedness,[status(thm)],[c_68]) ).
tcf(c_77,plain,
multiply(a,b) = c,
inference(well_definedness,[status(thm)],[c_69]) ).
tcf(c_78,plain,
multiply(b,a) != c,
inference(well_definedness,[status(thm)],[c_70]) ).
tcf(c_79,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(well_definedness,[status(thm)],[c_60]) ).
tcf(c_80,plain,
! [X0: $i] : multiply(X0,identity) = X0,
inference(well_definedness,[status(thm)],[c_61]) ).
tcf(c_82,plain,
! [X0: $i] : multiply(X0,inverse(X0)) = identity,
inference(well_definedness,[status(thm)],[c_63]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ( multiply(X2,X5) = X4 )
| ( multiply(X1,X5) != X3 )
| ( multiply(X0,X3) != X4 )
| ( multiply(X0,X1) != X2 ) ),
inference(well_definedness,[status(thm)],[c_67]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(unflattening,[status(thm)],[c_88]) ).
tcf(c_159,definition,
iPr_def_10 = multiply(b,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_160,definition,
iPr_def_11 = multiply(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_161,plain,
iPr_def_10 != c,
inference(demodulation,[status(thm)],[c_78,c_159]) ).
tcf(c_162,plain,
iPr_def_11 = c,
inference(demodulation,[status(thm)],[c_77,c_160]) ).
tcf(c_201,plain,
iPr_def_10 != iPr_def_11,
inference(light_normalisation,[status(thm)],[c_161,c_162]) ).
tcf(c_209,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_76,c_134]) ).
tcf(c_210,plain,
! [X0: $i] : multiply(a,multiply(b,X0)) = multiply(iPr_def_11,X0),
inference(superposition,[status(thm)],[c_160,c_134]) ).
tcf(c_223,plain,
multiply(a,iPr_def_10) = multiply(iPr_def_11,a),
inference(superposition,[status(thm)],[c_159,c_210]) ).
tcf(c_225,plain,
multiply(iPr_def_11,inverse(b)) = multiply(a,identity),
inference(superposition,[status(thm)],[c_82,c_210]) ).
tcf(c_248,plain,
multiply(iPr_def_11,inverse(b)) = a,
inference(demodulation,[status(thm)],[c_225,c_80]) ).
tcf(c_253,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_209,c_79]) ).
tcf(c_257,plain,
multiply(a,iPr_def_11) = b,
inference(superposition,[status(thm)],[c_160,c_253]) ).
tcf(c_261,plain,
! [X0: $i] : multiply(X0,identity) = inverse(X0),
inference(superposition,[status(thm)],[c_82,c_253]) ).
tcf(c_266,plain,
multiply(a,multiply(iPr_def_11,a)) = iPr_def_10,
inference(superposition,[status(thm)],[c_223,c_253]) ).
tcf(c_267,plain,
multiply(iPr_def_11,a) = inverse(b),
inference(superposition,[status(thm)],[c_248,c_253]) ).
tcf(c_276,plain,
! [X0: $i] : inverse(X0) = X0,
inference(light_normalisation,[status(thm)],[c_261,c_80]) ).
tcf(c_283,plain,
multiply(a,b) = iPr_def_11,
inference(superposition,[status(thm)],[c_257,c_253]) ).
tcf(c_301,plain,
multiply(a,inverse(b)) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_266,c_267]) ).
tcf(c_302,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_301,c_276,c_283]) ).
tcf(c_303,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_302,c_201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n003.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 13:12:19 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 Running first-order theorem proving
% 0.12/0.38 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 3.14/1.25 % SZS status Started for theBenchmark.p
% 3.14/1.25 % SZS status Unsatisfiable for theBenchmark.p
% 3.14/1.25
% 3.14/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.14/1.25
% 3.14/1.25 % ------ iProver source info
% 3.14/1.25
% 3.14/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 3.14/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.14/1.25 % git: non_committed_changes: false
% 3.14/1.25
% 3.14/1.25 % ------ Parsing...% successful
% 3.14/1.25
% 3.14/1.25
% 3.14/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.14/1.25
% 3.14/1.25 % ------ 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 %
% 3.14/1.25
% 3.14/1.25 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 3.14/1.25 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.14/1.25
% 3.14/1.25 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.14/1.25 % ------ Proving...
% 3.14/1.25 % ------ Problem Properties
% 3.14/1.25
% 3.14/1.25 %
% 3.14/1.25 % clauses 10
% 3.14/1.25 % conjectures 0
% 3.14/1.25 % EPR 2
% 3.14/1.25 % Horn 10
% 3.14/1.25 % unary 10
% 3.14/1.25 % binary 0
% 3.14/1.25 % lits 10
% 3.14/1.25 % lits eq 10
% 3.14/1.25 % fd_pure 0
% 3.14/1.25 % fd_pseudo 0
% 3.14/1.25 % fd_cond 0
% 3.14/1.25 % fd_pseudo_cond 0
% 3.14/1.25 % AC symbols 0
% 3.14/1.25
% 3.14/1.25 % ------ Schedule UEQ
% 3.14/1.25
% 3.14/1.25 % ------ Option_UEQ Time Limit: 10.
% 3.14/1.25
% 3.14/1.25
% 3.14/1.25 % ------
% 3.14/1.25 % Current options:
% 3.14/1.25 % ------
% 3.14/1.25
% 3.14/1.25
% 3.14/1.25 %
% 3.14/1.25
% 3.14/1.25 % ------ Proving...
% 3.14/1.25 %
% 3.14/1.25
% 3.14/1.25 % SZS status Unsatisfiable for theBenchmark.p
% 3.14/1.25
% 3.14/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.14/1.25
% 3.14/1.25
%------------------------------------------------------------------------------