%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP748+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 : 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:35:20 PM UTC 2026
% Result : Theorem 28.22s 15.57s
% Output : CNFRefutation 28.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 20
% Syntax : Number of formulae : 87 ( 66 unt; 6 def)
% Number of atoms : 210 ( 122 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 63 ( 27 ~; 30 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn 103 !; 12 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f7,axiom,
! [X0,X1,X2] : mult(mult(mult(X2,X1),X0),X1) = mult(X2,mult(mult(X1,X0),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
fof(f8,axiom,
! [X0,X1] : mult(mult(X1,X0),i(X0)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f9,axiom,
! [X0] : mult(X0,i(X0)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
fof(f10,axiom,
! [X0] : mult(i(X0),X0) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
fof(f11,axiom,
! [X0,X1] :
( mult(i(X1),mult(X1,X0)) = X0
| mult(X1,X0) = mult(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
fof(f12,conjecture,
( ! [X9,X10,X11] : mult(mult(X11,X9),mult(X10,X11)) = mult(X11,mult(mult(X9,X10),X11))
| ! [X6,X7,X8] : mult(mult(X8,X6),mult(X7,X8)) = mult(mult(X8,mult(X6,X7)),X8)
| ! [X3,X4,X5] : mult(X3,mult(X5,mult(X4,X5))) = mult(mult(mult(X3,X5),X4),X5)
| ! [X0,X1,X2] : mult(X2,mult(X0,mult(X2,X1))) = mult(mult(mult(X2,X0),X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f13,negated_conjecture,
~ ( ! [X9,X10,X11] : mult(mult(X11,X9),mult(X10,X11)) = mult(X11,mult(mult(X9,X10),X11))
| ! [X6,X7,X8] : mult(mult(X8,X6),mult(X7,X8)) = mult(mult(X8,mult(X6,X7)),X8)
| ! [X3,X4,X5] : mult(X3,mult(X5,mult(X4,X5))) = mult(mult(mult(X3,X5),X4),X5)
| ! [X0,X1,X2] : mult(X2,mult(X0,mult(X2,X1))) = mult(mult(mult(X2,X0),X2),X1) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
( ? [X9,X10,X11] : mult(mult(X11,X9),mult(X10,X11)) != mult(X11,mult(mult(X9,X10),X11))
& ? [X6,X7,X8] : mult(mult(X8,X6),mult(X7,X8)) != mult(mult(X8,mult(X6,X7)),X8)
& ? [X3,X4,X5] : mult(X3,mult(X5,mult(X4,X5))) != mult(mult(mult(X3,X5),X4),X5)
& ? [X0,X1,X2] : mult(X2,mult(X0,mult(X2,X1))) != mult(mult(mult(X2,X0),X2),X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f15,plain,
( mult(mult(sK11,sK9),mult(sK10,sK11)) != mult(sK11,mult(mult(sK9,sK10),sK11))
& mult(mult(sK8,sK6),mult(sK7,sK8)) != mult(mult(sK8,mult(sK6,sK7)),sK8)
& mult(sK3,mult(sK5,mult(sK4,sK5))) != mult(mult(mult(sK3,sK5),sK4),sK5)
& mult(sK2,mult(sK0,mult(sK2,sK1))) != mult(mult(mult(sK2,sK0),sK2),sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7),skolemize(X8,sK8),skolemize(X9,sK9),skolemize(X10,sK10),skolemize(X11,sK11)],[f14]) ).
fof(f16,plain,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f17,plain,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f18,plain,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f22,plain,
! [X2,X0,X1] : mult(mult(mult(X2,X1),X0),X1) = mult(X2,mult(mult(X1,X0),X1)),
inference(cnf_transformation,[],[f7]) ).
fof(f23,plain,
! [X0,X1] : mult(mult(X1,X0),i(X0)) = X1,
inference(cnf_transformation,[],[f8]) ).
fof(f24,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f25,plain,
! [X0] : unit = mult(i(X0),X0),
inference(cnf_transformation,[],[f10]) ).
fof(f26,plain,
! [X0,X1] :
( mult(i(X1),mult(X1,X0)) = X0
| mult(X1,X0) = mult(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f29,plain,
mult(sK3,mult(sK5,mult(sK4,sK5))) != mult(mult(mult(sK3,sK5),sK4),sK5),
inference(cnf_transformation,[],[f15]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f16]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f17]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f18]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f19]) ).
tcf(c_54,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f21]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X2),X1) = mult(X0,mult(mult(X1,X2),X1)),
inference(cnf_transformation,[],[f22]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),i(X1)) = X0,
inference(cnf_transformation,[],[f23]) ).
tcf(c_57,plain,
! [X0: $i] : mult(X0,i(X0)) = unit,
inference(cnf_transformation,[],[f24]) ).
tcf(c_58,plain,
! [X0: $i] : mult(i(X0),X0) = unit,
inference(cnf_transformation,[],[f25]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ( mult(X0,X1) = mult(X1,X0) )
| ( mult(i(X0),mult(X0,X1)) = X1 ) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_61,negated_conjecture,
mult(mult(mult(sK3,sK5),sK4),sK5) != mult(sK3,mult(sK5,mult(sK4,sK5))),
inference(cnf_transformation,[],[f29]) ).
tcf(c_107,plain,
mult(sK3,mult(mult(sK5,sK4),sK5)) != mult(sK3,mult(sK5,mult(sK4,sK5))),
inference(demodulation,[status(thm)],[c_61,c_55]) ).
tcf(c_115,definition,
iPr_def_10 = mult(sK5,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_116,definition,
iPr_def_11 = mult(iPr_def_10,sK5),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_117,definition,
iPr_def_12 = mult(sK3,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_118,definition,
iPr_def_13 = mult(sK4,sK5),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_119,definition,
iPr_def_14 = mult(sK5,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_120,definition,
iPr_def_15 = mult(sK3,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_139,plain,
iPr_def_12 != iPr_def_15,
inference(demodulation,[status(thm)],[c_107,c_118,c_119,c_120,c_115,c_116,c_117]) ).
tcf(c_143,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_144,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_146,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( mult(X0,X2) = mult(X1,X3) )
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_267,plain,
! [X0: $i] : ld(X0,unit) = i(X0),
inference(superposition,[status(thm)],[c_57,c_50]) ).
tcf(c_268,plain,
! [X0: $i] : ld(i(X0),unit) = X0,
inference(superposition,[status(thm)],[c_58,c_50]) ).
tcf(c_271,plain,
ld(sK4,iPr_def_13) = sK5,
inference(superposition,[status(thm)],[c_118,c_50]) ).
tcf(c_278,plain,
ld(sK5,iPr_def_10) = sK4,
inference(superposition,[status(thm)],[c_115,c_50]) ).
tcf(c_279,plain,
ld(iPr_def_10,iPr_def_11) = sK5,
inference(superposition,[status(thm)],[c_116,c_50]) ).
tcf(c_280,plain,
ld(sK3,iPr_def_12) = iPr_def_11,
inference(superposition,[status(thm)],[c_117,c_50]) ).
tcf(c_281,plain,
ld(sK5,iPr_def_14) = iPr_def_13,
inference(superposition,[status(thm)],[c_119,c_50]) ).
tcf(c_300,plain,
mult(sK4,sK5) = iPr_def_13,
inference(superposition,[status(thm)],[c_271,c_49]) ).
tcf(c_309,plain,
! [X0: $i] :
( ( iPr_def_12 = iPr_def_15 )
| ( iPr_def_15 != X0 )
| ( iPr_def_12 != X0 ) ),
inference(instantiation,[status(thm)],[c_144]) ).
tcf(c_332,plain,
rd(iPr_def_11,sK5) = iPr_def_10,
inference(superposition,[status(thm)],[c_116,c_52]) ).
tcf(c_365,plain,
( ( iPr_def_12 = iPr_def_15 )
| ( iPr_def_15 != mult(sK3,iPr_def_11) )
| ( iPr_def_12 != mult(sK3,iPr_def_11) ) ),
inference(instantiation,[status(thm)],[c_309]) ).
tcf(c_367,plain,
! [X0: $i,X1: $i] : mult(X0,i(X1)) = rd(X0,X1),
inference(superposition,[status(thm)],[c_51,c_56]) ).
tcf(c_450,plain,
! [X0: $i] :
( ( iPr_def_15 = mult(sK3,iPr_def_11) )
| ( iPr_def_15 != X0 )
| ( mult(sK3,iPr_def_11) != X0 ) ),
inference(instantiation,[status(thm)],[c_144]) ).
tcf(c_476,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(mult(X0,X1),X0)) = mult(mult(unit,X1),X0),
inference(superposition,[status(thm)],[c_58,c_55]) ).
tcf(c_603,plain,
mult(sK5,sK4) = iPr_def_10,
inference(superposition,[status(thm)],[c_278,c_49]) ).
tcf(c_605,plain,
mult(iPr_def_10,sK5) = iPr_def_11,
inference(superposition,[status(thm)],[c_279,c_49]) ).
tcf(c_636,plain,
mult(sK3,iPr_def_11) = iPr_def_12,
inference(superposition,[status(thm)],[c_280,c_49]) ).
tcf(c_637,plain,
mult(sK5,iPr_def_13) = iPr_def_14,
inference(superposition,[status(thm)],[c_281,c_49]) ).
tcf(c_681,plain,
! [X0: $i,X1: $i] :
( ( mult(X0,X1) = mult(X1,X0) )
| ( ld(i(X0),X1) = mult(X0,X1) ) ),
inference(superposition,[status(thm)],[c_59,c_50]) ).
tcf(c_980,plain,
! [X0: $i] : i(i(X0)) = X0,
inference(demodulation,[status(thm)],[c_268,c_267]) ).
tcf(c_981,plain,
! [X0: $i,X1: $i] :
( ( mult(i(X0),X1) = mult(X1,i(X0)) )
| ( mult(X0,mult(i(X0),X1)) = X1 ) ),
inference(superposition,[status(thm)],[c_980,c_59]) ).
tcf(c_1909,plain,
( ( iPr_def_15 = mult(sK3,iPr_def_11) )
| ( iPr_def_15 != mult(sK3,iPr_def_14) )
| ( mult(sK3,iPr_def_11) != mult(sK3,iPr_def_14) ) ),
inference(instantiation,[status(thm)],[c_450]) ).
tcf(c_3163,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(mult(X0,X1),X0)) = mult(X1,X0),
inference(demodulation,[status(thm)],[c_476,c_54]) ).
tcf(c_3195,plain,
mult(i(sK5),mult(iPr_def_10,sK5)) = mult(sK4,sK5),
inference(superposition,[status(thm)],[c_603,c_3163]) ).
tcf(c_3267,plain,
mult(i(sK5),iPr_def_11) = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_3195,c_300,c_605]) ).
tcf(c_3452,plain,
ld(i(sK5),iPr_def_13) = iPr_def_11,
inference(superposition,[status(thm)],[c_3267,c_50]) ).
tcf(c_4834,plain,
( ( mult(sK3,iPr_def_11) = mult(sK3,iPr_def_14) )
| ( iPr_def_11 != iPr_def_14 )
| ( sK3 != sK3 ) ),
inference(instantiation,[status(thm)],[c_146]) ).
tcf(c_5260,plain,
sK3 = sK3,
inference(instantiation,[status(thm)],[c_143]) ).
tcf(c_20279,plain,
( ( mult(sK5,iPr_def_13) = iPr_def_11 )
| ( mult(sK5,iPr_def_13) = mult(iPr_def_13,sK5) ) ),
inference(superposition,[status(thm)],[c_681,c_3452]) ).
tcf(c_20286,plain,
( ( iPr_def_11 = iPr_def_14 )
| ( mult(iPr_def_13,sK5) = iPr_def_14 ) ),
inference(light_normalisation,[status(thm)],[c_20279,c_637]) ).
tcf(c_20491,plain,
mult(iPr_def_13,sK5) = iPr_def_14,
inference(global_subsumption_just,[status(thm)],[c_20286,c_117,c_120,c_139,c_365,c_1909,c_4834,c_5260,c_20286]) ).
tcf(c_39479,plain,
! [X0: $i,X1: $i] :
( ( mult(i(X0),X1) = rd(X1,X0) )
| ( mult(X0,mult(i(X0),X1)) = X1 ) ),
inference(demodulation,[status(thm)],[c_981,c_367]) ).
tcf(c_39523,plain,
( ( mult(sK5,iPr_def_13) = iPr_def_11 )
| ( mult(i(sK5),iPr_def_11) = rd(iPr_def_11,sK5) ) ),
inference(superposition,[status(thm)],[c_3267,c_39479]) ).
tcf(c_39588,plain,
( ( iPr_def_11 = iPr_def_14 )
| ( iPr_def_10 = iPr_def_13 ) ),
inference(light_normalisation,[status(thm)],[c_39523,c_332,c_637,c_3267]) ).
tcf(c_39971,plain,
iPr_def_10 = iPr_def_13,
inference(global_subsumption_just,[status(thm)],[c_39588,c_117,c_120,c_139,c_365,c_1909,c_4834,c_5260,c_39588]) ).
tcf(c_40010,plain,
mult(iPr_def_10,sK5) = iPr_def_14,
inference(demodulation,[status(thm)],[c_20491,c_39971]) ).
tcf(c_40059,plain,
iPr_def_11 = iPr_def_14,
inference(light_normalisation,[status(thm)],[c_40010,c_605]) ).
tcf(c_40110,plain,
mult(sK3,iPr_def_11) = iPr_def_15,
inference(demodulation,[status(thm)],[c_120,c_40059]) ).
tcf(c_40111,plain,
iPr_def_12 = iPr_def_15,
inference(light_normalisation,[status(thm)],[c_40110,c_636]) ).
tcf(c_40112,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_40111,c_139]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP748+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/10.44 % Computer : n005.cluster.edu
% 0.18/10.44 % Model : x86_64 x86_64
% 0.18/10.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/10.44 % Memory : 8046.5625MB
% 0.18/10.44 % OS : Linux 6.8.0-71-generic
% 0.18/10.44 % CPULimit : 300
% 0.18/10.44 % WCLimit : 300
% 0.18/10.44 % DateTime : Wed Sep 23 15:54:59 UTC 2026
% 0.18/10.45 % CPUTime :
% 0.18/10.45 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.21/10.51 Running first-order theorem proving
% 0.21/10.51 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.21/10.52
% 0.21/10.52 % ======== iProver multi-core TPTP/SMT =========
% 0.21/10.52
% 0.21/10.52 % Detected problem language: tptp
% 0.21/10.54 % Proving...
% 28.22/15.57 % SZS status Started for theBenchmark.p
% 28.22/15.57 % SZS status Theorem for theBenchmark.p
% 28.22/15.57
% 28.22/15.57 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 28.22/15.57
% 28.22/15.57 % ------ iProver source info
% 28.22/15.57
% 28.22/15.57 % git: date: 2026-07-19 20:42:38 +0200
% 28.22/15.57 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 28.22/15.57 % git: non_committed_changes: false
% 28.22/15.57
% 28.22/15.57 % ------ Parsing...
% 28.22/15.57 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 28.22/15.57
% 28.22/15.57 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 28.22/15.57
% 28.22/15.57 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 28.22/15.57
% 28.22/15.57 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 28.22/15.57 % ------ Proving...
% 28.22/15.57 % ------ Problem Properties
% 28.22/15.57
% 28.22/15.57 %
% 28.22/15.57 % clauses 39
% 28.22/15.57 % conjectures 3
% 28.22/15.57 % EPR 4
% 28.22/15.57 % Horn 38
% 28.22/15.57 % unary 38
% 28.22/15.57 % binary 1
% 28.22/15.57 % lits 40
% 28.22/15.57 % lits eq 40
% 28.22/15.57 % fd_pure 0
% 28.22/15.57 % fd_pseudo 0
% 28.22/15.57 % fd_cond 0
% 28.22/15.57 % fd_pseudo_cond 0
% 28.22/15.57 % AC symbols 0
% 28.22/15.57
% 28.22/15.57 % ------ Schedule dynamic 5 is on
% 28.22/15.57
% 28.22/15.57 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 28.22/15.57
% 28.22/15.57
% 28.22/15.57 % ------
% 28.22/15.57 % Current options:
% 28.22/15.57 % ------
% 28.22/15.57
% 28.22/15.57
% 28.22/15.57 %
% 28.22/15.57
% 28.22/15.57 % ------ Proving...
% 28.22/15.57 %
% 28.22/15.57
% 28.22/15.57 % SZS status Theorem for theBenchmark.p
% 28.22/15.57
% 28.22/15.57 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 28.22/15.58
% 28.22/15.58
%------------------------------------------------------------------------------