%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP715-11 : 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 : 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:17 PM UTC 2026
% Result : Unsatisfiable 11.16s 2.28s
% Output : CNFRefutation 11.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 44 unt; 4 def)
% Number of atoms : 72 ( 43 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 25 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X2,X0,X1] : mult(mult(mult(X0,X1),X2),X1) = mult(X0,mult(mult(X1,X2),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
fof(f8,axiom,
! [X0,X1] : mult(X0,mult(X1,X1)) = mult(mult(X0,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
fof(f9,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
fof(f10,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
fof(f11,axiom,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
fof(f12,plain,
unit = mult(op_a,op_b),
inference(reorient_equations,[],[f11]) ).
fof(f13,axiom,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).
fof(f14,plain,
unit = mult(op_b,op_a),
inference(reorient_equations,[],[f13]) ).
fof(f15,negated_conjecture,
mult(mult(x0,op_b),op_a) != x0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
fof(f16,plain,
x0 != mult(mult(x0,op_b),op_a),
inference(reorient_equations,[],[f15]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X2),X1) = mult(X0,mult(mult(X1,X2),X1)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_68,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f9]) ).
tcf(c_69,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_70,plain,
mult(op_a,op_b) = unit,
inference(cnf_transformation,[],[f12]) ).
tcf(c_71,plain,
mult(op_b,op_a) = unit,
inference(cnf_transformation,[],[f14]) ).
tcf(c_72,negated_conjecture,
mult(mult(x0,op_b),op_a) != x0,
inference(cnf_transformation,[],[f16]) ).
tcf(c_109,definition,
iPr_def_10 = mult(x0,op_b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_110,definition,
iPr_def_11 = mult(iPr_def_10,op_a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_111,definition,
iPr_def_12 = mult(op_b,op_a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_112,definition,
iPr_def_13 = mult(op_a,op_b),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_113,negated_conjecture,
iPr_def_11 != x0,
inference(demodulation,[status(thm)],[c_72,c_109,c_110]) ).
tcf(c_114,plain,
iPr_def_12 = unit,
inference(demodulation,[status(thm)],[c_71,c_111]) ).
tcf(c_115,plain,
iPr_def_13 = unit,
inference(demodulation,[status(thm)],[c_70,c_112]) ).
tcf(c_116,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(demodulation,[status(thm)],[c_69]) ).
tcf(c_117,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_119,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X2),X1) = mult(X0,mult(mult(X1,X2),X1)),
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_183,plain,
! [X0: $i] : mult(X0,iPr_def_13) = X0,
inference(demodulation,[status(thm)],[c_117,c_115]) ).
tcf(c_184,plain,
! [X0: $i] : mult(iPr_def_13,X0) = X0,
inference(demodulation,[status(thm)],[c_116,c_115]) ).
tcf(c_192,plain,
iPr_def_12 = iPr_def_13,
inference(superposition,[status(thm)],[c_114,c_115]) ).
tcf(c_201,plain,
mult(op_b,mult(op_a,op_a)) = mult(iPr_def_12,op_a),
inference(superposition,[status(thm)],[c_111,c_118]) ).
tcf(c_203,plain,
mult(iPr_def_10,mult(op_a,op_a)) = mult(iPr_def_11,op_a),
inference(superposition,[status(thm)],[c_110,c_118]) ).
tcf(c_250,plain,
! [X0: $i] : mult(x0,mult(mult(op_b,X0),op_b)) = mult(mult(iPr_def_10,X0),op_b),
inference(superposition,[status(thm)],[c_109,c_119]) ).
tcf(c_307,plain,
mult(op_b,mult(op_a,op_a)) = mult(iPr_def_13,op_a),
inference(demodulation,[status(thm)],[c_201,c_192]) ).
tcf(c_308,plain,
mult(op_b,mult(op_a,op_a)) = op_a,
inference(demodulation,[status(thm)],[c_307,c_184]) ).
tcf(c_2183,plain,
mult(mult(iPr_def_10,op_a),op_b) = mult(x0,mult(iPr_def_12,op_b)),
inference(superposition,[status(thm)],[c_111,c_250]) ).
tcf(c_2185,plain,
mult(mult(iPr_def_10,mult(op_a,op_a)),op_b) = mult(x0,mult(op_a,op_b)),
inference(superposition,[status(thm)],[c_308,c_250]) ).
tcf(c_2330,plain,
mult(iPr_def_11,op_b) = iPr_def_10,
inference(demodulation,[status(thm)],[c_2183,c_109,c_110,c_184,c_192]) ).
tcf(c_2347,plain,
mult(mult(iPr_def_11,op_a),op_b) = x0,
inference(demodulation,[status(thm)],[c_2185,c_112,c_183,c_203]) ).
tcf(c_2485,plain,
! [X0: $i] : mult(iPr_def_11,mult(mult(op_b,X0),op_b)) = mult(mult(iPr_def_10,X0),op_b),
inference(superposition,[status(thm)],[c_2330,c_119]) ).
tcf(c_3576,plain,
mult(mult(iPr_def_10,mult(op_a,op_a)),op_b) = mult(iPr_def_11,mult(op_a,op_b)),
inference(superposition,[status(thm)],[c_308,c_2485]) ).
tcf(c_3823,plain,
x0 = iPr_def_11,
inference(demodulation,[status(thm)],[c_3576,c_112,c_183,c_203,c_2347]) ).
tcf(c_4154,plain,
$false,
inference(superposition,[status(thm)],[c_3823,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP715-11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n026.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 15:52:08 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/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...
% 11.16/2.28 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 11.16/2.28 % SZS status Started for theBenchmark.p
% 11.16/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 11.16/2.28
% 11.16/2.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 11.16/2.28
% 11.16/2.28 % ------ iProver source info
% 11.16/2.28
% 11.16/2.28 % git: date: 2026-07-19 20:42:38 +0200
% 11.16/2.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 11.16/2.28 % git: non_committed_changes: false
% 11.16/2.28
% 11.16/2.28 % ------ Parsing...% successful
% 11.16/2.28
% 11.16/2.28
% 11.16/2.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 11.16/2.28
% 11.16/2.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 11.16/2.28
% 11.16/2.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 11.16/2.28
% 11.16/2.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 11.16/2.28 % ------ Proving...
% 11.16/2.28 % ------ Problem Properties
% 11.16/2.28
% 11.16/2.28 %
% 11.16/2.28 % clauses 16
% 11.16/2.28 % conjectures 1
% 11.16/2.28 % EPR 3
% 11.16/2.28 % Horn 16
% 11.16/2.28 % unary 16
% 11.16/2.28 % binary 0
% 11.16/2.28 % lits 16
% 11.16/2.28 % lits eq 16
% 11.16/2.28 % fd_pure 0
% 11.16/2.28 % fd_pseudo 0
% 11.16/2.28 % fd_cond 0
% 11.16/2.28 % fd_pseudo_cond 0
% 11.16/2.28 % AC symbols 1
% 11.16/2.28
% 11.16/2.28 % ------ Input Options Time Limit: Unbounded
% 11.16/2.28
% 11.16/2.28
% 11.16/2.28 % ------
% 11.16/2.28 % Current options:
% 11.16/2.28 % ------
% 11.16/2.28
% 11.16/2.28
% 11.16/2.28 %
% 11.16/2.28
% 11.16/2.28 % ------ Proving...
% 11.16/2.28 %
% 11.16/2.28
% 11.16/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 11.16/2.28
% 11.16/2.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.16/2.28
% 11.16/2.28
%------------------------------------------------------------------------------