%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP700+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.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:14 PM UTC 2026
% Result : Theorem 8.34s 16.82s
% Output : CNFRefutation 8.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 34 unt; 0 def)
% Number of atoms : 48 ( 47 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 12 ~; 5 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 63 !; 3 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
fof(f7,axiom,
! [X0,X1,X2] : mult(mult(mult(X2,X1),X2),mult(X2,X0)) = mult(X2,mult(mult(mult(X1,X2),X2),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
fof(f9,conjecture,
! [X0] :
? [X1] :
( mult(X0,X1) = unit
& mult(X1,X0) = unit ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f10,negated_conjecture,
~ ! [X0] :
? [X1] :
( mult(X0,X1) = unit
& mult(X1,X0) = unit ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
? [X0] :
! [X1] :
( unit != mult(X0,X1)
| mult(X1,X0) != unit ),
inference(ennf_transformation,[],[f10]) ).
fof(f12,plain,
! [X1] :
( unit != mult(sK0,X1)
| unit != mult(X1,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f11]) ).
fof(f13,plain,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f3]) ).
fof(f16,plain,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f4]) ).
fof(f17,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f5]) ).
fof(f18,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f19,plain,
! [X2,X0,X1] : mult(mult(mult(X2,X1),X2),mult(X2,X0)) = mult(X2,mult(mult(mult(X1,X2),X2),X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f21,plain,
! [X1] :
( unit != mult(sK0,X1)
| unit != mult(X1,sK0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f13]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f14]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f15]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f16]) ).
tcf(c_53,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f17]) ).
tcf(c_54,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f18]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(mult(mult(X1,X0),X0),X2)),
inference(cnf_transformation,[],[f19]) ).
tcf(c_57,negated_conjecture,
! [X0: $i] :
( ( mult(sK0,X0) != unit )
| ( mult(X0,sK0) != unit ) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_93,negated_conjecture,
! [X0: $i] :
( ( mult(sK0,X0) != unit )
| ( mult(X0,sK0) != unit ) ),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_161,plain,
! [X0: $i,X1: $i] : ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_51,c_50]) ).
tcf(c_171,plain,
! [X0: $i] : rd(X0,X0) = unit,
inference(superposition,[status(thm)],[c_54,c_52]) ).
tcf(c_175,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(mult(mult(ld(X0,X1),X0),X0),X2)) = mult(mult(X1,X0),mult(X0,X2)),
inference(superposition,[status(thm)],[c_49,c_55]) ).
tcf(c_598,plain,
! [X0: $i,X1: $i] : mult(X0,mult(mult(ld(X0,X1),X0),X0)) = mult(mult(X1,X0),mult(X0,unit)),
inference(superposition,[status(thm)],[c_53,c_175]) ).
tcf(c_626,plain,
! [X0: $i,X1: $i] : mult(X0,mult(mult(ld(X0,X1),X0),X0)) = mult(mult(X1,X0),X0),
inference(light_normalisation,[status(thm)],[c_598,c_53]) ).
tcf(c_1612,plain,
! [X0: $i,X1: $i] : rd(mult(mult(X0,X1),X1),mult(mult(ld(X1,X0),X1),X1)) = X1,
inference(superposition,[status(thm)],[c_626,c_52]) ).
tcf(c_5000,plain,
! [X0: $i] : rd(mult(X0,X0),mult(mult(ld(X0,unit),X0),X0)) = X0,
inference(superposition,[status(thm)],[c_54,c_1612]) ).
tcf(c_5155,plain,
! [X0: $i] : mult(mult(ld(X0,unit),X0),X0) = ld(X0,mult(X0,X0)),
inference(superposition,[status(thm)],[c_5000,c_161]) ).
tcf(c_5718,plain,
! [X0: $i] : mult(mult(ld(X0,unit),X0),X0) = X0,
inference(demodulation,[status(thm)],[c_5155,c_50]) ).
tcf(c_5732,plain,
! [X0: $i] : mult(ld(X0,unit),X0) = rd(X0,X0),
inference(superposition,[status(thm)],[c_5718,c_52]) ).
tcf(c_5791,plain,
! [X0: $i] : mult(ld(X0,unit),X0) = unit,
inference(light_normalisation,[status(thm)],[c_5732,c_171]) ).
tcf(c_6074,plain,
mult(sK0,ld(sK0,unit)) != unit,
inference(superposition,[status(thm)],[c_5791,c_93]) ).
tcf(c_6095,plain,
$false,
inference(ground_joinability,[status(thm)],[c_6074,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP700+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/15.45 % CPULimit : 300
% 0.09/15.45 % WCLimit : 300
% 0.09/15.45 % DateTime : Wed Sep 23 15:45:03 UTC 2026
% 0.09/15.45 % CPUTime :
% 0.09/15.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/15.49 Running first-order theorem proving
% 0.09/15.49 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.34/15.50
% 0.34/15.50 % ======== iProver multi-core TPTP/SMT =========
% 0.34/15.50
% 0.34/15.50 % Detected problem language: tptp
% 0.34/15.51 % Proving...
% 8.34/16.82 % SZS status Started for theBenchmark.p
% 8.34/16.82 % SZS status Theorem for theBenchmark.p
% 8.34/16.82
% 8.34/16.82 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.34/16.82
% 8.34/16.82 % ------ iProver source info
% 8.34/16.82
% 8.34/16.82 % git: date: 2026-07-19 20:42:38 +0200
% 8.34/16.82 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.34/16.82 % git: non_committed_changes: false
% 8.34/16.82
% 8.34/16.82 % ------ Parsing...
% 8.34/16.82 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.34/16.82
% 8.34/16.82 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 8.34/16.82
% 8.34/16.82 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.34/16.82
% 8.34/16.82 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 8.34/16.82 % ------ Proving...
% 8.34/16.82 % ------ Problem Properties
% 8.34/16.82
% 8.34/16.82 %
% 8.34/16.82 % clauses 9
% 8.34/16.82 % conjectures 1
% 8.34/16.82 % EPR 0
% 8.34/16.82 % Horn 9
% 8.34/16.82 % unary 8
% 8.34/16.82 % binary 1
% 8.34/16.82 % lits 10
% 8.34/16.82 % lits eq 10
% 8.34/16.82 % fd_pure 0
% 8.34/16.82 % fd_pseudo 0
% 8.34/16.82 % fd_cond 0
% 8.34/16.82 % fd_pseudo_cond 0
% 8.34/16.82 % AC symbols 0
% 8.34/16.82
% 8.34/16.82 % ------ Schedule dynamic 5 is on
% 8.34/16.82
% 8.34/16.82 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.34/16.82
% 8.34/16.82
% 8.34/16.82 % ------
% 8.34/16.82 % Current options:
% 8.34/16.82 % ------
% 8.34/16.82
% 8.34/16.82
% 8.34/16.82 %
% 8.34/16.82
% 8.34/16.82 % ------ Proving...
% 8.34/16.82 %
% 8.34/16.82
% 8.34/16.82 % SZS status Theorem for theBenchmark.p
% 8.34/16.82
% 8.34/16.82 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.34/16.82
% 8.34/16.82
%------------------------------------------------------------------------------