%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG002-1 : 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 : n016.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:07 PM UTC 2026
% Result : Unsatisfiable 2.91s 1.18s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 26 unt; 0 def)
% Number of atoms : 79 ( 23 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 27 ( 15 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : sum(additive_identity,X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
fof(f6,axiom,
! [X0] : sum(X0,additive_inverse(X0),additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',right_inverse) ).
fof(f8,axiom,
! [X2,X3,X0,X1,X4,X5] :
( sum(X2,X3,X5)
| ~ sum(X0,X4,X5)
| ~ sum(X1,X3,X4)
| ~ sum(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition2) ).
fof(f9,axiom,
! [X2,X0,X1] :
( sum(X1,X0,X2)
| ~ sum(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
fof(f18,axiom,
sum(a,b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_plus_b_is_d) ).
fof(f19,axiom,
sum(a,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_plus_c_is_d) ).
fof(f20,negated_conjecture,
b != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_equals_c) ).
tcf(c_69,plain,
! [X0: $i] : sum(additive_identity,X0,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_74,plain,
! [X0: $i] : sum(X0,additive_inverse(X0),additive_identity),
inference(cnf_transformation,[],[f6]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( sum(X2,X5,X4)
| ~ sum(X1,X5,X3)
| ~ sum(X0,X3,X4)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i,X2: $i] :
( sum(X1,X0,X2)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_86,plain,
sum(a,b,d),
inference(cnf_transformation,[],[f18]) ).
tcf(c_87,plain,
sum(a,c,d),
inference(cnf_transformation,[],[f19]) ).
tcf(c_88,negated_conjecture,
b != c,
inference(cnf_transformation,[],[f20]) ).
tcf(c_96,plain,
add(a,b) = d,
inference(well_definedness,[status(thm)],[c_86]) ).
tcf(c_97,plain,
add(a,c) = d,
inference(well_definedness,[status(thm)],[c_87]) ).
tcf(c_98,plain,
! [X0: $i] : add(additive_identity,X0) = X0,
inference(well_definedness,[status(thm)],[c_69]) ).
tcf(c_103,plain,
! [X0: $i] : add(X0,additive_inverse(X0)) = additive_identity,
inference(well_definedness,[status(thm)],[c_74]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ( add(X2,X5) = X4 )
| ( add(X1,X5) != X3 )
| ( add(X0,X3) != X4 )
| ( add(X0,X1) != X2 ) ),
inference(well_definedness,[status(thm)],[c_76]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( add(X1,X0) = X2 )
| ( add(X0,X1) != X2 ) ),
inference(well_definedness,[status(thm)],[c_77]) ).
tcf(c_239,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(unflattening,[status(thm)],[c_108]) ).
tcf(c_245,plain,
! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(unflattening,[status(thm)],[c_106]) ).
tcf(c_285,negated_conjecture,
b != c,
inference(demodulation,[status(thm)],[c_88]) ).
tcf(c_334,plain,
add(a,b) = add(a,c),
inference(light_normalisation,[status(thm)],[c_97,c_96]) ).
tcf(c_348,plain,
! [X0: $i] : add(add(a,b),X0) = add(a,add(c,X0)),
inference(superposition,[status(thm)],[c_334,c_245]) ).
tcf(c_351,plain,
! [X0: $i,X1: $i] : add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_103,c_245]) ).
tcf(c_354,plain,
! [X0: $i] : add(a,add(b,X0)) = add(a,add(c,X0)),
inference(theory_normalisation,[status(thm)],[c_348,c_245,c_239]) ).
tcf(c_379,plain,
! [X0: $i,X1: $i] : add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_351,c_98]) ).
tcf(c_385,plain,
! [X0: $i,X1: $i] : add(X0,add(X1,additive_inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_239,c_379]) ).
tcf(c_525,plain,
add(a,add(b,additive_inverse(a))) = c,
inference(superposition,[status(thm)],[c_354,c_385]) ).
tcf(c_592,plain,
b = c,
inference(demodulation,[status(thm)],[c_525,c_385]) ).
tcf(c_593,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_592,c_285]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n016.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:27 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 first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_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.44 % Proving...
% 2.91/1.18 % SZS status Started for theBenchmark.p
% 2.91/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.91/1.18
% 2.91/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.91/1.18
% 2.91/1.18 % ------ iProver source info
% 2.91/1.18
% 2.91/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.91/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.91/1.18 % git: non_committed_changes: false
% 2.91/1.18
% 2.91/1.18 % ------ Parsing...% successful
% 2.91/1.18
% 2.91/1.18
% 2.91/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.91/1.18
% 2.91/1.18 % ------ Preprocessing... sup_sim: 15 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.91/1.18
% 2.91/1.18 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 2.91/1.18 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.91/1.18
% 2.91/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.91/1.18 % ------ Proving...
% 2.91/1.18 % ------ Problem Properties
% 2.91/1.18
% 2.91/1.18 %
% 2.91/1.18 % clauses 11
% 2.91/1.18 % conjectures 1
% 2.91/1.18 % EPR 1
% 2.91/1.18 % Horn 11
% 2.91/1.18 % unary 11
% 2.91/1.18 % binary 0
% 2.91/1.18 % lits 11
% 2.91/1.18 % lits eq 11
% 2.91/1.18 % fd_pure 0
% 2.91/1.18 % fd_pseudo 0
% 2.91/1.18 % fd_cond 0
% 2.91/1.18 % fd_pseudo_cond 0
% 2.91/1.18 % AC symbols 1
% 2.91/1.18
% 2.91/1.18 % ------ Schedule UEQ
% 2.91/1.18
% 2.91/1.18 % ------ Option_UEQ Time Limit: 10.
% 2.91/1.18
% 2.91/1.18
% 2.91/1.18 % ------
% 2.91/1.18 % Current options:
% 2.91/1.18 % ------
% 2.91/1.18
% 2.91/1.18
% 2.91/1.18 %
% 2.91/1.18
% 2.91/1.18 % ------ Proving...
% 2.91/1.18 %
% 2.91/1.18
% 2.91/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.91/1.18
% 2.91/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.91/1.18
% 2.91/1.18
%------------------------------------------------------------------------------