%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP657+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 : n009.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:05 PM UTC 2026
% Result : Theorem 0.71s 1.29s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 22 unt; 0 def)
% Number of atoms : 36 ( 35 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 : 5 ( 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 : 4 ( 4 usr; 0 con; 1-2 aty)
% Number of variables : 56 ( 0 sgn 53 !; 3 ?; 30 :)
% 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(f4,axiom,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X0,X1,X2] : mult(mult(X2,X1),mult(X0,X2)) = mult(X2,mult(mult(X1,X0),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f6,conjecture,
? [X0] :
! [X1] :
( mult(X0,X1) = X1
& mult(X1,X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f7,negated_conjecture,
~ ? [X0] :
! [X1] :
( mult(X0,X1) = X1
& mult(X1,X0) = X1 ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [X0] :
? [X1] :
( mult(X0,X1) != X1
| mult(X1,X0) != X1 ),
inference(ennf_transformation,[],[f7]) ).
fof(f9,plain,
! [X0] :
( sK0(X0) != mult(X0,sK0(X0))
| sK0(X0) != mult(sK0(X0),X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f8]) ).
fof(f10,plain,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f13,plain,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
! [X2,X0,X1] : mult(mult(X2,X1),mult(X0,X2)) = mult(X2,mult(mult(X1,X0),X2)),
inference(cnf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0] :
( sK0(X0) != mult(X0,sK0(X0))
| sK0(X0) != mult(sK0(X0),X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f11]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(X2,X0)) = mult(X0,mult(mult(X1,X2),X0)),
inference(cnf_transformation,[],[f14]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] :
( ( mult(X0,sK0(X0)) != sK0(X0) )
| ( mult(sK0(X0),X0) != sK0(X0) ) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_82,negated_conjecture,
! [X0: $i] :
( ( mult(X0,sK0(X0)) != sK0(X0) )
| ( mult(sK0(X0),X0) != sK0(X0) ) ),
inference(demodulation,[status(thm)],[c_54]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(mult(ld(X0,X1),X2),X0)) = mult(X1,mult(X2,X0)),
inference(superposition,[status(thm)],[c_49,c_53]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i,X2: $i] : ld(X0,mult(X1,mult(X2,X0))) = mult(mult(ld(X0,X1),X2),X0),
inference(superposition,[status(thm)],[c_138,c_50]) ).
tcf(c_452,plain,
! [X0: $i,X1: $i] : mult(mult(ld(X0,X0),X1),X0) = mult(X1,X0),
inference(superposition,[status(thm)],[c_162,c_50]) ).
tcf(c_497,plain,
! [X0: $i,X1: $i] : mult(ld(X0,X0),X1) = rd(mult(X1,X0),X0),
inference(superposition,[status(thm)],[c_452,c_52]) ).
tcf(c_612,plain,
! [X0: $i,X1: $i] : mult(ld(X0,X0),X1) = X1,
inference(demodulation,[status(thm)],[c_497,c_52]) ).
tcf(c_620,plain,
! [X0: $i,X1: $i] : ld(X0,X0) = rd(X1,X1),
inference(superposition,[status(thm)],[c_612,c_52]) ).
tcf(c_696,plain,
! [X0: $i,X1: $i] : mult(X0,rd(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_620,c_49]) ).
tcf(c_702,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X0),X1) = X1,
inference(superposition,[status(thm)],[c_620,c_612]) ).
tcf(c_743,plain,
! [X0: $i] : mult(rd(X0,X0),sK0(rd(X0,X0))) != sK0(rd(X0,X0)),
inference(superposition,[status(thm)],[c_696,c_82]) ).
tcf(c_752,plain,
$false,
inference(ground_joinability,[status(thm)],[c_743,c_702]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP657+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.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 15:31:13 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 0.71/1.29 % SZS status Started for theBenchmark.p
% 0.71/1.29 % SZS status Theorem for theBenchmark.p
% 0.71/1.29
% 0.71/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.71/1.29
% 0.71/1.29 % ------ iProver source info
% 0.71/1.29
% 0.71/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.71/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.71/1.29 % git: non_committed_changes: false
% 0.71/1.29
% 0.71/1.29 % ------ Parsing...
% 0.71/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.71/1.29
% 0.71/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.71/1.29
% 0.71/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.71/1.29
% 0.71/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.71/1.29 % ------ Proving...
% 0.71/1.29 % ------ Problem Properties
% 0.71/1.29
% 0.71/1.29 %
% 0.71/1.29 % clauses 6
% 0.71/1.29 % conjectures 1
% 0.71/1.29 % EPR 0
% 0.71/1.29 % Horn 6
% 0.71/1.29 % unary 5
% 0.71/1.29 % binary 1
% 0.71/1.29 % lits 7
% 0.71/1.29 % lits eq 7
% 0.71/1.29 % fd_pure 0
% 0.71/1.29 % fd_pseudo 0
% 0.71/1.29 % fd_cond 0
% 0.71/1.29 % fd_pseudo_cond 0
% 0.71/1.29 % AC symbols 0
% 0.71/1.29
% 0.71/1.29 % ------ Schedule dynamic 5 is on
% 0.71/1.29
% 0.71/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.71/1.29
% 0.71/1.29
% 0.71/1.29 % ------
% 0.71/1.29 % Current options:
% 0.71/1.29 % ------
% 0.71/1.29
% 0.71/1.29
% 0.71/1.29 %
% 0.71/1.29
% 0.71/1.29 % ------ Proving...
% 0.71/1.29 %
% 0.71/1.29
% 0.71/1.29 % SZS status Theorem for theBenchmark.p
% 0.71/1.29
% 0.71/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.71/1.30
% 0.71/1.30
%------------------------------------------------------------------------------