%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP731-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 : n007.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:19 PM UTC 2026
% Result : Unsatisfiable 8.82s 2.14s
% Output : CNFRefutation 8.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 45 unt; 2 def)
% Number of atoms : 74 ( 44 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 62 ( 0 sgn 62 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
fof(f3,axiom,
! [X0] : mult(X0,i(X0)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
fof(f4,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0] : mult(i(X0),X0) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
fof(f6,plain,
! [X0] : unit = mult(i(X0),X0),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X0,X1] : i(mult(X0,X1)) = mult(i(X0),i(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
fof(f8,axiom,
! [X0,X1] : mult(i(X0),mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
fof(f9,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
fof(f12,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),X2) = mult(mult(X0,mult(X1,X2)),asoc(X0,X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
fof(f13,axiom,
! [X0,X1] : mult(X0,X1) = mult(mult(X1,X0),op_k(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
fof(f23,axiom,
! [X2,X3,X0,X1,X4] : asoc(asoc(X0,X1,X2),X3,X4) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c21) ).
fof(f24,plain,
! [X2,X3,X0,X1,X4] : unit = asoc(asoc(X0,X1,X2),X3,X4),
inference(reorient_equations,[],[f23]) ).
fof(f27,negated_conjecture,
op_k(asoc(a,b,c),d) != unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f28,plain,
unit != op_k(asoc(a,b,c),d),
inference(reorient_equations,[],[f27]) ).
tcf(c_73,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f2]) ).
tcf(c_74,plain,
! [X0: $i] : mult(X0,i(X0)) = unit,
inference(cnf_transformation,[],[f4]) ).
tcf(c_75,plain,
! [X0: $i] : mult(i(X0),X0) = unit,
inference(cnf_transformation,[],[f6]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] : mult(i(X0),i(X1)) = i(mult(X0,X1)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f8]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f9]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X2)),asoc(X0,X1,X2)) = mult(mult(X0,X1),X2),
inference(cnf_transformation,[],[f12]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),op_k(X1,X0)) = mult(X1,X0),
inference(cnf_transformation,[],[f13]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : asoc(asoc(X0,X1,X2),X3,X4) = unit,
inference(cnf_transformation,[],[f24]) ).
tcf(c_91,negated_conjecture,
op_k(asoc(a,b,c),d) != unit,
inference(cnf_transformation,[],[f28]) ).
tcf(c_157,definition,
iPr_def_10 = asoc(a,b,c),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_158,definition,
iPr_def_11 = op_k(iPr_def_10,d),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_159,negated_conjecture,
iPr_def_11 != unit,
inference(demodulation,[status(thm)],[c_91,c_157,c_158]) ).
tcf(c_276,plain,
! [X0: $i] : rd(unit,i(X0)) = X0,
inference(superposition,[status(thm)],[c_74,c_78]) ).
tcf(c_277,plain,
! [X0: $i] : rd(unit,X0) = i(X0),
inference(superposition,[status(thm)],[c_75,c_78]) ).
tcf(c_319,plain,
! [X0: $i] : i(i(X0)) = X0,
inference(superposition,[status(thm)],[c_277,c_276]) ).
tcf(c_331,plain,
! [X0: $i,X1: $i] : i(mult(X0,i(X1))) = mult(i(X0),X1),
inference(superposition,[status(thm)],[c_319,c_76]) ).
tcf(c_360,plain,
! [X0: $i,X1: $i] : mult(X0,mult(i(X0),X1)) = X1,
inference(superposition,[status(thm)],[c_319,c_77]) ).
tcf(c_601,plain,
! [X0: $i,X1: $i] : asoc(iPr_def_10,X0,X1) = unit,
inference(superposition,[status(thm)],[c_157,c_89]) ).
tcf(c_709,plain,
! [X0: $i,X1: $i] : mult(mult(iPr_def_10,mult(X0,X1)),unit) = mult(mult(iPr_def_10,X0),X1),
inference(superposition,[status(thm)],[c_601,c_81]) ).
tcf(c_716,plain,
! [X0: $i,X1: $i] : mult(mult(iPr_def_10,X0),X1) = mult(iPr_def_10,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_709,c_73]) ).
tcf(c_1079,plain,
mult(mult(d,iPr_def_10),iPr_def_11) = mult(iPr_def_10,d),
inference(superposition,[status(thm)],[c_158,c_82]) ).
tcf(c_2842,plain,
mult(i(mult(d,iPr_def_10)),mult(iPr_def_10,d)) = iPr_def_11,
inference(superposition,[status(thm)],[c_1079,c_77]) ).
tcf(c_7657,plain,
! [X0: $i] : mult(iPr_def_10,mult(X0,i(mult(iPr_def_10,X0)))) = unit,
inference(superposition,[status(thm)],[c_716,c_74]) ).
tcf(c_8435,plain,
! [X0: $i] : rd(unit,mult(X0,i(mult(iPr_def_10,X0)))) = iPr_def_10,
inference(superposition,[status(thm)],[c_7657,c_78]) ).
tcf(c_8462,plain,
! [X0: $i] : mult(i(X0),mult(iPr_def_10,X0)) = iPr_def_10,
inference(demodulation,[status(thm)],[c_8435,c_277,c_331]) ).
tcf(c_9135,plain,
! [X0: $i] : mult(X0,iPr_def_10) = mult(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_8462,c_360]) ).
tcf(c_9164,plain,
mult(i(mult(iPr_def_10,d)),mult(iPr_def_10,d)) = iPr_def_11,
inference(demodulation,[status(thm)],[c_2842,c_9135]) ).
tcf(c_9168,plain,
unit = iPr_def_11,
inference(demodulation,[status(thm)],[c_9164,c_75]) ).
tcf(c_9195,plain,
iPr_def_11 != iPr_def_11,
inference(demodulation,[status(thm)],[c_159,c_9168]) ).
tcf(c_9197,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_9195]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP731-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.10/0.37 % Computer : n007.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:50:07 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running UEQ theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 8.82/2.14 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 8.82/2.14 % SZS status Started for theBenchmark.p
% 8.82/2.14 % SZS status Unsatisfiable for theBenchmark.p
% 8.82/2.14
% 8.82/2.14 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.82/2.14
% 8.82/2.14 % ------ iProver source info
% 8.82/2.14
% 8.82/2.14 % git: date: 2026-07-19 20:42:38 +0200
% 8.82/2.14 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.82/2.14 % git: non_committed_changes: false
% 8.82/2.14
% 8.82/2.14 % ------ Parsing...% successful
% 8.82/2.14
% 8.82/2.14
% 8.82/2.14 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.82/2.14
% 8.82/2.14 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 8.82/2.14
% 8.82/2.14 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.82/2.14
% 8.82/2.14 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 8.82/2.14 % ------ Proving...
% 8.82/2.14 % ------ Problem Properties
% 8.82/2.14
% 8.82/2.14 %
% 8.82/2.14 % clauses 22
% 8.82/2.14 % conjectures 1
% 8.82/2.14 % EPR 1
% 8.82/2.14 % Horn 22
% 8.82/2.14 % unary 22
% 8.82/2.14 % binary 0
% 8.82/2.14 % lits 22
% 8.82/2.14 % lits eq 22
% 8.82/2.14 % fd_pure 0
% 8.82/2.14 % fd_pseudo 0
% 8.82/2.14 % fd_cond 0
% 8.82/2.14 % fd_pseudo_cond 0
% 8.82/2.14 % AC symbols 0
% 8.82/2.14
% 8.82/2.14 % ------ Input Options Time Limit: Unbounded
% 8.82/2.14
% 8.82/2.14
% 8.82/2.14 % ------
% 8.82/2.14 % Current options:
% 8.82/2.14 % ------
% 8.82/2.14
% 8.82/2.14
% 8.82/2.14 %
% 8.82/2.14
% 8.82/2.14 % ------ Proving...
% 8.82/2.14 %
% 8.82/2.14
% 8.82/2.14 % SZS status Unsatisfiable for theBenchmark.p
% 8.82/2.14
% 8.82/2.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.82/2.14
% 8.82/2.14
%------------------------------------------------------------------------------