%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : DAT004_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 : 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 01:13:52 PM UTC 2026
% Result : Theorem 2.06s 1.27s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 11 ~; 11 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 121 ( 0 atm; 0 fun; 100 num; 21 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 : 12 ( 5 usr; 10 con; 0-3 aty)
% Number of variables : 35 ( 0 sgn 29 !; 6 ?; 35 :)
% 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(func_def_11,type,
sK2: $int ).
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,X2: $int] :
( ( X0 = write(write(write(write(X1,3,33),4,44),5,55),X2,66) )
=> ( ( read(X0,4) = 66 )
| ( read(X0,4) = 44 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f4,negated_conjecture,
~ ! [X0: array,X1: array,X2: $int] :
( ( X0 = write(write(write(write(X1,3,33),4,44),5,55),X2,66) )
=> ( ( read(X0,4) = 66 )
| ( read(X0,4) = 44 ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
tff(f5,plain,
? [X0: array,X1: array,X2: $int] :
( ( X0 = write(write(write(write(X1,3,33),4,44),5,55),X2,66) )
& ( 66 != read(X0,4) )
& ( 44 != read(X0,4) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
? [X0: array,X1: array,X2: $int] :
( ( X0 = write(write(write(write(X1,3,33),4,44),5,55),X2,66) )
& ( 66 != read(X0,4) )
& ( 44 != read(X0,4) ) ),
inference(flattening,[],[f5]) ).
tff(f7,plain,
( ( sK0 = write(write(write(write(sK1,3,33),4,44),5,55),sK2,66) )
& ( 66 != read(sK0,4) )
& ( 44 != read(sK0,4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).
tff(f8,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f1]) ).
tff(f9,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(f10,plain,
sK0 = write(write(write(write(sK1,3,33),4,44),5,55),sK2,66),
inference(cnf_transformation,[],[f7]) ).
tff(f11,plain,
66 != read(sK0,4),
inference(cnf_transformation,[],[f7]) ).
tff(f12,plain,
44 != read(sK0,4),
inference(cnf_transformation,[],[f7]) ).
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,[],[f8]) ).
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,[],[f9]) ).
tcf(c_51,negated_conjecture,
read(sK0,4) != 44,
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,negated_conjecture,
read(sK0,4) != 66,
inference(cnf_transformation,[],[f11]) ).
tcf(c_53,negated_conjecture,
write(write(write(write(sK1,3,33),4,44),5,55),sK2,66) = sK0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_168,plain,
read(sK0,sK2) = 66,
inference(superposition,[status(thm)],[c_53,c_49]) ).
tcf(c_172,plain,
! [X0_int: $int] :
( ( X0_int = sK2 )
| ( read(write(write(write(sK1,3,33),4,44),5,55),X0_int) = read(sK0,X0_int) ) ),
inference(superposition,[status(thm)],[c_53,c_50]) ).
tcf(c_184,plain,
! [X0_int: $int] :
( ( X0_int = 5 )
| ( X0_int = sK2 )
| ( read(write(write(sK1,3,33),4,44),X0_int) = read(sK0,X0_int) ) ),
inference(superposition,[status(thm)],[c_172,c_50]) ).
tcf(c_203,plain,
( ( 4 = 5 )
| ( sK2 = 4 )
| ( read(sK0,4) = 44 ) ),
inference(superposition,[status(thm)],[c_184,c_49]) ).
tcf(c_205,plain,
( ( 4 = 5 )
| ( sK2 = 4 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_203,c_51]) ).
tcf(c_212,plain,
sK2 = 4,
inference(smt_theory_normalisation,[status(thm)],[c_205]) ).
tcf(c_216,plain,
read(sK0,4) = 66,
inference(demodulation,[status(thm)],[c_168,c_212]) ).
tcf(c_218,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_216,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT004_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.36 % Computer : n008.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.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 10:20:09 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.39 Running TFA theorem proving
% 0.14/0.39 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 2.06/1.27 % SZS status Started for theBenchmark.p
% 2.06/1.27 % SZS status Theorem for theBenchmark.p
% 2.06/1.27
% 2.06/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.06/1.27
% 2.06/1.27 % ------ iProver source info
% 2.06/1.27
% 2.06/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 2.06/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.06/1.27 % git: non_committed_changes: false
% 2.06/1.27
% 2.06/1.27 % ------ Parsing...
% 2.06/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.06/1.27
% 2.06/1.27 % ------ 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 %
% 2.06/1.27
% 2.06/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.06/1.27
% 2.06/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.06/1.27 % ------ Proving...
% 2.06/1.27 % ------ Problem Properties
% 2.06/1.27
% 2.06/1.27 %
% 2.06/1.27 % clauses 5
% 2.06/1.27 % conjectures 3
% 2.06/1.27 % EPR 0
% 2.06/1.27 % Horn 4
% 2.06/1.27 % unary 4
% 2.06/1.27 % binary 1
% 2.06/1.27 % lits 6
% 2.06/1.27 % lits eq 6
% 2.06/1.27 % fd_pure 0
% 2.06/1.27 % fd_pseudo 0
% 2.06/1.27 % fd_cond 0
% 2.06/1.27 % fd_pseudo_cond 1
% 2.06/1.27 % AC symbols 0
% 2.06/1.27
% 2.06/1.27 % ------ Input Options Time Limit: Unbounded
% 2.06/1.27
% 2.06/1.27
% 2.06/1.27 % ------
% 2.06/1.27 % Current options:
% 2.06/1.27 % ------
% 2.06/1.27
% 2.06/1.27
% 2.06/1.27 %
% 2.06/1.27
% 2.06/1.27 % ------ Proving...
% 2.06/1.27 %
% 2.06/1.27
% 2.06/1.27 % SZS status Theorem for theBenchmark.p
% 2.06/1.27
% 2.06/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.06/1.27
% 2.06/1.27
%------------------------------------------------------------------------------