%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM560+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n005.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:26:01 PM UTC 2026
% Result : Theorem 2.72s 16.29s
% Output : CNFRefutation 2.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 9 unt; 1 def)
% Number of atoms : 96 ( 14 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 101 ( 32 ~; 18 |; 40 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 15 !; 5 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f68,conjecture,
( ( ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( sdtlpdtrp0(xF,X0) = xy
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) )
=> ( aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
| ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
=> aElementOf0(X0,szDzozmdt0(xF)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f69,negated_conjecture,
~ ( ( ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( sdtlpdtrp0(xF,X0) = xy
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) )
=> ( aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
| ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
=> aElementOf0(X0,szDzozmdt0(xF)) ) ) ),
inference(negated_conjecture,[status(cth)],[f68]) ).
fof(f77,plain,
~ ( ( ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( sdtlpdtrp0(xF,X0) = xy
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) )
=> ( aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
| ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
=> aElementOf0(X1,szDzozmdt0(xF)) ) ) ),
inference(rectify,[],[f69]) ).
fof(f168,plain,
( ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( sdtlpdtrp0(xF,X0) = xy
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy))
& ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
& ~ aElementOf0(X1,szDzozmdt0(xF)) ) ),
inference(ennf_transformation,[],[f77]) ).
fof(f169,plain,
( ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( sdtlpdtrp0(xF,X0) = xy
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy))
& ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
& ~ aElementOf0(X1,szDzozmdt0(xF)) ) ),
inference(flattening,[],[f168]) ).
fof(f226,plain,
( ! [X0] :
( ( ~ aElementOf0(X0,sdtlbdtrb0(xF,xy))
| ( sdtlpdtrp0(xF,X0) = xy
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& ( xy != sdtlpdtrp0(xF,X0)
| ~ aElementOf0(X0,szDzozmdt0(xF))
| aElementOf0(X0,sdtlbdtrb0(xF,xy)) ) )
& aSet0(sdtlbdtrb0(xF,xy))
& ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
& ~ aElementOf0(X1,szDzozmdt0(xF)) ) ),
inference(nnf_transformation,[],[f169]) ).
fof(f227,plain,
( ! [X0] :
( ( ~ aElementOf0(X0,sdtlbdtrb0(xF,xy))
| ( sdtlpdtrp0(xF,X0) = xy
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& ( xy != sdtlpdtrp0(xF,X0)
| ~ aElementOf0(X0,szDzozmdt0(xF))
| aElementOf0(X0,sdtlbdtrb0(xF,xy)) ) )
& aSet0(sdtlbdtrb0(xF,xy))
& ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
& ~ aElementOf0(X1,szDzozmdt0(xF)) ) ),
inference(flattening,[],[f226]) ).
fof(f228,plain,
( ! [X1] :
( ( ~ aElementOf0(X1,sdtlbdtrb0(xF,xy))
| ( xy = sdtlpdtrp0(xF,X1)
& aElementOf0(X1,szDzozmdt0(xF)) ) )
& ( xy != sdtlpdtrp0(xF,X1)
| ~ aElementOf0(X1,szDzozmdt0(xF))
| aElementOf0(X1,sdtlbdtrb0(xF,xy)) ) )
& aSet0(sdtlbdtrb0(xF,xy))
& ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
& ~ aElementOf0(X0,szDzozmdt0(xF)) ) ),
inference(rectify,[],[f227]) ).
fof(f229,plain,
( ! [X1] :
( ( ~ aElementOf0(X1,sdtlbdtrb0(xF,xy))
| ( xy = sdtlpdtrp0(xF,X1)
& aElementOf0(X1,szDzozmdt0(xF)) ) )
& ( xy != sdtlpdtrp0(xF,X1)
| ~ aElementOf0(X1,szDzozmdt0(xF))
| aElementOf0(X1,sdtlbdtrb0(xF,xy)) ) )
& aSet0(sdtlbdtrb0(xF,xy))
& ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& aElementOf0(sK17,sdtlbdtrb0(xF,xy))
& ~ aElementOf0(sK17,szDzozmdt0(xF)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17]),skolemize(X0,sK17)],[f228]) ).
fof(f355,plain,
! [X1] :
( ~ aElementOf0(X1,sdtlbdtrb0(xF,xy))
| aElementOf0(X1,szDzozmdt0(xF)) ),
inference(cnf_transformation,[],[f229]) ).
fof(f359,plain,
aElementOf0(sK17,sdtlbdtrb0(xF,xy)),
inference(cnf_transformation,[],[f229]) ).
fof(f360,plain,
~ aElementOf0(sK17,szDzozmdt0(xF)),
inference(cnf_transformation,[],[f229]) ).
tcf(c_173,negated_conjecture,
~ aElementOf0(sK17,szDzozmdt0(xF)),
inference(cnf_transformation,[],[f360]) ).
tcf(c_174,negated_conjecture,
aElementOf0(sK17,sdtlbdtrb0(xF,xy)),
inference(cnf_transformation,[],[f359]) ).
tcf(c_178,negated_conjecture,
! [X0: $i] :
( aElementOf0(X0,szDzozmdt0(xF))
| ~ aElementOf0(X0,sdtlbdtrb0(xF,xy)) ),
inference(cnf_transformation,[],[f355]) ).
tcf(c_12165,definition,
iPr_def_11 = szDzozmdt0(xF),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_12167,negated_conjecture,
! [X0: $i] :
( aElementOf0(X0,iPr_def_11)
| ~ aElementOf0(X0,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_178,c_12165]) ).
tcf(c_12171,negated_conjecture,
aElementOf0(sK17,iPr_def_10),
inference(demodulation,[status(thm)],[c_174]) ).
tcf(c_12172,negated_conjecture,
~ aElementOf0(sK17,iPr_def_11),
inference(demodulation,[status(thm)],[c_173]) ).
tcf(c_14210,plain,
aElementOf0(sK17,iPr_def_11),
inference(superposition,[status(thm)],[c_12171,c_12167]) ).
tcf(c_14211,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_14210,c_12172]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM560+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/15.38 % Computer : n005.cluster.edu
% 0.11/15.38 % Model : x86_64 x86_64
% 0.11/15.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.38 % Memory : 8046.5625MB
% 0.11/15.38 % OS : Linux 6.8.0-71-generic
% 0.11/15.38 % CPULimit : 300
% 0.11/15.38 % WCLimit : 300
% 0.11/15.38 % DateTime : Thu Sep 24 04:38:18 UTC 2026
% 0.11/15.38 % CPUTime :
% 0.11/15.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/15.42 Running first-order theorem proving
% 0.14/15.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/15.43
% 0.14/15.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/15.43
% 0.14/15.43 % Detected problem language: tptp
% 0.14/15.44 % Proving...
% 2.72/16.29 % SZS status Started for theBenchmark.p
% 2.72/16.29 % SZS status Theorem for theBenchmark.p
% 2.72/16.29
% 2.72/16.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.72/16.29
% 2.72/16.29 % ------ iProver source info
% 2.72/16.29
% 2.72/16.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.72/16.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.72/16.29 % git: non_committed_changes: false
% 2.72/16.29
% 2.72/16.29 % ------ Parsing...
% 2.72/16.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.72/16.29
% 2.72/16.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 2.72/16.29
% 2.72/16.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.72/16.29
% 2.72/16.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.72/16.29 % ------ Proving...
% 2.72/16.29 % ------ Problem Properties
% 2.72/16.29
% 2.72/16.29 %
% 2.72/16.29 % clauses 130
% 2.72/16.29 % conjectures 7
% 2.72/16.29 % EPR 35
% 2.72/16.29 % Horn 97
% 2.72/16.29 % unary 17
% 2.72/16.29 % binary 21
% 2.72/16.29 % lits 442
% 2.72/16.29 % lits eq 67
% 2.72/16.29 % fd_pure 0
% 2.72/16.29 % fd_pseudo 0
% 2.72/16.29 % fd_cond 10
% 2.72/16.29 % fd_pseudo_cond 21
% 2.72/16.29 % AC symbols 0
% 2.72/16.29
% 2.72/16.29 % ------ Schedule dynamic 5 is on
% 2.72/16.29
% 2.72/16.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.72/16.29
% 2.72/16.29
% 2.72/16.29 % ------
% 2.72/16.29 % Current options:
% 2.72/16.29 % ------
% 2.72/16.29
% 2.72/16.29
% 2.72/16.29 %
% 2.72/16.29
% 2.72/16.29 % ------ Proving...
% 2.72/16.29 %
% 2.72/16.29
% 2.72/16.29 % SZS status Theorem for theBenchmark.p
% 2.72/16.29
% 2.72/16.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.72/16.29
% 2.72/16.29
%------------------------------------------------------------------------------