%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP696-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 : n026.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:13 PM UTC 2026
% Result : Unsatisfiable 2.52s 1.20s
% Output : CNFRefutation 4.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 75 ( 75 unt; 8 def)
% Number of atoms : 139 ( 74 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 : 10 ( 8 usr; 9 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 70 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
fof(f7,axiom,
! [X0,X1] : mult(X0,i(mult(X1,X0))) = i(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
fof(f8,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,X2)) = mult(rd(mult(X0,X1),X0),mult(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
fof(f9,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),X2) = mult(mult(X0,X2),ld(X2,mult(X1,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
fof(f10,axiom,
! [X0] : mult(i(X0),X0) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
fof(f11,plain,
! [X0] : unit = mult(i(X0),X0),
inference(reorient_equations,[],[f10]) ).
fof(f12,axiom,
! [X0] : mult(X0,i(X0)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
fof(f13,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(reorient_equations,[],[f12]) ).
fof(f14,negated_conjecture,
mult(mult(mult(a,b),a),mult(a,c)) != mult(a,mult(mult(mult(b,a),a),c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_66,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] : mult(X0,i(mult(X1,X0))) = i(X1),
inference(cnf_transformation,[],[f7]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] : mult(rd(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(X1,X2)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),ld(X1,mult(X2,X1))) = mult(mult(X0,X2),X1),
inference(cnf_transformation,[],[f9]) ).
tcf(c_70,plain,
! [X0: $i] : mult(i(X0),X0) = unit,
inference(cnf_transformation,[],[f11]) ).
tcf(c_71,plain,
! [X0: $i] : mult(X0,i(X0)) = unit,
inference(cnf_transformation,[],[f13]) ).
tcf(c_72,negated_conjecture,
mult(mult(mult(a,b),a),mult(a,c)) != mult(a,mult(mult(mult(b,a),a),c)),
inference(cnf_transformation,[],[f14]) ).
tcf(c_114,definition,
iPr_def_10 = mult(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_115,definition,
iPr_def_11 = mult(iPr_def_10,a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_116,definition,
iPr_def_12 = mult(a,c),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_117,definition,
iPr_def_13 = mult(iPr_def_11,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_118,definition,
iPr_def_14 = mult(b,a),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_119,definition,
iPr_def_15 = mult(iPr_def_14,a),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_120,definition,
iPr_def_16 = mult(iPr_def_15,c),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_121,definition,
iPr_def_17 = mult(a,iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_122,negated_conjecture,
iPr_def_13 != iPr_def_17,
inference(demodulation,[status(thm)],[c_72,c_118,c_119,c_120,c_121,c_116,c_114,c_115,c_117]) ).
tcf(c_123,plain,
! [X0: $i] : mult(X0,i(X0)) = unit,
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_124,plain,
! [X0: $i] : mult(i(X0),X0) = unit,
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),ld(X1,mult(X2,X1))) = mult(mult(X0,X2),X1),
inference(demodulation,[status(thm)],[c_69]) ).
tcf(c_126,plain,
! [X0: $i,X1: $i,X2: $i] : mult(rd(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(X1,X2)),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i] : mult(X0,i(mult(X1,X0))) = i(X1),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_128,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_130,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_131,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_132,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_133,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_223,plain,
rd(iPr_def_14,a) = b,
inference(superposition,[status(thm)],[c_118,c_130]) ).
tcf(c_225,plain,
rd(iPr_def_13,iPr_def_12) = iPr_def_11,
inference(superposition,[status(thm)],[c_117,c_130]) ).
tcf(c_226,plain,
rd(iPr_def_15,a) = iPr_def_14,
inference(superposition,[status(thm)],[c_119,c_130]) ).
tcf(c_227,plain,
rd(iPr_def_16,c) = iPr_def_15,
inference(superposition,[status(thm)],[c_120,c_130]) ).
tcf(c_228,plain,
rd(iPr_def_17,iPr_def_16) = a,
inference(superposition,[status(thm)],[c_121,c_130]) ).
tcf(c_238,plain,
! [X0: $i] : ld(i(X0),unit) = X0,
inference(superposition,[status(thm)],[c_124,c_132]) ).
tcf(c_239,plain,
! [X0: $i] : ld(X0,unit) = i(X0),
inference(superposition,[status(thm)],[c_123,c_132]) ).
tcf(c_248,plain,
! [X0: $i] : i(i(X0)) = X0,
inference(demodulation,[status(thm)],[c_238,c_239]) ).
tcf(c_263,plain,
! [X0: $i,X1: $i] : mult(unit,ld(X0,mult(X1,X0))) = mult(mult(i(X0),X1),X0),
inference(superposition,[status(thm)],[c_124,c_125]) ).
tcf(c_268,plain,
! [X0: $i] : mult(iPr_def_11,ld(a,mult(X0,a))) = mult(mult(iPr_def_10,X0),a),
inference(superposition,[status(thm)],[c_115,c_125]) ).
tcf(c_293,plain,
! [X0: $i,X1: $i] : mult(mult(i(X0),X1),X0) = ld(X0,mult(X1,X0)),
inference(demodulation,[status(thm)],[c_263,c_128]) ).
tcf(c_366,plain,
! [X0: $i] : mult(rd(mult(a,X0),a),iPr_def_12) = mult(a,mult(X0,c)),
inference(superposition,[status(thm)],[c_116,c_126]) ).
tcf(c_424,plain,
mult(b,i(iPr_def_10)) = i(a),
inference(superposition,[status(thm)],[c_114,c_127]) ).
tcf(c_433,plain,
! [X0: $i,X1: $i] : ld(X0,i(X1)) = i(mult(X1,X0)),
inference(superposition,[status(thm)],[c_127,c_132]) ).
tcf(c_471,plain,
mult(b,a) = iPr_def_14,
inference(superposition,[status(thm)],[c_223,c_131]) ).
tcf(c_473,plain,
mult(iPr_def_11,iPr_def_12) = iPr_def_13,
inference(superposition,[status(thm)],[c_225,c_131]) ).
tcf(c_474,plain,
mult(iPr_def_14,a) = iPr_def_15,
inference(superposition,[status(thm)],[c_226,c_131]) ).
tcf(c_484,plain,
mult(iPr_def_15,c) = iPr_def_16,
inference(superposition,[status(thm)],[c_227,c_131]) ).
tcf(c_485,plain,
mult(a,iPr_def_16) = iPr_def_17,
inference(superposition,[status(thm)],[c_228,c_131]) ).
tcf(c_685,plain,
mult(i(iPr_def_10),i(i(a))) = i(b),
inference(superposition,[status(thm)],[c_424,c_127]) ).
tcf(c_687,plain,
mult(i(iPr_def_10),a) = i(b),
inference(demodulation,[status(thm)],[c_685,c_248]) ).
tcf(c_877,plain,
mult(mult(iPr_def_10,i(iPr_def_10)),a) = mult(iPr_def_11,ld(a,i(b))),
inference(superposition,[status(thm)],[c_687,c_268]) ).
tcf(c_879,plain,
mult(iPr_def_11,i(iPr_def_14)) = a,
inference(demodulation,[status(thm)],[c_877,c_128,c_123,c_433,c_471]) ).
tcf(c_1022,plain,
mult(i(iPr_def_14),i(a)) = i(iPr_def_11),
inference(superposition,[status(thm)],[c_879,c_127]) ).
tcf(c_3027,plain,
mult(i(a),i(i(iPr_def_11))) = i(i(iPr_def_14)),
inference(superposition,[status(thm)],[c_1022,c_127]) ).
tcf(c_3030,plain,
mult(i(a),iPr_def_11) = iPr_def_14,
inference(demodulation,[status(thm)],[c_3027,c_248]) ).
tcf(c_4350,plain,
ld(a,mult(iPr_def_11,a)) = mult(iPr_def_14,a),
inference(superposition,[status(thm)],[c_3030,c_293]) ).
tcf(c_4394,plain,
ld(a,mult(iPr_def_11,a)) = iPr_def_15,
inference(demodulation,[status(thm)],[c_4350,c_474]) ).
tcf(c_4492,plain,
mult(a,iPr_def_15) = mult(iPr_def_11,a),
inference(superposition,[status(thm)],[c_4394,c_133]) ).
tcf(c_5950,plain,
mult(rd(mult(iPr_def_11,a),a),iPr_def_12) = mult(a,mult(iPr_def_15,c)),
inference(superposition,[status(thm)],[c_4492,c_366]) ).
tcf(c_5969,plain,
iPr_def_13 = iPr_def_17,
inference(demodulation,[status(thm)],[c_5950,c_130,c_473,c_484,c_485]) ).
tcf(c_5970,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5969,c_122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP696-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.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 15:47:09 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.40 Running UEQ theorem proving
% 0.13/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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 2.52/1.20 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.52/1.20 % SZS status Started for theBenchmark.p
% 2.52/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.52/1.20
% 2.52/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.52/1.20
% 2.52/1.20 % ------ iProver source info
% 2.52/1.20
% 2.52/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 2.52/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.52/1.20 % git: non_committed_changes: false
% 2.52/1.20
% 2.52/1.20 % ------ Parsing...% successful
% 2.52/1.20
% 2.52/1.20
% 2.52/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.52/1.20
% 2.52/1.20 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.52/1.20
% 2.52/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.52/1.20
% 2.52/1.20 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.52/1.20 % ------ Proving...
% 2.52/1.20 % ------ Problem Properties
% 2.52/1.20
% 2.52/1.20 %
% 2.52/1.20 % clauses 20
% 2.52/1.20 % conjectures 1
% 2.52/1.20 % EPR 1
% 2.52/1.20 % Horn 20
% 2.52/1.20 % unary 20
% 2.52/1.20 % binary 0
% 2.52/1.20 % lits 20
% 2.52/1.20 % lits eq 20
% 2.52/1.20 % fd_pure 0
% 2.52/1.20 % fd_pseudo 0
% 2.52/1.20 % fd_cond 0
% 2.52/1.20 % fd_pseudo_cond 0
% 2.52/1.20 % AC symbols 0
% 2.52/1.20
% 2.52/1.20 % ------ Input Options Time Limit: Unbounded
% 2.52/1.20
% 2.52/1.20
% 2.52/1.20 % ------
% 2.52/1.20 % Current options:
% 2.52/1.20 % ------
% 2.52/1.20
% 2.52/1.20
% 2.52/1.20 %
% 2.52/1.20
% 2.52/1.20 % ------ Proving...
% 2.52/1.20 %
% 2.52/1.20
% 2.52/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.52/1.20
% 2.52/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.65/1.20
% 4.65/1.20
%------------------------------------------------------------------------------