%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM565+3 : 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 : n020.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:02 PM UTC 2026
% Result : Theorem 2.88s 6.30s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 97 ( 38 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 102 ( 31 ~; 15 |; 44 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 20 !; 6 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f78,axiom,
xK = sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3462) ).
fof(f80,conjecture,
! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sbrdtbr0(X0) = sz00
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X1] : aElementOf0(X1,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f81,negated_conjecture,
~ ! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sbrdtbr0(X0) = sz00
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X1] : aElementOf0(X1,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
inference(negated_conjecture,[status(cth)],[f80]) ).
fof(f85,plain,
~ ! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sbrdtbr0(X0) = sz00
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X2] : aElementOf0(X2,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
inference(rectify,[],[f81]) ).
fof(f102,plain,
? [X0] :
( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sbrdtbr0(X0) = sz00
& aSubsetOf0(X0,xS)
& ! [X1] :
( ~ aElementOf0(X1,X0)
| aElementOf0(X1,xS) )
& aSet0(X0)
& ! [X2] : ~ aElementOf0(X2,slcrc0)
& aSet0(slcrc0)
& sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0) ),
inference(ennf_transformation,[],[f85]) ).
fof(f103,plain,
? [X0] :
( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sbrdtbr0(X0) = sz00
& aSubsetOf0(X0,xS)
& ! [X1] :
( ~ aElementOf0(X1,X0)
| aElementOf0(X1,xS) )
& aSet0(X0)
& ! [X2] : ~ aElementOf0(X2,slcrc0)
& aSet0(slcrc0)
& sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0) ),
inference(flattening,[],[f102]) ).
fof(f124,plain,
! [X0] :
( ~ aSet0(X0)
| ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f180,plain,
? [X0] :
( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sbrdtbr0(X0) = sz00
& aSubsetOf0(X0,xS)
& ! [X2] :
( ~ aElementOf0(X2,X0)
| aElementOf0(X2,xS) )
& aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0) ),
inference(rectify,[],[f103]) ).
fof(f181,plain,
( aElementOf0(sK14,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(sK14)
& aSubsetOf0(sK14,xS)
& ! [X2] :
( ~ aElementOf0(X2,sK14)
| aElementOf0(X2,xS) )
& aSet0(sK14)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK14) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X0,sK14)],[f180]) ).
fof(f191,plain,
! [X0] :
( ~ aSet0(X0)
| ( ( sz00 != sbrdtbr0(X0)
| X0 = slcrc0 )
& ( slcrc0 != X0
| sbrdtbr0(X0) = sz00 ) ) ),
inference(nnf_transformation,[],[f124]) ).
fof(f258,plain,
sz00 = xK,
inference(cnf_transformation,[],[f78]) ).
fof(f265,plain,
sz00 = sbrdtbr0(sK14),
inference(cnf_transformation,[],[f181]) ).
fof(f268,plain,
aSet0(sK14),
inference(cnf_transformation,[],[f181]) ).
fof(f271,plain,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK14),
inference(cnf_transformation,[],[f181]) ).
fof(f295,plain,
! [X0] :
( ~ aSet0(X0)
| sz00 != sbrdtbr0(X0)
| slcrc0 = X0 ),
inference(cnf_transformation,[],[f191]) ).
fof(f340,plain,
xK = sbrdtbr0(sK14),
inference(definition_unfolding,[],[f265,f258]) ).
fof(f344,plain,
! [X0] :
( ~ aSet0(X0)
| sbrdtbr0(X0) != xK
| slcrc0 = X0 ),
inference(definition_unfolding,[],[f295,f258]) ).
tcf(c_107,negated_conjecture,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK14),
inference(cnf_transformation,[],[f271]) ).
tcf(c_110,negated_conjecture,
aSet0(sK14),
inference(cnf_transformation,[],[f268]) ).
tcf(c_113,negated_conjecture,
sbrdtbr0(sK14) = xK,
inference(cnf_transformation,[],[f340]) ).
tcf(c_139,plain,
! [X0: $i] :
( ( X0 = slcrc0 )
| ~ aSet0(X0)
| ( sbrdtbr0(X0) != xK ) ),
inference(cnf_transformation,[],[f344]) ).
tcf(c_5099,plain,
( ( slcrc0 = sK14 )
| ~ aSet0(sK14) ),
inference(superposition,[status(thm)],[c_113,c_139]) ).
tcf(c_5102,plain,
slcrc0 = sK14,
inference(forward_subsumption_resolution,[status(thm)],[c_5099,c_110]) ).
tcf(c_5114,plain,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,slcrc0),
inference(demodulation,[status(thm)],[c_107,c_5102]) ).
tcf(c_5119,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_5114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM565+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n020.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 04:40:24 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/5.42 Running first-order theorem proving
% 0.13/5.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.13/5.43
% 0.13/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.43
% 0.13/5.43 % Detected problem language: tptp
% 0.13/5.45 % Proving...
% 2.88/6.30 % SZS status Started for theBenchmark.p
% 2.88/6.30 % SZS status Theorem for theBenchmark.p
% 2.88/6.30
% 2.88/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.88/6.30
% 2.88/6.30 % ------ iProver source info
% 2.88/6.30
% 2.88/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.88/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.88/6.30 % git: non_committed_changes: false
% 2.88/6.30
% 2.88/6.30 % ------ Parsing...
% 2.88/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.88/6.30
% 2.88/6.30 % ------ Preprocessing... sup_sim: 2 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 2.88/6.30
% 2.88/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.88/6.30
% 2.88/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.88/6.30 % ------ Proving...
% 2.88/6.30 % ------ Problem Properties
% 2.88/6.30
% 2.88/6.30 %
% 2.88/6.30 % clauses 93
% 2.88/6.30 % conjectures 7
% 2.88/6.30 % EPR 28
% 2.88/6.30 % Horn 78
% 2.88/6.30 % unary 24
% 2.88/6.30 % binary 18
% 2.88/6.30 % lits 273
% 2.88/6.30 % lits eq 40
% 2.88/6.30 % fd_pure 0
% 2.88/6.30 % fd_pseudo 0
% 2.88/6.30 % fd_cond 5
% 2.88/6.30 % fd_pseudo_cond 9
% 2.88/6.30 % AC symbols 0
% 2.88/6.30
% 2.88/6.30 % ------ Schedule dynamic 5 is on
% 2.88/6.30
% 2.88/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.88/6.30
% 2.88/6.30
% 2.88/6.30 % ------
% 2.88/6.30 % Current options:
% 2.88/6.30 % ------
% 2.88/6.30
% 2.88/6.30
% 2.88/6.30 %
% 2.88/6.30
% 2.88/6.30 % ------ Proving...
% 2.88/6.30 %
% 2.88/6.30
% 2.88/6.30 % SZS status Theorem for theBenchmark.p
% 2.88/6.30
% 2.88/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.88/6.30
% 2.88/6.30
%------------------------------------------------------------------------------