%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG014-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:11 PM UTC 2026
% Result : Unsatisfiable 2.24s 1.29s
% Output : CNFRefutation 2.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 34 unt; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 51 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : add(additive_identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_additive_identity) ).
fof(f2,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
fof(f5,axiom,
! [X0] : multiply(X0,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_multiplicative_zero) ).
fof(f6,plain,
! [X0] : additive_identity = multiply(X0,additive_identity),
inference(reorient_equations,[],[f5]) ).
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(f20,negated_conjecture,
multiply(a,additive_inverse(b)) != additive_inverse(multiply(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
tcf(c_65,plain,
! [X0: $i] : add(additive_identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_66,plain,
! [X0: $i] : add(X0,additive_identity) = X0,
inference(cnf_transformation,[],[f2]) ).
tcf(c_68,plain,
! [X0: $i] : multiply(X0,additive_identity) = additive_identity,
inference(cnf_transformation,[],[f6]) ).
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,
additive_inverse(multiply(a,b)) != multiply(a,additive_inverse(b)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_213,plain,
additive_inverse(additive_identity) = additive_identity,
inference(superposition,[status(thm)],[c_70,c_65]) ).
tcf(c_243,plain,
! [X0: $i,X1: $i] : add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_70,c_75]) ).
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_272,plain,
! [X0: $i,X1: $i] : add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_243,c_65]) ).
tcf(c_313,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_272]) ).
tcf(c_394,plain,
! [X0: $i,X1: $i] : add(X0,additive_inverse(add(additive_inverse(X1),X0))) = X1,
inference(demodulation,[status(thm)],[c_313,c_66]) ).
tcf(c_405,plain,
! [X0: $i,X1: $i] : add(X0,additive_inverse(add(X1,X0))) = additive_inverse(X1),
inference(superposition,[status(thm)],[c_71,c_394]) ).
tcf(c_525,plain,
! [X0: $i,X1: $i,X2: $i] : add(multiply(X0,X1),additive_inverse(multiply(X0,add(X2,X1)))) = additive_inverse(multiply(X0,X2)),
inference(superposition,[status(thm)],[c_72,c_405]) ).
tcf(c_648,plain,
! [X0: $i,X1: $i] : add(multiply(X0,additive_inverse(X1)),additive_inverse(multiply(X0,additive_identity))) = additive_inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_70,c_525]) ).
tcf(c_675,plain,
! [X0: $i,X1: $i] : add(multiply(X0,additive_inverse(X1)),additive_identity) = additive_inverse(multiply(X0,X1)),
inference(light_normalisation,[status(thm)],[c_648,c_68,c_213]) ).
tcf(c_676,plain,
! [X0: $i,X1: $i] : add(additive_identity,multiply(X0,additive_inverse(X1))) = additive_inverse(multiply(X0,X1)),
inference(theory_normalisation,[status(thm)],[c_675,c_75,c_74]) ).
tcf(c_726,plain,
! [X0: $i,X1: $i] : additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1)),
inference(demodulation,[status(thm)],[c_676,c_65]) ).
tcf(c_727,plain,
multiply(a,additive_inverse(b)) != multiply(a,additive_inverse(b)),
inference(demodulation,[status(thm)],[c_78,c_726]) ).
tcf(c_729,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_727]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG014-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n013.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:45:06 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running UEQ theorem proving
% 0.10/0.41 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.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 2.24/1.29 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.24/1.29 % SZS status Started for theBenchmark.p
% 2.24/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.24/1.29
% 2.24/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.24/1.29
% 2.24/1.29 % ------ iProver source info
% 2.24/1.29
% 2.24/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.24/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.24/1.29 % git: non_committed_changes: false
% 2.24/1.29
% 2.24/1.29 % ------ Parsing...% successful
% 2.24/1.29
% 2.24/1.29
% 2.24/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.24/1.29
% 2.24/1.29 % ------ Preprocessing... sup_sim: 0 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.24/1.29
% 2.24/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.24/1.29
% 2.24/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.24/1.29 % ------ Proving...
% 2.24/1.29 % ------ Problem Properties
% 2.24/1.29
% 2.24/1.29 %
% 2.24/1.29 % clauses 13
% 2.24/1.29 % conjectures 1
% 2.24/1.29 % EPR 0
% 2.24/1.29 % Horn 13
% 2.24/1.29 % unary 13
% 2.24/1.29 % binary 0
% 2.24/1.29 % lits 13
% 2.24/1.29 % lits eq 13
% 2.24/1.29 % fd_pure 0
% 2.24/1.29 % fd_pseudo 0
% 2.24/1.29 % fd_cond 0
% 2.24/1.29 % fd_pseudo_cond 0
% 2.24/1.29 % AC symbols 1
% 2.24/1.29
% 2.24/1.29 % ------ Input Options Time Limit: Unbounded
% 2.24/1.29
% 2.24/1.29
% 2.24/1.29 % ------
% 2.24/1.29 % Current options:
% 2.24/1.29 % ------
% 2.24/1.29
% 2.24/1.29
% 2.24/1.29 %
% 2.24/1.29
% 2.24/1.29 % ------ Proving...
% 2.24/1.29 %
% 2.24/1.29
% 2.24/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.24/1.29
% 2.24/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.24/1.29
% 2.24/1.29
%------------------------------------------------------------------------------