%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP671-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 : 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:09 PM UTC 2026
% Result : Unsatisfiable 2.62s 6.18s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
fof(f9,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),mult(X2,mult(X0,X1))) = mult(mult(mult(X0,mult(X1,X2)),X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
fof(f10,negated_conjecture,
mult(mult(a,b),a) != mult(a,mult(b,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tcf(c_63,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_64,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,mult(X1,X2)),X0),X1) = mult(mult(X0,X1),mult(X2,mult(X0,X1))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_68,negated_conjecture,
mult(mult(a,b),a) != mult(a,mult(b,a)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_220,plain,
! [X0: $i,X1: $i] : mult(mult(X0,unit),mult(X1,mult(X0,unit))) = mult(mult(X0,mult(unit,X1)),X0),
inference(superposition,[status(thm)],[c_67,c_63]) ).
tcf(c_223,plain,
! [X0: $i,X1: $i] : mult(mult(X0,mult(unit,X1)),X0) = mult(X0,mult(X1,X0)),
inference(light_normalisation,[status(thm)],[c_220,c_63]) ).
tcf(c_519,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),X0) = mult(X0,mult(X1,X0)),
inference(demodulation,[status(thm)],[c_223,c_64]) ).
tcf(c_521,plain,
mult(a,mult(b,a)) != mult(a,mult(b,a)),
inference(demodulation,[status(thm)],[c_68,c_519]) ).
tcf(c_522,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_521]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP671-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.11/5.38 % Computer : n020.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Wed Sep 23 15:39:53 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.42 Running UEQ theorem proving
% 0.14/5.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/5.43
% 0.14/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 2.62/6.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.62/6.18 % SZS status Started for theBenchmark.p
% 2.62/6.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.62/6.18
% 2.62/6.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.62/6.18
% 2.62/6.18 % ------ iProver source info
% 2.62/6.18
% 2.62/6.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.62/6.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.62/6.18 % git: non_committed_changes: false
% 2.62/6.18
% 2.62/6.18 % ------ Parsing...% successful
% 2.62/6.18
% 2.62/6.18
% 2.62/6.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.62/6.18
% 2.62/6.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.62/6.18
% 2.62/6.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.62/6.18
% 2.62/6.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.62/6.18 % ------ Proving...
% 2.62/6.18 % ------ Problem Properties
% 2.62/6.18
% 2.62/6.18 %
% 2.62/6.18 % clauses 10
% 2.62/6.18 % conjectures 1
% 2.62/6.18 % EPR 0
% 2.62/6.18 % Horn 10
% 2.62/6.18 % unary 10
% 2.62/6.18 % binary 0
% 2.62/6.18 % lits 10
% 2.62/6.18 % lits eq 10
% 2.62/6.18 % fd_pure 0
% 2.62/6.18 % fd_pseudo 0
% 2.62/6.18 % fd_cond 0
% 2.62/6.18 % fd_pseudo_cond 0
% 2.62/6.18 % AC symbols 0
% 2.62/6.18
% 2.62/6.18 % ------ Input Options Time Limit: Unbounded
% 2.62/6.18
% 2.62/6.18
% 2.62/6.18 % ------
% 2.62/6.18 % Current options:
% 2.62/6.18 % ------
% 2.62/6.18
% 2.62/6.18
% 2.62/6.18 %
% 2.62/6.18
% 2.62/6.18 % ------ Proving...
% 2.62/6.18 %
% 2.62/6.18
% 2.62/6.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.62/6.18
% 2.62/6.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.62/6.18
% 2.62/6.18
%------------------------------------------------------------------------------