%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : DAT003_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n009.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 01:13:52 PM UTC 2026
% Result : Theorem 1.95s 1.25s
% Output : CNFRefutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 5 ~; 11 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number arithmetic : 105 ( 0 atm; 0 fun; 87 num; 18 var)
% Number of types : 2 ( 1 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 4 usr; 9 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn 28 !; 2 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
read: ( $int * array ) > $int ).
tff(func_def_1,type,
write: ( $int * ( $int * array ) ) > array ).
tff(type_def_5,type,
array: $tType ).
tff(func_def_9,type,
sK0: array ).
tff(func_def_10,type,
sK1: array ).
tff(f1,axiom,
! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT001_0.ax',ax1) ).
tff(f2,axiom,
! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT001_0.ax',ax2) ).
tff(f3,conjecture,
! [X0: array,X1: array] :
( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
=> ( read(X0,3) = 33 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f4,negated_conjecture,
~ ! [X0: array,X1: array] :
( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
=> ( read(X0,3) = 33 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
tff(f5,plain,
? [X0: array,X1: array] :
( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
& ( 33 != read(X0,3) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
( ( sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44) )
& ( 33 != read(sK0,3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f5]) ).
tff(f7,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f1]) ).
tff(f8,plain,
! [X2: $int,X3: $int,X0: array,X1: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f2]) ).
tff(f9,plain,
sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44),
inference(cnf_transformation,[],[f6]) ).
tff(f10,plain,
33 != read(sK0,3),
inference(cnf_transformation,[],[f6]) ).
tcf(c_49,plain,
! [X0_int: $int,X0_array: array,X1_int: $int] : read(write(X0_array,X0_int,X1_int),X0_int) = X1_int,
inference(cnf_transformation,[],[f7]) ).
tcf(c_50,plain,
! [X0_int: $int,X0_array: array,X1_int: $int,X2_int: $int] :
( ( X0_int = X2_int )
| ( read(write(X0_array,X0_int,X1_int),X2_int) = read(X0_array,X2_int) ) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_51,negated_conjecture,
read(sK0,3) != 33,
inference(cnf_transformation,[],[f10]) ).
tcf(c_52,negated_conjecture,
write(write(write(write(sK1,3,33),4,444),5,55),4,44) = sK0,
inference(cnf_transformation,[],[f9]) ).
tcf(c_165,plain,
! [X0_int: $int] :
( ( X0_int = 4 )
| ( read(write(write(write(sK1,3,33),4,444),5,55),X0_int) = read(sK0,X0_int) ) ),
inference(superposition,[status(thm)],[c_52,c_50]) ).
tcf(c_177,plain,
! [X0_int: $int] :
( ( X0_int = 5 )
| ( X0_int = 4 )
| ( read(write(write(sK1,3,33),4,444),X0_int) = read(sK0,X0_int) ) ),
inference(superposition,[status(thm)],[c_165,c_50]) ).
tcf(c_194,plain,
! [X0_int: $int] :
( ( X0_int = 5 )
| ( X0_int = 4 )
| ( read(write(sK1,3,33),X0_int) = read(sK0,X0_int) ) ),
inference(superposition,[status(thm)],[c_177,c_50]) ).
tcf(c_207,plain,
( ( 3 = 5 )
| ( 3 = 4 )
| ( read(sK0,3) = 33 ) ),
inference(superposition,[status(thm)],[c_194,c_49]) ).
tcf(c_209,plain,
( ( 3 = 5 )
| ( 3 = 4 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_207,c_51]) ).
tcf(c_216,plain,
$false,
inference(smt_theory_normalisation,[status(thm)],[c_209]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT003_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n009.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 10:19:14 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 Running TFA theorem proving
% 0.11/0.38 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.39
% 0.11/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.39
% 0.11/0.39 % Detected problem language: tptp
% 0.11/0.40 % Proving...
% 1.95/1.25 % SZS status Started for theBenchmark.p
% 1.95/1.25 % SZS status Theorem for theBenchmark.p
% 1.95/1.25
% 1.95/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.95/1.25
% 1.95/1.25 % ------ iProver source info
% 1.95/1.25
% 1.95/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 1.95/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.95/1.25 % git: non_committed_changes: false
% 1.95/1.25
% 1.95/1.25 % ------ Parsing...
% 1.95/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.95/1.25
% 1.95/1.25 % ------ Preprocessing... sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.95/1.25
% 1.95/1.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.95/1.25
% 1.95/1.25 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.95/1.25 % ------ Proving...
% 1.95/1.25 % ------ Problem Properties
% 1.95/1.25
% 1.95/1.25 %
% 1.95/1.25 % clauses 4
% 1.95/1.25 % conjectures 2
% 1.95/1.25 % EPR 0
% 1.95/1.25 % Horn 3
% 1.95/1.25 % unary 3
% 1.95/1.25 % binary 1
% 1.95/1.25 % lits 5
% 1.95/1.25 % lits eq 5
% 1.95/1.25 % fd_pure 0
% 1.95/1.25 % fd_pseudo 0
% 1.95/1.25 % fd_cond 0
% 1.95/1.25 % fd_pseudo_cond 1
% 1.95/1.25 % AC symbols 0
% 1.95/1.25
% 1.95/1.25 % ------ Input Options Time Limit: Unbounded
% 1.95/1.25
% 1.95/1.25
% 1.95/1.25 % ------
% 1.95/1.25 % Current options:
% 1.95/1.25 % ------
% 1.95/1.25
% 1.95/1.25
% 1.95/1.25 %
% 1.95/1.25
% 1.95/1.25 % ------ Proving...
% 1.95/1.25 %
% 1.95/1.25
% 1.95/1.25 % SZS status Theorem for theBenchmark.p
% 1.95/1.25
% 1.95/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.95/1.25
% 1.95/1.25
%------------------------------------------------------------------------------