%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : DAT058_1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n015.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:56 PM UTC 2026
% Result : Theorem 0.40s 1.16s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 18 ~; 17 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 26 ( 0 atm; 0 fun; 0 num; 26 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 : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 57 ( 0 sgn 54 !; 3 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
mkarray: array ).
tff(func_def_1,type,
none: data ).
tff(func_def_2,type,
put: ( data * ( $int * array ) ) > array ).
tff(func_def_3,type,
get: ( $int * array ) > data ).
tff(func_def_4,type,
sK0: ( array * array ) > $int ).
tff(func_def_5,type,
sK1: $int ).
tff(type_def_6,type,
array: $tType ).
tff(f1,axiom,
! [X0: $int] : ( get(mkarray,X0) = none ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT004_0.ax',ax_17) ).
tff(f2,axiom,
! [X0: array,X1: $int,X2: data] : ( get(put(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT004_0.ax',ax_18) ).
tff(f3,axiom,
! [X0: $int,X1: data,X2: array,X3: $int] :
( ( X3 != X0 )
=> ( get(put(X2,X0,X1),X3) = get(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT004_0.ax',ax_19) ).
tff(f5,axiom,
! [X0: array,X1: array] :
( ( X0 = X1 )
<=> ! [X2: $int] : ( get(X0,X2) = get(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT004_0.ax',ax_21) ).
tff(f6,conjecture,
! [X0: $int] : ( put(mkarray,X0,none) = mkarray ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_lem_2) ).
tff(f7,negated_conjecture,
~ ! [X0: $int] : ( put(mkarray,X0,none) = mkarray ),
inference(negated_conjecture,[status(cth)],[f6]) ).
tff(f8,plain,
! [X0: $int,X1: data,X2: array,X3: $int] :
( ( X0 = X3 )
| ( get(put(X2,X0,X1),X3) = get(X2,X3) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f9,plain,
? [X0: $int] : ( mkarray != put(mkarray,X0,none) ),
inference(ennf_transformation,[],[f7]) ).
tff(f10,plain,
! [X0: array,X1: array] :
( ( ( X0 != X1 )
| ! [X2: $int] : ( get(X0,X2) = get(X1,X2) ) )
& ( ? [X2: $int] : ( get(X0,X2) != get(X1,X2) )
| ( X0 = X1 ) ) ),
inference(nnf_transformation,[],[f5]) ).
tff(f11,plain,
! [X0: array,X1: array] :
( ( ( X0 != X1 )
| ! [X3: $int] : ( get(X0,X3) = get(X1,X3) ) )
& ( ? [X2: $int] : ( get(X0,X2) != get(X1,X2) )
| ( X0 = X1 ) ) ),
inference(rectify,[],[f10]) ).
tff(f12,plain,
! [X0: array,X1: array] :
( ( ( X0 != X1 )
| ! [X3: $int] : ( get(X0,X3) = get(X1,X3) ) )
& ( ( get(X0,sK0(X0,X1)) != get(X1,sK0(X0,X1)) )
| ( X0 = X1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f11]) ).
tff(f13,plain,
mkarray != put(mkarray,sK1,none),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f9]) ).
tff(f14,plain,
! [X0: $int] : ( get(mkarray,X0) = none ),
inference(cnf_transformation,[],[f1]) ).
tff(f15,plain,
! [X2: data,X0: array,X1: $int] : ( get(put(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f2]) ).
tff(f16,plain,
! [X2: array,X3: $int,X0: $int,X1: data] :
( ( X0 = X3 )
| ( get(put(X2,X0,X1),X3) = get(X2,X3) ) ),
inference(cnf_transformation,[],[f8]) ).
tff(f19,plain,
! [X0: array,X1: array] :
( ( get(X0,sK0(X0,X1)) != get(X1,sK0(X0,X1)) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f12]) ).
tff(f20,plain,
mkarray != put(mkarray,sK1,none),
inference(cnf_transformation,[],[f13]) ).
tcf(c_49,plain,
! [X0_int: $int] : get(mkarray,X0_int) = none,
inference(cnf_transformation,[],[f14]) ).
tcf(c_50,plain,
! [X0_int: $int,X0_data: data,X0_array: array] : get(put(X0_array,X0_int,X0_data),X0_int) = X0_data,
inference(cnf_transformation,[],[f15]) ).
tcf(c_51,plain,
! [X0_int: $int,X0_data: data,X0_array: array,X1_int: $int] :
( ( X0_int = X1_int )
| ( get(put(X0_array,X0_int,X0_data),X1_int) = get(X0_array,X1_int) ) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_53,plain,
! [X0_array: array,X1_array: array] :
( ( X0_array = X1_array )
| ( get(X0_array,sK0(X0_array,X1_array)) != get(X1_array,sK0(X0_array,X1_array)) ) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_54,negated_conjecture,
put(mkarray,sK1,none) != mkarray,
inference(cnf_transformation,[],[f20]) ).
tcf(c_56,plain,
get(put(mkarray,sK1,none),sK1) = none,
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_172,plain,
! [X0_array: array] :
( ( X0_array = mkarray )
| ( get(X0_array,sK0(mkarray,X0_array)) != none ) ),
inference(superposition,[status(thm)],[c_49,c_53]) ).
tcf(c_194,plain,
! [X0_int: $int,X0_data: data,X0_array: array] :
( ( put(X0_array,X0_int,X0_data) = mkarray )
| ( sK0(mkarray,put(X0_array,X0_int,X0_data)) = X0_int )
| ( get(X0_array,sK0(mkarray,put(X0_array,X0_int,X0_data))) != none ) ),
inference(superposition,[status(thm)],[c_51,c_172]) ).
tcf(c_262,plain,
! [X0_int: $int,X0_data: data] :
( ( put(mkarray,X0_int,X0_data) = mkarray )
| ( sK0(mkarray,put(mkarray,X0_int,X0_data)) = X0_int ) ),
inference(superposition,[status(thm)],[c_49,c_194]) ).
tcf(c_286,plain,
! [X0_int: $int,X0_data: data] :
( ( put(mkarray,X0_int,X0_data) = mkarray )
| ( get(put(mkarray,X0_int,X0_data),X0_int) != none ) ),
inference(superposition,[status(thm)],[c_262,c_172]) ).
tcf(c_291,plain,
( ( put(mkarray,sK1,none) = mkarray )
| ( get(put(mkarray,sK1,none),sK1) != none ) ),
inference(instantiation,[status(thm)],[c_286]) ).
tcf(c_292,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_291,c_56,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT058_1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 10:26:13 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.39 Running TFA theorem proving
% 0.10/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 0.40/1.16 % SZS status Started for theBenchmark.p
% 0.40/1.16 % SZS status Theorem for theBenchmark.p
% 0.40/1.16
% 0.40/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.40/1.16
% 0.40/1.16 % ------ iProver source info
% 0.40/1.16
% 0.40/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 0.40/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.40/1.16 % git: non_committed_changes: false
% 0.40/1.16
% 0.40/1.16 % ------ Parsing...
% 0.40/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.40/1.16
% 0.40/1.16 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.40/1.16
% 0.40/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.40/1.16
% 0.40/1.16 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.40/1.16 % ------ Proving...
% 0.40/1.16 % ------ Problem Properties
% 0.40/1.16
% 0.40/1.16 %
% 0.40/1.16 % clauses 6
% 0.40/1.16 % conjectures 1
% 0.40/1.16 % EPR 0
% 0.40/1.16 % Horn 5
% 0.40/1.16 % unary 4
% 0.40/1.16 % binary 2
% 0.40/1.16 % lits 8
% 0.40/1.16 % lits eq 8
% 0.40/1.16 % fd_pure 0
% 0.40/1.16 % fd_pseudo 0
% 0.40/1.16 % fd_cond 0
% 0.40/1.16 % fd_pseudo_cond 2
% 0.40/1.16 % AC symbols 0
% 0.40/1.16
% 0.40/1.16 % ------ Input Options Time Limit: Unbounded
% 0.40/1.16
% 0.40/1.16
% 0.40/1.16 % ------
% 0.40/1.16 % Current options:
% 0.40/1.16 % ------
% 0.40/1.16
% 0.40/1.16
% 0.40/1.16 %
% 0.40/1.16
% 0.40/1.16 % ------ Proving...
% 0.40/1.16 %
% 0.40/1.16
% 0.40/1.16 % SZS status Theorem for theBenchmark.p
% 0.40/1.16
% 0.40/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.40/1.16
% 0.40/1.16
%------------------------------------------------------------------------------