%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP700-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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 : Unsatisfiable 2.83s 1.25s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
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,
! [X2,X0,X1] : mult(mult(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(mult(mult(X1,X0),X0),X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
fof(f9,negated_conjecture,
! [X0] : tuple(mult(X0,x0),mult(x0,X0)) != tuple(unit,unit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_63,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,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,[],[f7]) ).
tcf(c_66,negated_conjecture,
! [X0: $i] : tuple(mult(X0,x0),mult(x0,X0)) != tuple(unit,unit),
inference(cnf_transformation,[],[f9]) ).
tcf(c_162,plain,
! [X0: $i] : tuple(mult(ld(x0,X0),x0),X0) != tuple(unit,unit),
inference(superposition,[status(thm)],[c_58,c_66]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i] : ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_60,c_59]) ).
tcf(c_180,plain,
! [X0: $i] : rd(X0,X0) = unit,
inference(superposition,[status(thm)],[c_63,c_61]) ).
tcf(c_184,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_58,c_64]) ).
tcf(c_485,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_62,c_184]) ).
tcf(c_516,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_485,c_62]) ).
tcf(c_1128,plain,
! [X0: $i,X1: $i] : rd(mult(mult(X0,X1),X1),mult(mult(ld(X1,X0),X1),X1)) = X1,
inference(superposition,[status(thm)],[c_516,c_61]) ).
tcf(c_4007,plain,
! [X0: $i] : rd(mult(X0,X0),mult(mult(ld(X0,unit),X0),X0)) = X0,
inference(superposition,[status(thm)],[c_63,c_1128]) ).
tcf(c_4091,plain,
! [X0: $i] : mult(mult(ld(X0,unit),X0),X0) = ld(X0,mult(X0,X0)),
inference(superposition,[status(thm)],[c_4007,c_172]) ).
tcf(c_4773,plain,
! [X0: $i] : mult(mult(ld(X0,unit),X0),X0) = X0,
inference(demodulation,[status(thm)],[c_4091,c_59]) ).
tcf(c_4787,plain,
! [X0: $i] : mult(ld(X0,unit),X0) = rd(X0,X0),
inference(superposition,[status(thm)],[c_4773,c_61]) ).
tcf(c_4838,plain,
! [X0: $i] : mult(ld(X0,unit),X0) = unit,
inference(light_normalisation,[status(thm)],[c_4787,c_180]) ).
tcf(c_5127,plain,
$false,
inference(superposition,[status(thm)],[c_4838,c_162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP700-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.41 % Computer : n020.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Wed Sep 23 15:45:34 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.45 Running UEQ theorem proving
% 0.15/0.45 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.46
% 0.15/0.46 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.46
% 0.21/0.46 % Detected problem language: tptp
% 0.21/0.47 % Proving...
% 2.83/1.25 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.83/1.25 % SZS status Started for theBenchmark.p
% 2.83/1.25 % SZS status Unsatisfiable for theBenchmark.p
% 2.83/1.25
% 2.83/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.83/1.25
% 2.83/1.25 % ------ iProver source info
% 2.83/1.25
% 2.83/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 2.83/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.83/1.25 % git: non_committed_changes: false
% 2.83/1.25
% 2.83/1.25 % ------ Parsing...% successful
% 2.83/1.25
% 2.83/1.25
% 2.83/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.83/1.25
% 2.83/1.25 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.83/1.25
% 2.83/1.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.83/1.25
% 2.83/1.25 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.83/1.25 % ------ Proving...
% 2.83/1.25 % ------ Problem Properties
% 2.83/1.25
% 2.83/1.25 %
% 2.83/1.25 % clauses 9
% 2.83/1.25 % conjectures 1
% 2.83/1.25 % EPR 0
% 2.83/1.25 % Horn 9
% 2.83/1.25 % unary 9
% 2.83/1.25 % binary 0
% 2.83/1.25 % lits 9
% 2.83/1.25 % lits eq 9
% 2.83/1.25 % fd_pure 0
% 2.83/1.25 % fd_pseudo 0
% 2.83/1.25 % fd_cond 0
% 2.83/1.25 % fd_pseudo_cond 0
% 2.83/1.25 % AC symbols 0
% 2.83/1.25
% 2.83/1.25 % ------ Input Options Time Limit: Unbounded
% 2.83/1.25
% 2.83/1.25
% 2.83/1.25 % ------
% 2.83/1.25 % Current options:
% 2.83/1.25 % ------
% 2.83/1.25
% 2.83/1.25
% 2.83/1.25 %
% 2.83/1.25
% 2.83/1.25 % ------ Proving...
% 2.83/1.25 %
% 2.83/1.25
% 2.83/1.25 % SZS status Unsatisfiable for theBenchmark.p
% 2.83/1.25
% 2.83/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.83/1.25
% 2.83/1.25
%------------------------------------------------------------------------------