%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG007-4 : 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 : 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 02:38:09 PM UTC 2026
% Result : Unsatisfiable 0.73s 1.27s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : add(additive_inverse(X0),X0) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',left_additive_inverse) ).
fof(f3,plain,
! [X0] : additive_identity = add(additive_inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f8,axiom,
! [X0] : additive_inverse(additive_inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',additive_inverse_additive_inverse) ).
fof(f14,axiom,
! [X0,X1] : multiply(X0,additive_inverse(X1)) = additive_inverse(multiply(X0,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse1) ).
fof(f15,axiom,
! [X0,X1] : multiply(additive_inverse(X0),X1) = additive_inverse(multiply(X0,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse2) ).
fof(f16,plain,
! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(additive_inverse(X0),X1),
inference(reorient_equations,[],[f15]) ).
fof(f17,axiom,
! [X2,X0,X1] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',associative_addition) ).
fof(f18,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',commutative_addition) ).
fof(f20,axiom,
! [X0] : multiply(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boolean_ring) ).
fof(f21,negated_conjecture,
add(a,a) != additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse) ).
fof(f22,plain,
additive_identity != add(a,a),
inference(reorient_equations,[],[f21]) ).
tcf(c_66,plain,
! [X0: $i] : add(additive_inverse(X0),X0) = additive_identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_70,plain,
! [X0: $i] : additive_inverse(additive_inverse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : multiply(X0,additive_inverse(X1)) = additive_inverse(multiply(X0,X1)),
inference(cnf_transformation,[],[f14]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] : multiply(additive_inverse(X0),X1) = additive_inverse(multiply(X0,X1)),
inference(cnf_transformation,[],[f16]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(cnf_transformation,[],[f17]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(cnf_transformation,[],[f18]) ).
tcf(c_79,plain,
! [X0: $i] : multiply(X0,X0) = X0,
inference(cnf_transformation,[],[f20]) ).
tcf(c_80,negated_conjecture,
add(a,a) != additive_identity,
inference(cnf_transformation,[],[f22]) ).
tcf(c_93,plain,
! [X0: $i] : add(X0,additive_inverse(X0)) = additive_identity,
inference(theory_normalisation,[status(thm)],[c_66,c_76,c_77]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i] : multiply(additive_inverse(X0),X1) = multiply(X0,additive_inverse(X1)),
inference(demodulation,[status(thm)],[c_75,c_74]) ).
tcf(c_235,plain,
! [X0: $i] : multiply(X0,additive_inverse(additive_inverse(X0))) = additive_inverse(X0),
inference(superposition,[status(thm)],[c_127,c_79]) ).
tcf(c_239,plain,
! [X0: $i] : additive_inverse(X0) = X0,
inference(light_normalisation,[status(thm)],[c_235,c_79,c_70]) ).
tcf(c_243,plain,
! [X0: $i] : add(X0,X0) = additive_identity,
inference(demodulation,[status(thm)],[c_93,c_239]) ).
tcf(c_246,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_80,c_243]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG007-4 : TPTP v9.3.1. Released v1.0.0.
% 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.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 07:38:02 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running UEQ theorem proving
% 0.09/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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 0.73/1.27 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.73/1.27 % SZS status Started for theBenchmark.p
% 0.73/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 0.73/1.27
% 0.73/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.73/1.27
% 0.73/1.27 % ------ iProver source info
% 0.73/1.27
% 0.73/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 0.73/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.73/1.27 % git: non_committed_changes: false
% 0.73/1.27
% 0.73/1.27 % ------ Parsing...% successful
% 0.73/1.27
% 0.73/1.27
% 0.73/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.73/1.27
% 0.73/1.27 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.73/1.27
% 0.73/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.73/1.27
% 0.73/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.73/1.27 % ------ Proving...
% 0.73/1.27 % ------ Problem Properties
% 0.73/1.27
% 0.73/1.27 %
% 0.73/1.27 % clauses 16
% 0.73/1.27 % conjectures 1
% 0.73/1.27 % EPR 0
% 0.73/1.27 % Horn 16
% 0.73/1.27 % unary 16
% 0.73/1.27 % binary 0
% 0.73/1.27 % lits 16
% 0.73/1.27 % lits eq 16
% 0.73/1.27 % fd_pure 0
% 0.73/1.27 % fd_pseudo 0
% 0.73/1.27 % fd_cond 0
% 0.73/1.27 % fd_pseudo_cond 0
% 0.73/1.27 % AC symbols 1
% 0.73/1.27
% 0.73/1.27 % ------ Input Options Time Limit: Unbounded
% 0.73/1.27
% 0.73/1.27
% 0.73/1.27 % ------
% 0.73/1.27 % Current options:
% 0.73/1.27 % ------
% 0.73/1.27
% 0.73/1.27
% 0.73/1.27 %
% 0.73/1.27
% 0.73/1.27 % ------ Proving...
% 0.73/1.27 %
% 0.73/1.27
% 0.73/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 0.73/1.27
% 0.73/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.27
% 0.73/1.27
%------------------------------------------------------------------------------