%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG128-1 : TPTP v9.3.1. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n008.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:39:15 PM UTC 2026
% Result : Unsatisfiable 1.30s 1.29s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 41 unt; 0 def)
% Number of atoms : 41 ( 40 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 : 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 59 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : add(X0,add(X1,X2)) = add(add(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(f2,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_001) ).
fof(f3,axiom,
! [X0,X1] : mult(X0,X1) = mult(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_002) ).
fof(f4,axiom,
! [X2,X0,X1] : mult(X0,add(X1,X2)) = add(mult(X0,X1),mult(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_003) ).
fof(f5,axiom,
! [X0] : add(zero,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_004) ).
fof(f6,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_005) ).
fof(f7,axiom,
! [X0] : add(unit,add(X0,mult(X0,X0))) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_006) ).
fof(f8,negated_conjecture,
add(x0,x1) != mult(x0,x1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(cnf_transformation,[],[f2]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : mult(X0,X1) = mult(X1,X0),
inference(cnf_transformation,[],[f3]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] : add(mult(X0,X1),mult(X0,X2)) = mult(X0,add(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_61,plain,
! [X0: $i] : add(zero,X0) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_62,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_63,plain,
! [X0: $i] : add(unit,add(X0,mult(X0,X0))) = X0,
inference(cnf_transformation,[],[f7]) ).
tcf(c_64,negated_conjecture,
add(x0,x1) != mult(x0,x1),
inference(cnf_transformation,[],[f8]) ).
tcf(c_133,plain,
! [X0: $i,X1: $i,X2: $i] : add(X0,add(X1,X2)) = add(X1,add(X0,X2)),
inference(superposition,[status(thm)],[c_57,c_58]) ).
tcf(c_136,plain,
! [X0: $i] : add(X0,zero) = X0,
inference(superposition,[status(thm)],[c_61,c_58]) ).
tcf(c_153,plain,
add(unit,mult(zero,zero)) = zero,
inference(superposition,[status(thm)],[c_61,c_63]) ).
tcf(c_186,plain,
! [X0: $i,X1: $i] : add(X0,mult(X0,X1)) = mult(X0,add(unit,X1)),
inference(superposition,[status(thm)],[c_62,c_60]) ).
tcf(c_214,plain,
! [X0: $i] : add(unit,add(X0,mult(zero,zero))) = add(X0,zero),
inference(superposition,[status(thm)],[c_153,c_133]) ).
tcf(c_215,plain,
! [X0: $i] : add(unit,add(X0,mult(zero,zero))) = X0,
inference(light_normalisation,[status(thm)],[c_214,c_136]) ).
tcf(c_247,plain,
! [X0: $i] : add(unit,mult(zero,add(X0,zero))) = mult(zero,X0),
inference(superposition,[status(thm)],[c_60,c_215]) ).
tcf(c_256,plain,
! [X0: $i] : add(unit,mult(zero,X0)) = mult(zero,X0),
inference(light_normalisation,[status(thm)],[c_247,c_136]) ).
tcf(c_258,plain,
mult(zero,zero) = zero,
inference(demodulation,[status(thm)],[c_153,c_256]) ).
tcf(c_259,plain,
! [X0: $i] : add(unit,add(X0,zero)) = X0,
inference(demodulation,[status(thm)],[c_215,c_258]) ).
tcf(c_260,plain,
! [X0: $i] : add(unit,X0) = X0,
inference(light_normalisation,[status(thm)],[c_259,c_136]) ).
tcf(c_263,plain,
! [X0: $i] : add(X0,mult(X0,X0)) = X0,
inference(demodulation,[status(thm)],[c_63,c_260]) ).
tcf(c_323,plain,
! [X0: $i,X1: $i] : add(X0,mult(X0,X1)) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_186,c_260]) ).
tcf(c_324,plain,
! [X0: $i] : mult(X0,X0) = X0,
inference(demodulation,[status(thm)],[c_263,c_323]) ).
tcf(c_328,plain,
! [X0: $i] : add(X0,X0) = X0,
inference(superposition,[status(thm)],[c_62,c_323]) ).
tcf(c_346,plain,
! [X0: $i,X1: $i] : add(X0,add(X0,X1)) = add(X0,X1),
inference(superposition,[status(thm)],[c_328,c_57]) ).
tcf(c_392,plain,
! [X0: $i,X1: $i] : add(X0,mult(X0,X1)) = mult(X0,add(X0,X1)),
inference(superposition,[status(thm)],[c_324,c_60]) ).
tcf(c_394,plain,
! [X0: $i,X1: $i] : add(mult(X0,X1),X0) = mult(X0,add(X1,X0)),
inference(superposition,[status(thm)],[c_324,c_60]) ).
tcf(c_395,plain,
! [X0: $i,X1: $i] : add(X0,mult(X0,X1)) = mult(X0,add(X1,X0)),
inference(theory_normalisation,[status(thm)],[c_394,c_57,c_58]) ).
tcf(c_396,plain,
! [X0: $i,X1: $i] : mult(X0,add(X1,X0)) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_395,c_323]) ).
tcf(c_397,plain,
! [X0: $i,X1: $i] : mult(X0,add(X0,X1)) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_392,c_323]) ).
tcf(c_447,plain,
! [X0: $i,X1: $i] : mult(add(X0,X1),add(X0,X1)) = mult(add(X0,X1),X0),
inference(superposition,[status(thm)],[c_346,c_396]) ).
tcf(c_1378,plain,
! [X0: $i,X1: $i] : add(X0,X1) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_447,c_59,c_324,c_397]) ).
tcf(c_1398,plain,
add(x0,x1) != add(x0,x1),
inference(demodulation,[status(thm)],[c_64,c_1378]) ).
tcf(c_1399,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1398]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG128-1 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 08:23:26 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running UEQ theorem proving
% 0.11/0.41 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 1.30/1.29 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.30/1.29 % SZS status Started for theBenchmark.p
% 1.30/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.30/1.29
% 1.30/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.30/1.29
% 1.30/1.29 % ------ iProver source info
% 1.30/1.29
% 1.30/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.30/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.30/1.29 % git: non_committed_changes: false
% 1.30/1.29
% 1.30/1.29 % ------ Parsing...% successful
% 1.30/1.29
% 1.30/1.29
% 1.30/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.30/1.29
% 1.30/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.30/1.29
% 1.30/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.30/1.29
% 1.30/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.30/1.29 % ------ Proving...
% 1.30/1.29 % ------ Problem Properties
% 1.30/1.29
% 1.30/1.29 %
% 1.30/1.29 % clauses 8
% 1.30/1.29 % conjectures 1
% 1.30/1.29 % EPR 0
% 1.30/1.29 % Horn 8
% 1.30/1.29 % unary 8
% 1.30/1.29 % binary 0
% 1.30/1.29 % lits 8
% 1.30/1.29 % lits eq 8
% 1.30/1.29 % fd_pure 0
% 1.30/1.29 % fd_pseudo 0
% 1.30/1.29 % fd_cond 0
% 1.30/1.29 % fd_pseudo_cond 0
% 1.30/1.29 % AC symbols 1
% 1.30/1.29
% 1.30/1.29 % ------ Input Options Time Limit: Unbounded
% 1.30/1.29
% 1.30/1.29
% 1.30/1.29 % ------
% 1.30/1.29 % Current options:
% 1.30/1.29 % ------
% 1.30/1.29
% 1.30/1.29
% 1.30/1.29 %
% 1.30/1.29
% 1.30/1.29 % ------ Proving...
% 1.30/1.29 %
% 1.30/1.29
% 1.30/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.30/1.29
% 1.30/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.30/1.29
% 1.30/1.29
%------------------------------------------------------------------------------