%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP710+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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:35:17 PM UTC 2026
% Result : Theorem 5.18s 1.74s
% Output : CNFRefutation 5.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 55 ( 37 unt; 0 def)
% Number of atoms : 73 ( 56 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 50 ( 32 ~; 16 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn 91 !; 8 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1,X2] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0] : mult(X0,i(X0)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X0] : mult(i(X0),X0) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f6,conjecture,
( ! [X3,X4] :
? [X5] : mult(X5,X4) = X3
& ! [X0,X1] :
? [X2] : mult(X0,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f7,negated_conjecture,
~ ( ! [X3,X4] :
? [X5] : mult(X5,X4) = X3
& ! [X0,X1] :
? [X2] : mult(X0,X2) = X1 ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
( ? [X3,X4] :
! [X5] : mult(X5,X4) != X3
| ? [X0,X1] :
! [X2] : mult(X0,X2) != X1 ),
inference(ennf_transformation,[],[f7]) ).
fof(f9,plain,
( ! [X5] : sK2 != mult(X5,sK3)
| ! [X2] : sK1 != mult(sK0,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X3,sK2),skolemize(X4,sK3)],[f8]) ).
fof(f10,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
! [X2,X0,X1] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0] : unit = mult(i(X0),X0),
inference(cnf_transformation,[],[f5]) ).
fof(f15,plain,
! [X2,X5] :
( sK2 != mult(X5,sK3)
| sK1 != mult(sK0,X2) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_49,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X1),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,plain,
! [X0: $i] : mult(X0,i(X0)) = unit,
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,plain,
! [X0: $i] : mult(i(X0),X0) = unit,
inference(cnf_transformation,[],[f14]) ).
tcf(c_54,negated_conjecture,
! [X0: $i,X1: $i] :
( ( mult(sK0,X0) != sK1 )
| ( mult(X1,sK3) != sK2 ) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_79,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| ( mult(sK0,X0) != sK1 ) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_54]) ).
tcf(c_80,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| ( mult(X0,sK3) != sK2 ) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_54]) ).
tcf(c_81,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_54]) ).
tcf(c_82,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_81]) ).
tcf(c_83,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| ( mult(X0,sK3) != sK2 ) ),
inference(demodulation,[status(thm)],[c_80]) ).
tcf(c_84,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| ( mult(sK0,X0) != sK1 ) ),
inference(demodulation,[status(thm)],[c_79]) ).
tcf(c_171,plain,
! [X0: $i,X1: $i] : mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(mult(unit,i(X0)),X1),
inference(superposition,[status(thm)],[c_52,c_51]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,mult(X0,X1))) = mult(mult(unit,X0),X1),
inference(superposition,[status(thm)],[c_53,c_51]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
inference(superposition,[status(thm)],[c_51,c_49]) ).
tcf(c_174,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(mult(mult(X0,X1),X1),mult(X2,mult(X2,X3))),
inference(superposition,[status(thm)],[c_51,c_51]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,mult(X0,X1))) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_172,c_50]) ).
tcf(c_885,plain,
! [X0: $i,X1: $i] : mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(i(X0),X1),
inference(demodulation,[status(thm)],[c_171,c_50]) ).
tcf(c_900,plain,
! [X0: $i] :
( ~ iPr_def_10
| ( mult(i(sK0),X0) != sK1 ) ),
inference(superposition,[status(thm)],[c_885,c_84]) ).
tcf(c_1336,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(demodulation,[status(thm)],[c_173,c_49]) ).
tcf(c_1337,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(demodulation,[status(thm)],[c_51,c_1336]) ).
tcf(c_1343,plain,
! [X0: $i] : mult(i(X0),mult(X0,X0)) = mult(unit,X0),
inference(superposition,[status(thm)],[c_53,c_1336]) ).
tcf(c_1355,plain,
! [X0: $i] :
( ~ iPr_def_11
| ( mult(X0,mult(sK3,sK3)) != sK2 ) ),
inference(superposition,[status(thm)],[c_1336,c_83]) ).
tcf(c_1374,plain,
! [X0: $i] : mult(i(X0),mult(X0,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1343,c_50]) ).
tcf(c_1763,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(mult(X0,mult(X1,X1)),mult(X2,mult(X2,X3))),
inference(light_normalisation,[status(thm)],[c_174,c_1336]) ).
tcf(c_1764,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(X0,mult(X1,mult(X1,mult(X2,mult(X2,X3))))),
inference(demodulation,[status(thm)],[c_1763,c_1337]) ).
tcf(c_1852,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ iPr_def_11
| ( mult(X0,mult(X1,mult(X1,mult(X2,mult(X2,mult(sK3,sK3)))))) != sK2 ) ),
inference(superposition,[status(thm)],[c_1764,c_1355]) ).
tcf(c_2323,plain,
! [X0: $i,X1: $i] : mult(X0,mult(i(X0),mult(X0,X1))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_181,c_885]) ).
tcf(c_2479,plain,
! [X0: $i,X1: $i] :
( ~ iPr_def_11
| ( mult(X0,mult(X1,mult(X1,mult(sK3,sK3)))) != sK2 ) ),
inference(superposition,[status(thm)],[c_50,c_1852]) ).
tcf(c_4372,plain,
! [X0: $i] :
( ~ iPr_def_11
| ( mult(X0,mult(i(sK3),sK3)) != sK2 ) ),
inference(superposition,[status(thm)],[c_1374,c_2479]) ).
tcf(c_4659,plain,
! [X0: $i] :
( ~ iPr_def_11
| ( X0 != sK2 ) ),
inference(demodulation,[status(thm)],[c_4372,c_49,c_53]) ).
tcf(c_4666,plain,
~ iPr_def_11,
inference(equality_resolution,[status(thm)],[c_4659]) ).
tcf(c_4667,plain,
iPr_def_10,
inference(backward_subsumption_resolution,[status(thm)],[c_82,c_4666]) ).
tcf(c_4669,plain,
! [X0: $i] : mult(i(sK0),X0) != sK1,
inference(backward_subsumption_resolution,[status(thm)],[c_900,c_4667]) ).
tcf(c_4842,plain,
! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(unit,X1),
inference(superposition,[status(thm)],[c_53,c_1337]) ).
tcf(c_4934,plain,
! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = X1,
inference(demodulation,[status(thm)],[c_4842,c_50]) ).
tcf(c_4960,plain,
! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(i(X0),mult(X0,X1)),
inference(superposition,[status(thm)],[c_2323,c_4934]) ).
tcf(c_4978,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_4960,c_4934]) ).
tcf(c_5157,plain,
! [X0: $i] : X0 != sK1,
inference(superposition,[status(thm)],[c_4978,c_4669]) ).
tcf(c_5169,plain,
$false,
inference(equality_resolution,[status(thm)],[c_5157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP710+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n017.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 15:43:29 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 5.18/1.74 % SZS status Started for theBenchmark.p
% 5.18/1.74 % SZS status Theorem for theBenchmark.p
% 5.18/1.74
% 5.18/1.74 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.18/1.74
% 5.18/1.74 % ------ iProver source info
% 5.18/1.74
% 5.18/1.74 % git: date: 2026-07-19 20:42:38 +0200
% 5.18/1.74 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.18/1.74 % git: non_committed_changes: false
% 5.18/1.74
% 5.18/1.74 % ------ Parsing...
% 5.18/1.74 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 5.18/1.74
% 5.18/1.74 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 5.18/1.74
% 5.18/1.74 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 5.18/1.74
% 5.18/1.74 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 5.18/1.74 % ------ Proving...
% 5.18/1.74 % ------ Problem Properties
% 5.18/1.74
% 5.18/1.74 %
% 5.18/1.74 % clauses 8
% 5.18/1.74 % conjectures 3
% 5.18/1.74 % EPR 1
% 5.18/1.74 % Horn 7
% 5.18/1.74 % unary 5
% 5.18/1.74 % binary 3
% 5.18/1.74 % lits 11
% 5.18/1.74 % lits eq 7
% 5.18/1.74 % fd_pure 0
% 5.18/1.74 % fd_pseudo 0
% 5.18/1.74 % fd_cond 0
% 5.18/1.74 % fd_pseudo_cond 0
% 5.18/1.74 % AC symbols 0
% 5.18/1.74
% 5.18/1.74 % ------ Schedule dynamic 5 is on
% 5.18/1.74
% 5.18/1.74 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 5.18/1.74
% 5.18/1.74
% 5.18/1.74 % ------
% 5.18/1.74 % Current options:
% 5.18/1.74 % ------
% 5.18/1.74
% 5.18/1.74
% 5.18/1.74 %
% 5.18/1.74
% 5.18/1.74 % ------ Proving...
% 5.18/1.74 %
% 5.18/1.74
% 5.18/1.74 % SZS status Theorem for theBenchmark.p
% 5.18/1.74
% 5.18/1.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.18/1.74
% 5.18/1.74
%------------------------------------------------------------------------------