%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG019-7 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.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 2.91s 1.28s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 9 ( 9 ~; 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 : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn 45 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute1) ).
fof(f14,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/RNG003-0.ax',associator) ).
fof(f22,axiom,
! [X0,X1] : multiply(additive_inverse(X0),X1) = additive_inverse(multiply(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_product1) ).
fof(f23,plain,
! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(additive_inverse(X0),X1),
inference(reorient_equations,[],[f22]) ).
fof(f24,axiom,
! [X0,X1] : multiply(X0,additive_inverse(X1)) = additive_inverse(multiply(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_product2) ).
fof(f25,plain,
! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1)),
inference(reorient_equations,[],[f24]) ).
fof(f28,axiom,
! [X2,X0,X1] : multiply(additive_inverse(X0),add(X1,X2)) = add(additive_inverse(multiply(X0,X1)),additive_inverse(multiply(X0,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity_of_difference3) ).
fof(f30,negated_conjecture,
associator(x,y,add(u,v)) != add(associator(x,y,u),associator(x,y,v)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_linearised_form1) ).
fof(f31,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,[],[f30,f18,f18,f18]) ).
tcf(c_79,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_81,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(cnf_transformation,[],[f14]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(cnf_transformation,[],[f15]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] : additive_inverse(multiply(X0,X1)) = multiply(additive_inverse(X0),X1),
inference(cnf_transformation,[],[f23]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i] : additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1)),
inference(cnf_transformation,[],[f25]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] : add(additive_inverse(multiply(X0,X1)),additive_inverse(multiply(X0,X2))) = multiply(additive_inverse(X0),add(X1,X2)),
inference(cnf_transformation,[],[f28]) ).
tcf(c_92,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,[],[f31]) ).
tcf(c_111,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_92,c_82,c_81]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i] : multiply(additive_inverse(X0),X1) = multiply(X0,additive_inverse(X1)),
inference(light_normalisation,[status(thm)],[c_86,c_87]) ).
tcf(c_155,plain,
! [X0: $i,X1: $i,X2: $i] : add(multiply(X0,additive_inverse(X1)),additive_inverse(multiply(X0,X2))) = multiply(additive_inverse(X0),add(X1,X2)),
inference(light_normalisation,[status(thm)],[c_90,c_87]) ).
tcf(c_156,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,add(additive_inverse(X1),additive_inverse(X2))) = multiply(X0,additive_inverse(add(X1,X2))),
inference(demodulation,[status(thm)],[c_155,c_87,c_79,c_152]) ).
tcf(c_157,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_111,c_79,c_82,c_81]) ).
tcf(c_158,plain,
add(multiply(x,multiply(y,additive_inverse(u))),add(multiply(x,multiply(y,additive_inverse(v))),multiply(multiply(x,y),add(u,v)))) != add(multiply(multiply(x,y),add(u,v)),multiply(x,multiply(y,additive_inverse(add(u,v))))),
inference(demodulation,[status(thm)],[c_157,c_87]) ).
tcf(c_159,plain,
add(multiply(multiply(x,y),add(u,v)),multiply(x,add(multiply(y,additive_inverse(u)),multiply(y,additive_inverse(v))))) != add(multiply(multiply(x,y),add(u,v)),multiply(x,multiply(y,additive_inverse(add(u,v))))),
inference(ac_demodulation,[status(thm)],[c_158,c_79,c_82,c_81]) ).
tcf(c_160,plain,
add(multiply(multiply(x,y),add(u,v)),multiply(x,multiply(y,add(additive_inverse(u),additive_inverse(v))))) != add(multiply(multiply(x,y),add(u,v)),multiply(x,multiply(y,additive_inverse(add(u,v))))),
inference(ac_demodulation,[status(thm)],[c_159,c_79,c_82,c_81]) ).
tcf(c_161,plain,
add(multiply(multiply(x,y),add(u,v)),multiply(x,multiply(y,additive_inverse(add(u,v))))) != add(multiply(multiply(x,y),add(u,v)),multiply(x,multiply(y,additive_inverse(add(u,v))))),
inference(demodulation,[status(thm)],[c_160,c_156]) ).
tcf(c_162,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG019-7 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 07:46:13 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 2.91/1.28 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.91/1.28 % SZS status Started for theBenchmark.p
% 2.91/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.91/1.28
% 2.91/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.91/1.28
% 2.91/1.28 % ------ iProver source info
% 2.91/1.28
% 2.91/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.91/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.91/1.28 % git: non_committed_changes: false
% 2.91/1.28
% 2.91/1.28 % ------ Parsing...% successful
% 2.91/1.28
% 2.91/1.28
% 2.91/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.91/1.28
% 2.91/1.28 % ------ Preprocessing...%
% 2.91/1.28
% 2.91/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.91/1.28
% 2.91/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.91/1.28
% 2.91/1.28
%------------------------------------------------------------------------------