%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : BOO013-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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 2.50s 1.17s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 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 : 3 ( 1 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; 5 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',commutativity_of_add) ).
fof(f3,axiom,
! [X2,X0,X1] : add(multiply(X0,X1),X2) = multiply(add(X0,X2),add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity1) ).
fof(f14,axiom,
! [X0] : multiply(multiplicative_identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',multiplicative_id2) ).
fof(f15,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_id1) ).
fof(f17,axiom,
add(a,b) = multiplicative_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_and_multiplicative_identity) ).
fof(f18,plain,
multiplicative_identity = add(a,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
add(a,c) = multiplicative_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_and_multiplicative_identity) ).
fof(f20,plain,
multiplicative_identity = add(a,c),
inference(reorient_equations,[],[f19]) ).
fof(f21,axiom,
multiply(a,b) = additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_a_additive_identity) ).
fof(f22,plain,
additive_identity = multiply(a,b),
inference(reorient_equations,[],[f21]) ).
fof(f23,axiom,
multiply(a,c) = additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_a_additive_identity) ).
fof(f24,plain,
additive_identity = multiply(a,c),
inference(reorient_equations,[],[f23]) ).
fof(f25,negated_conjecture,
b != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_is_a) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(add(X0,X1),add(X2,X1)) = add(multiply(X0,X2),X1),
inference(cnf_transformation,[],[f3]) ).
tcf(c_79,plain,
! [X0: $i] : multiply(multiplicative_identity,X0) = X0,
inference(cnf_transformation,[],[f14]) ).
tcf(c_80,plain,
! [X0: $i] : add(X0,additive_identity) = X0,
inference(cnf_transformation,[],[f15]) ).
tcf(c_82,plain,
add(a,b) = multiplicative_identity,
inference(cnf_transformation,[],[f18]) ).
tcf(c_83,plain,
add(a,c) = multiplicative_identity,
inference(cnf_transformation,[],[f20]) ).
tcf(c_84,plain,
multiply(a,b) = additive_identity,
inference(cnf_transformation,[],[f22]) ).
tcf(c_85,plain,
multiply(a,c) = additive_identity,
inference(cnf_transformation,[],[f24]) ).
tcf(c_86,negated_conjecture,
b != c,
inference(cnf_transformation,[],[f25]) ).
tcf(c_267,plain,
! [X0: $i] : add(multiply(a,X0),b) = multiply(multiplicative_identity,add(X0,b)),
inference(superposition,[status(thm)],[c_82,c_70]) ).
tcf(c_268,plain,
! [X0: $i] : add(multiply(a,X0),c) = multiply(multiplicative_identity,add(X0,c)),
inference(superposition,[status(thm)],[c_83,c_70]) ).
tcf(c_293,plain,
! [X0: $i] : add(b,multiply(a,X0)) = add(X0,b),
inference(demodulation,[status(thm)],[c_267,c_68,c_79]) ).
tcf(c_295,plain,
add(b,additive_identity) = add(c,b),
inference(superposition,[status(thm)],[c_85,c_293]) ).
tcf(c_310,plain,
add(b,c) = b,
inference(demodulation,[status(thm)],[c_295,c_68,c_80]) ).
tcf(c_354,plain,
! [X0: $i] : add(c,multiply(a,X0)) = add(X0,c),
inference(demodulation,[status(thm)],[c_268,c_68,c_79]) ).
tcf(c_355,plain,
add(b,c) = add(c,additive_identity),
inference(superposition,[status(thm)],[c_84,c_354]) ).
tcf(c_363,plain,
add(c,additive_identity) = b,
inference(light_normalisation,[status(thm)],[c_355,c_310]) ).
tcf(c_367,plain,
b = c,
inference(demodulation,[status(thm)],[c_363,c_80]) ).
tcf(c_368,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_367,c_86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO013-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n017.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 : Fri Sep 25 06:26:46 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running UEQ theorem proving
% 0.13/0.40 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.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.50/1.17 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.50/1.17 % SZS status Started for theBenchmark.p
% 2.50/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.50/1.17
% 2.50/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.50/1.17
% 2.50/1.17 % ------ iProver source info
% 2.50/1.17
% 2.50/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 2.50/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.50/1.17 % git: non_committed_changes: false
% 2.50/1.17
% 2.50/1.17 % ------ Parsing...% successful
% 2.50/1.17
% 2.50/1.17
% 2.50/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.50/1.17
% 2.50/1.17 % ------ Preprocessing... sup_sim: 4 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.50/1.17
% 2.50/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.50/1.17
% 2.50/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.50/1.17 % ------ Proving...
% 2.50/1.17 % ------ Problem Properties
% 2.50/1.17
% 2.50/1.17 %
% 2.50/1.17 % clauses 17
% 2.50/1.17 % conjectures 1
% 2.50/1.17 % EPR 1
% 2.50/1.17 % Horn 17
% 2.50/1.17 % unary 17
% 2.50/1.17 % binary 0
% 2.50/1.17 % lits 17
% 2.50/1.17 % lits eq 17
% 2.50/1.17 % fd_pure 0
% 2.50/1.17 % fd_pseudo 0
% 2.50/1.17 % fd_cond 0
% 2.50/1.17 % fd_pseudo_cond 0
% 2.50/1.17 % AC symbols 0
% 2.50/1.17
% 2.50/1.17 % ------ Input Options Time Limit: Unbounded
% 2.50/1.17
% 2.50/1.17
% 2.50/1.17 % ------
% 2.50/1.17 % Current options:
% 2.50/1.17 % ------
% 2.50/1.17
% 2.50/1.17
% 2.50/1.17 %
% 2.50/1.17
% 2.50/1.17 % ------ Proving...
% 2.50/1.17 %
% 2.50/1.17
% 2.50/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.50/1.17
% 2.50/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.50/1.17
% 2.50/1.17
%------------------------------------------------------------------------------