%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : BOO013-4 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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:00:13 PM UTC 2026
% Result : Unsatisfiable 0.87s 1.17s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 74 ( 74 unt; 0 def)
% Number of atoms : 74 ( 73 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn 81 !; 0 ?; 65 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',commutativity_of_add) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',commutativity_of_multiply) ).
fof(f3,axiom,
! [X2,X0,X1] : add(X0,multiply(X1,X2)) = multiply(add(X0,X1),add(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',distributivity1) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',distributivity2) ).
fof(f5,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_id1) ).
fof(f6,axiom,
! [X0] : multiply(X0,multiplicative_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',multiplicative_id1) ).
fof(f7,axiom,
! [X0] : add(X0,inverse(X0)) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_inverse1) ).
fof(f8,plain,
! [X0] : multiplicative_identity = add(X0,inverse(X0)),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X0] : multiply(X0,inverse(X0)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',multiplicative_inverse1) ).
fof(f10,plain,
! [X0] : additive_identity = multiply(X0,inverse(X0)),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
add(a,b) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_a_multiplicative_identity) ).
fof(f12,plain,
multiplicative_identity = add(a,b),
inference(reorient_equations,[],[f11]) ).
fof(f13,axiom,
multiply(a,b) = additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_an_additive_identity) ).
fof(f14,plain,
additive_identity = multiply(a,b),
inference(reorient_equations,[],[f13]) ).
fof(f15,negated_conjecture,
b != inverse(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_inverse_is_b) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : multiply(X0,X1) = multiply(X1,X0),
inference(cnf_transformation,[],[f2]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(add(X0,X1),add(X0,X2)) = add(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_64,plain,
! [X0: $i] : add(X0,additive_identity) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_65,plain,
! [X0: $i] : multiply(X0,multiplicative_identity) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_66,plain,
! [X0: $i] : add(X0,inverse(X0)) = multiplicative_identity,
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,plain,
! [X0: $i] : multiply(X0,inverse(X0)) = additive_identity,
inference(cnf_transformation,[],[f10]) ).
tcf(c_68,plain,
add(a,b) = multiplicative_identity,
inference(cnf_transformation,[],[f12]) ).
tcf(c_69,plain,
multiply(a,b) = additive_identity,
inference(cnf_transformation,[],[f14]) ).
tcf(c_70,negated_conjecture,
inverse(a) != b,
inference(cnf_transformation,[],[f15]) ).
tcf(c_159,plain,
! [X0: $i] : add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_64,c_60]) ).
tcf(c_170,plain,
! [X0: $i] : multiply(multiplicative_identity,X0) = X0,
inference(superposition,[status(thm)],[c_65,c_61]) ).
tcf(c_177,plain,
! [X0: $i] : add(a,multiply(b,X0)) = multiply(multiplicative_identity,add(a,X0)),
inference(superposition,[status(thm)],[c_68,c_62]) ).
tcf(c_180,plain,
! [X0: $i,X1: $i] : multiply(X0,add(X0,X1)) = add(X0,multiply(additive_identity,X1)),
inference(superposition,[status(thm)],[c_64,c_62]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i] : add(X0,multiply(inverse(X0),X1)) = multiply(multiplicative_identity,add(X0,X1)),
inference(superposition,[status(thm)],[c_66,c_62]) ).
tcf(c_186,plain,
! [X0: $i,X1: $i] : multiply(add(X0,X1),X0) = add(X0,multiply(X1,additive_identity)),
inference(superposition,[status(thm)],[c_64,c_62]) ).
tcf(c_201,plain,
! [X0: $i] : add(additive_identity,multiply(a,X0)) = multiply(a,add(b,X0)),
inference(superposition,[status(thm)],[c_69,c_63]) ).
tcf(c_205,plain,
! [X0: $i,X1: $i] : add(X0,multiply(X0,X1)) = multiply(X0,add(multiplicative_identity,X1)),
inference(superposition,[status(thm)],[c_65,c_63]) ).
tcf(c_206,plain,
! [X0: $i,X1: $i] : multiply(X0,add(inverse(X0),X1)) = add(additive_identity,multiply(X0,X1)),
inference(superposition,[status(thm)],[c_67,c_63]) ).
tcf(c_250,plain,
! [X0: $i,X1: $i] : add(X0,multiply(multiplicative_identity,X1)) = multiply(multiplicative_identity,add(X0,X1)),
inference(superposition,[status(thm)],[c_170,c_63]) ).
tcf(c_259,plain,
! [X0: $i] : add(a,multiply(b,X0)) = add(a,X0),
inference(demodulation,[status(thm)],[c_177,c_170,c_250]) ).
tcf(c_263,plain,
add(a,inverse(b)) = add(a,additive_identity),
inference(superposition,[status(thm)],[c_67,c_259]) ).
tcf(c_277,plain,
add(a,inverse(b)) = a,
inference(demodulation,[status(thm)],[c_263,c_64]) ).
tcf(c_421,plain,
! [X0: $i,X1: $i] : add(X0,multiply(inverse(X0),X1)) = add(X0,multiply(multiplicative_identity,X1)),
inference(light_normalisation,[status(thm)],[c_181,c_250]) ).
tcf(c_422,plain,
! [X0: $i,X1: $i] : add(X0,multiply(inverse(X0),X1)) = add(X0,X1),
inference(demodulation,[status(thm)],[c_421,c_170]) ).
tcf(c_425,plain,
! [X0: $i,X1: $i] : add(X0,multiply(X1,inverse(X0))) = add(X0,X1),
inference(superposition,[status(thm)],[c_61,c_422]) ).
tcf(c_427,plain,
! [X0: $i] : add(X0,inverse(X0)) = add(X0,multiplicative_identity),
inference(superposition,[status(thm)],[c_65,c_422]) ).
tcf(c_428,plain,
! [X0: $i] : add(X0,inverse(inverse(X0))) = add(X0,additive_identity),
inference(superposition,[status(thm)],[c_67,c_422]) ).
tcf(c_440,plain,
! [X0: $i] : add(X0,multiplicative_identity) = multiplicative_identity,
inference(light_normalisation,[status(thm)],[c_427,c_66]) ).
tcf(c_442,plain,
! [X0: $i] : add(X0,inverse(inverse(X0))) = X0,
inference(light_normalisation,[status(thm)],[c_428,c_64]) ).
tcf(c_458,plain,
! [X0: $i] : add(multiplicative_identity,X0) = multiplicative_identity,
inference(superposition,[status(thm)],[c_440,c_60]) ).
tcf(c_570,plain,
! [X0: $i] : add(X0,X0) = add(X0,additive_identity),
inference(superposition,[status(thm)],[c_67,c_425]) ).
tcf(c_583,plain,
! [X0: $i] : add(X0,X0) = X0,
inference(light_normalisation,[status(thm)],[c_570,c_64]) ).
tcf(c_597,plain,
! [X0: $i,X1: $i] : add(X0,multiply(X0,X1)) = multiply(X0,add(X0,X1)),
inference(superposition,[status(thm)],[c_583,c_62]) ).
tcf(c_658,plain,
! [X0: $i,X1: $i] : add(X0,multiply(X0,X1)) = add(X0,multiply(X1,additive_identity)),
inference(demodulation,[status(thm)],[c_186,c_61,c_597]) ).
tcf(c_762,plain,
! [X0: $i] : multiply(a,add(b,X0)) = multiply(a,X0),
inference(demodulation,[status(thm)],[c_201,c_159]) ).
tcf(c_765,plain,
multiply(a,b) = multiply(a,additive_identity),
inference(superposition,[status(thm)],[c_64,c_762]) ).
tcf(c_766,plain,
multiply(a,inverse(b)) = multiply(a,multiplicative_identity),
inference(superposition,[status(thm)],[c_66,c_762]) ).
tcf(c_777,plain,
multiply(a,additive_identity) = additive_identity,
inference(light_normalisation,[status(thm)],[c_765,c_69]) ).
tcf(c_812,plain,
! [X0: $i] : add(X0,multiply(X0,a)) = add(X0,additive_identity),
inference(superposition,[status(thm)],[c_777,c_658]) ).
tcf(c_814,plain,
! [X0: $i] : add(X0,multiply(X0,a)) = X0,
inference(light_normalisation,[status(thm)],[c_812,c_64]) ).
tcf(c_831,plain,
! [X0: $i] : add(X0,multiply(a,X0)) = X0,
inference(superposition,[status(thm)],[c_61,c_814]) ).
tcf(c_939,plain,
multiply(a,inverse(b)) = a,
inference(demodulation,[status(thm)],[c_766,c_65]) ).
tcf(c_942,plain,
add(inverse(b),a) = inverse(b),
inference(superposition,[status(thm)],[c_939,c_831]) ).
tcf(c_945,plain,
inverse(b) = a,
inference(demodulation,[status(thm)],[c_942,c_60,c_277]) ).
tcf(c_950,plain,
add(b,inverse(a)) = b,
inference(superposition,[status(thm)],[c_945,c_442]) ).
tcf(c_978,plain,
! [X0: $i,X1: $i] : add(X0,multiply(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_205,c_65,c_458]) ).
tcf(c_1007,plain,
! [X0: $i] : multiply(additive_identity,X0) = additive_identity,
inference(superposition,[status(thm)],[c_978,c_159]) ).
tcf(c_1014,plain,
! [X0: $i,X1: $i] : multiply(X0,add(X0,X1)) = add(X0,additive_identity),
inference(demodulation,[status(thm)],[c_180,c_1007]) ).
tcf(c_1015,plain,
! [X0: $i,X1: $i] : multiply(X0,add(X0,X1)) = X0,
inference(light_normalisation,[status(thm)],[c_1014,c_64,c_597]) ).
tcf(c_1166,plain,
! [X0: $i,X1: $i] : multiply(X0,add(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_60,c_1015]) ).
tcf(c_1237,plain,
! [X0: $i,X1: $i] : multiply(X0,add(inverse(X0),X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_206,c_159]) ).
tcf(c_1244,plain,
! [X0: $i] : multiply(X0,inverse(inverse(X0))) = multiply(X0,multiplicative_identity),
inference(superposition,[status(thm)],[c_66,c_1237]) ).
tcf(c_1267,plain,
! [X0: $i] : multiply(X0,inverse(inverse(X0))) = X0,
inference(light_normalisation,[status(thm)],[c_1244,c_65]) ).
tcf(c_1332,plain,
multiply(inverse(a),b) = inverse(a),
inference(superposition,[status(thm)],[c_950,c_1166]) ).
tcf(c_1383,plain,
multiply(b,inverse(a)) = b,
inference(superposition,[status(thm)],[c_945,c_1267]) ).
tcf(c_1449,plain,
inverse(a) = b,
inference(demodulation,[status(thm)],[c_1332,c_61,c_1383]) ).
tcf(c_1450,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1449,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO013-4 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n006.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 06:31:46 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 0.87/1.17 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.87/1.17 % SZS status Started for theBenchmark.p
% 0.87/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.87/1.17
% 0.87/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.87/1.17
% 0.87/1.17 % ------ iProver source info
% 0.87/1.17
% 0.87/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 0.87/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.87/1.17 % git: non_committed_changes: false
% 0.87/1.17
% 0.87/1.17 % ------ Parsing...% successful
% 0.87/1.17
% 0.87/1.17
% 0.87/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.87/1.17
% 0.87/1.17 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.87/1.17
% 0.87/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.87/1.17
% 0.87/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.87/1.17 % ------ Proving...
% 0.87/1.17 % ------ Problem Properties
% 0.87/1.17
% 0.87/1.17 %
% 0.87/1.17 % clauses 11
% 0.87/1.17 % conjectures 1
% 0.87/1.17 % EPR 0
% 0.87/1.17 % Horn 11
% 0.87/1.17 % unary 11
% 0.87/1.17 % binary 0
% 0.87/1.17 % lits 11
% 0.87/1.17 % lits eq 11
% 0.87/1.17 % fd_pure 0
% 0.87/1.17 % fd_pseudo 0
% 0.87/1.17 % fd_cond 0
% 0.87/1.17 % fd_pseudo_cond 0
% 0.87/1.17 % AC symbols 0
% 0.87/1.17
% 0.87/1.17 % ------ Input Options Time Limit: Unbounded
% 0.87/1.17
% 0.87/1.17
% 0.87/1.17 % ------
% 0.87/1.17 % Current options:
% 0.87/1.17 % ------
% 0.87/1.17
% 0.87/1.17
% 0.87/1.17 %
% 0.87/1.17
% 0.87/1.17 % ------ Proving...
% 0.87/1.17 %
% 0.87/1.17
% 0.87/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.87/1.17
% 0.87/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.87/1.17
% 0.87/1.17
%------------------------------------------------------------------------------