%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : DAT020_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 : n001.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:53 PM UTC 2026
% Result : Theorem 0.89s 1.18s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 11 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 33 ( 14 ~; 14 |; 4 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 28 ( 28 fml; 0 var)
% Number arithmetic : 52 ( 0 atm; 0 fun; 39 num; 13 var)
% Number of types : 3 ( 1 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 2 usr; 5 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
empty: collection ).
tff(pred_def_1,type,
in: ( collection * $int ) > $o ).
tff(func_def_2,type,
remove: ( collection * $int ) > collection ).
tff(type_def_5,type,
collection: $tType ).
tff(f1,axiom,
! [X0: $int] : ~ in(X0,empty),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax1) ).
tff(f4,axiom,
! [X0: $int,X1: collection,X2: $int] :
( ( ( X0 = X2 )
| in(X0,X1) )
<=> in(X0,add(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax4) ).
tff(f6,conjecture,
~ in(4,add(1,add(3,add(5,empty)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f7,negated_conjecture,
~ ~ in(4,add(1,add(3,add(5,empty)))),
inference(negated_conjecture,[status(cth)],[f6]) ).
tff(f8,plain,
in(4,add(1,add(3,add(5,empty)))),
inference(flattening,[],[f7]) ).
tff(f9,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( ( ( X0 != X2 )
& ~ in(X0,X1) )
| in(X0,add(X2,X1)) )
& ( ~ in(X0,add(X2,X1))
| ( X0 = X2 )
| in(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
tff(f10,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( ( ( X0 != X2 )
& ~ in(X0,X1) )
| in(X0,add(X2,X1)) )
& ( ~ in(X0,add(X2,X1))
| ( X0 = X2 )
| in(X0,X1) ) ),
inference(flattening,[],[f9]) ).
tff(f13,plain,
! [X0: $int] : ~ in(X0,empty),
inference(cnf_transformation,[],[f1]) ).
tff(f18,plain,
! [X2: $int,X0: $int,X1: collection] :
( ~ in(X0,add(X2,X1))
| ( X0 = X2 )
| in(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tff(f22,plain,
in(4,add(1,add(3,add(5,empty)))),
inference(cnf_transformation,[],[f8]) ).
tcf(c_49,plain,
! [X0_int: $int] : ~ in(X0_int,empty),
inference(cnf_transformation,[],[f13]) ).
tcf(c_52,plain,
! [X0_int: $int,X0_collection: collection,X1_int: $int] :
( in(X0_int,X0_collection)
| ( X0_int = X1_int )
| ~ in(X0_int,add(X1_int,X0_collection)) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_58,negated_conjecture,
in(4,add(1,add(3,add(5,empty)))),
inference(cnf_transformation,[],[f22]) ).
tcf(c_307,plain,
( in(4,add(3,add(5,empty)))
| ( 4 = 1 ) ),
inference(superposition,[status(thm)],[c_58,c_52]) ).
tcf(c_310,plain,
in(4,add(3,add(5,empty))),
inference(smt_theory_normalisation,[status(thm)],[c_307]) ).
tcf(c_311,plain,
( in(4,add(5,empty))
| ( 4 = 3 ) ),
inference(superposition,[status(thm)],[c_310,c_52]) ).
tcf(c_322,plain,
in(4,add(5,empty)),
inference(smt_theory_normalisation,[status(thm)],[c_311]) ).
tcf(c_323,plain,
( in(4,empty)
| ( 4 = 5 ) ),
inference(superposition,[status(thm)],[c_322,c_52]) ).
tcf(c_324,plain,
4 = 5,
inference(forward_subsumption_resolution,[status(thm)],[c_323,c_49]) ).
tcf(c_328,plain,
$false,
inference(smt_theory_normalisation,[status(thm)],[c_324]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT020_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.10/0.37 % Computer : n001.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 : Fri Sep 25 10:26:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.41 Running TFA theorem proving
% 0.16/0.41 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.16/0.42
% 0.16/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.42
% 0.16/0.42 % Detected problem language: tptp
% 0.16/0.43 % Proving...
% 0.89/1.18 % SZS status Started for theBenchmark.p
% 0.89/1.18 % SZS status Theorem for theBenchmark.p
% 0.89/1.18
% 0.89/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.89/1.18
% 0.89/1.18 % ------ iProver source info
% 0.89/1.18
% 0.89/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 0.89/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.89/1.18 % git: non_committed_changes: false
% 0.89/1.18
% 0.89/1.18 % ------ Parsing...
% 0.89/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.89/1.18
% 0.89/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 0.89/1.18
% 0.89/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.89/1.18
% 0.89/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.89/1.18 % ------ Proving...
% 0.89/1.18 % ------ Problem Properties
% 0.89/1.18
% 0.89/1.18 %
% 0.89/1.18 % clauses 8
% 0.89/1.18 % conjectures 1
% 0.89/1.18 % EPR 1
% 0.89/1.18 % Horn 6
% 0.89/1.18 % unary 4
% 0.89/1.18 % binary 2
% 0.89/1.18 % lits 14
% 0.89/1.18 % lits eq 2
% 0.89/1.18 % fd_pure 0
% 0.89/1.18 % fd_pseudo 0
% 0.89/1.18 % fd_cond 0
% 0.89/1.18 % fd_pseudo_cond 2
% 0.89/1.18 % AC symbols 0
% 0.89/1.18
% 0.89/1.18 % ------ Input Options Time Limit: Unbounded
% 0.89/1.18
% 0.89/1.18
% 0.89/1.18 % ------
% 0.89/1.18 % Current options:
% 0.89/1.18 % ------
% 0.89/1.18
% 0.89/1.18
% 0.89/1.18 %
% 0.89/1.18
% 0.89/1.18 % ------ Proving...
% 0.89/1.18 %
% 0.89/1.18
% 0.89/1.18 % SZS status Theorem for theBenchmark.p
% 0.89/1.18
% 0.89/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.89/1.18
% 0.89/1.18
%------------------------------------------------------------------------------