%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG019-6 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.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 02:38:12 PM UTC 2026
% Result : Unsatisfiable 3.34s 1.27s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 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 : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 57 ( 0 sgn 57 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
fof(f9,axiom,
! [X0] : add(X0,additive_inverse(X0)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_inverse) ).
fof(f10,plain,
! [X0] : additive_identity = add(X0,additive_inverse(X0)),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
! [X0] : additive_inverse(additive_inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',additive_inverse_additive_inverse) ).
fof(f12,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute1) ).
fof(f14,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).
fof(f15,axiom,
! [X2,X0,X1] : add(X0,add(X1,X2)) = add(add(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).
fof(f18,axiom,
! [X2,X0,X1] : associator(X0,X1,X2) = add(multiply(multiply(X0,X1),X2),additive_inverse(multiply(X0,multiply(X1,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associator) ).
fof(f20,negated_conjecture,
associator(x,y,add(u,v)) != add(associator(x,y,u),associator(x,y,v)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_linearised_form1) ).
fof(f21,plain,
add(multiply(multiply(x,y),add(u,v)),additive_inverse(multiply(x,multiply(y,add(u,v))))) != add(add(multiply(multiply(x,y),u),additive_inverse(multiply(x,multiply(y,u)))),add(multiply(multiply(x,y),v),additive_inverse(multiply(x,multiply(y,v))))),
inference(definition_unfolding,[],[f20,f18,f18,f18]) ).
tcf(c_66,plain,
! [X0: $i] : add(X0,additive_identity) = X0,
inference(cnf_transformation,[],[f2]) ).
tcf(c_70,plain,
! [X0: $i] : add(X0,additive_inverse(X0)) = additive_identity,
inference(cnf_transformation,[],[f10]) ).
tcf(c_71,plain,
! [X0: $i] : additive_inverse(additive_inverse(X0)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] : add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X1,X2)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(cnf_transformation,[],[f14]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(cnf_transformation,[],[f15]) ).
tcf(c_78,negated_conjecture,
add(add(multiply(multiply(x,y),u),additive_inverse(multiply(x,multiply(y,u)))),add(multiply(multiply(x,y),v),additive_inverse(multiply(x,multiply(y,v))))) != add(multiply(multiply(x,y),add(u,v)),additive_inverse(multiply(x,multiply(y,add(u,v))))),
inference(cnf_transformation,[],[f21]) ).
tcf(c_90,negated_conjecture,
add(multiply(multiply(x,y),u),add(multiply(multiply(x,y),v),add(additive_inverse(multiply(x,multiply(y,u))),additive_inverse(multiply(x,multiply(y,v)))))) != add(multiply(multiply(x,y),add(u,v)),additive_inverse(multiply(x,multiply(y,add(u,v))))),
inference(theory_normalisation,[status(thm)],[c_78,c_75,c_74]) ).
tcf(c_117,plain,
add(additive_inverse(multiply(x,multiply(y,u))),add(additive_inverse(multiply(x,multiply(y,v))),multiply(multiply(x,y),add(u,v)))) != add(multiply(multiply(x,y),add(u,v)),additive_inverse(multiply(x,multiply(y,add(u,v))))),
inference(ac_demodulation,[status(thm)],[c_90,c_72,c_75,c_74]) ).
tcf(c_212,plain,
! [X0: $i,X1: $i,X2: $i] : add(X0,add(X1,X2)) = add(X1,add(X0,X2)),
inference(superposition,[status(thm)],[c_75,c_74]) ).
tcf(c_227,plain,
! [X0: $i,X1: $i] : add(X0,add(X1,additive_inverse(X0))) = add(X1,additive_identity),
inference(superposition,[status(thm)],[c_70,c_212]) ).
tcf(c_246,plain,
! [X0: $i,X1: $i] : add(X0,add(X1,additive_inverse(add(X0,X1)))) = additive_identity,
inference(superposition,[status(thm)],[c_75,c_70]) ).
tcf(c_270,plain,
! [X0: $i,X1: $i] : add(X0,add(X1,additive_inverse(X0))) = X1,
inference(demodulation,[status(thm)],[c_227,c_66]) ).
tcf(c_280,plain,
! [X0: $i,X1: $i] : add(additive_inverse(X0),add(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_71,c_270]) ).
tcf(c_291,plain,
! [X0: $i,X1: $i] : add(X0,add(additive_inverse(X0),X1)) = X1,
inference(theory_normalisation,[status(thm)],[c_280,c_75,c_74]) ).
tcf(c_352,plain,
! [X0: $i,X1: $i] : add(X0,additive_inverse(add(additive_inverse(X1),X0))) = add(X1,additive_identity),
inference(superposition,[status(thm)],[c_246,c_291]) ).
tcf(c_420,plain,
! [X0: $i,X1: $i,X2: $i] : add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X2,X1)),
inference(superposition,[status(thm)],[c_72,c_74]) ).
tcf(c_519,plain,
! [X0: $i,X1: $i] : add(X0,additive_inverse(add(additive_inverse(X1),X0))) = X1,
inference(demodulation,[status(thm)],[c_352,c_66]) ).
tcf(c_524,plain,
! [X0: $i,X1: $i] : add(X0,additive_inverse(add(X0,additive_inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_74,c_519]) ).
tcf(c_597,plain,
! [X0: $i,X1: $i] : add(X0,additive_inverse(add(X0,X1))) = additive_inverse(X1),
inference(superposition,[status(thm)],[c_71,c_524]) ).
tcf(c_715,plain,
! [X0: $i,X1: $i] : additive_inverse(add(additive_inverse(X0),X1)) = add(X0,additive_inverse(X1)),
inference(superposition,[status(thm)],[c_597,c_291]) ).
tcf(c_792,plain,
! [X0: $i,X1: $i] : add(additive_inverse(X0),additive_inverse(X1)) = additive_inverse(add(X0,X1)),
inference(superposition,[status(thm)],[c_71,c_715]) ).
tcf(c_944,plain,
! [X0: $i,X1: $i,X2: $i] : add(additive_inverse(X0),add(additive_inverse(X1),X2)) = add(additive_inverse(add(X0,X1)),X2),
inference(superposition,[status(thm)],[c_792,c_75]) ).
tcf(c_965,plain,
add(additive_inverse(add(multiply(x,multiply(y,u)),multiply(x,multiply(y,v)))),multiply(multiply(x,y),add(u,v))) != add(multiply(multiply(x,y),add(u,v)),additive_inverse(multiply(x,multiply(y,add(u,v))))),
inference(demodulation,[status(thm)],[c_117,c_944]) ).
tcf(c_966,plain,
add(multiply(multiply(x,y),add(u,v)),additive_inverse(add(multiply(x,multiply(y,u)),multiply(x,multiply(y,v))))) != add(multiply(multiply(x,y),add(u,v)),additive_inverse(multiply(x,multiply(y,add(u,v))))),
inference(theory_normalisation,[status(thm)],[c_965,c_75,c_74]) ).
tcf(c_967,plain,
$false,
inference(ground_joinability,[status(thm)],[c_966,c_420]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG019-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n013.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 : Thu Sep 24 07:45:22 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40 Running UEQ theorem proving
% 0.08/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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.42 % Proving...
% 3.34/1.27 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.34/1.27 % SZS status Started for theBenchmark.p
% 3.34/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.34/1.27
% 3.34/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.34/1.27
% 3.34/1.27 % ------ iProver source info
% 3.34/1.27
% 3.34/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.34/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.34/1.27 % git: non_committed_changes: false
% 3.34/1.27
% 3.34/1.27 % ------ Parsing...% successful
% 3.34/1.27
% 3.34/1.27
% 3.34/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.34/1.27
% 3.34/1.27 % ------ Preprocessing... sup_sim: 1 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 %
% 3.34/1.27
% 3.34/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.34/1.27
% 3.34/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.34/1.27 % ------ Proving...
% 3.34/1.27 % ------ Problem Properties
% 3.34/1.27
% 3.34/1.27 %
% 3.34/1.27 % clauses 13
% 3.34/1.27 % conjectures 0
% 3.34/1.27 % EPR 0
% 3.34/1.27 % Horn 13
% 3.34/1.27 % unary 13
% 3.34/1.27 % binary 0
% 3.34/1.27 % lits 13
% 3.34/1.27 % lits eq 13
% 3.34/1.27 % fd_pure 0
% 3.34/1.27 % fd_pseudo 0
% 3.34/1.27 % fd_cond 0
% 3.34/1.27 % fd_pseudo_cond 0
% 3.34/1.27 % AC symbols 1
% 3.34/1.27
% 3.34/1.27 % ------ Input Options Time Limit: Unbounded
% 3.34/1.27
% 3.34/1.27
% 3.34/1.27 % ------
% 3.34/1.27 % Current options:
% 3.34/1.27 % ------
% 3.34/1.27
% 3.34/1.27
% 3.34/1.27 %
% 3.34/1.27
% 3.34/1.27 % ------ Proving...
% 3.34/1.27 %
% 3.34/1.27
% 3.34/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.34/1.27
% 3.34/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.34/1.27
% 3.34/1.27
%------------------------------------------------------------------------------