%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM533+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 : n002.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:25:52 PM UTC 2026
% Result : Theorem 1.90s 11.52s
% Output : CNFRefutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 89 ( 27 ~; 17 |; 33 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 26 ( 0 sgn 23 !; 3 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,conjecture,
( ( aSubsetOf0(xB,xC)
& ! [X0] :
( aElementOf0(X0,xB)
=> aElementOf0(X0,xC) )
& aSubsetOf0(xA,xB)
& ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xB) ) )
=> ( aSubsetOf0(xA,xC)
| ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xC) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f16,negated_conjecture,
~ ( ( aSubsetOf0(xB,xC)
& ! [X0] :
( aElementOf0(X0,xB)
=> aElementOf0(X0,xC) )
& aSubsetOf0(xA,xB)
& ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xB) ) )
=> ( aSubsetOf0(xA,xC)
| ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xC) ) ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f21,plain,
~ ( ( aSubsetOf0(xB,xC)
& ! [X1] :
( aElementOf0(X1,xB)
=> aElementOf0(X1,xC) )
& aSubsetOf0(xA,xB)
& ! [X0] :
( aElementOf0(X0,xA)
=> aElementOf0(X0,xB) ) )
=> ( aSubsetOf0(xA,xC)
| ! [X2] :
( aElementOf0(X2,xA)
=> aElementOf0(X2,xC) ) ) ),
inference(rectify,[],[f16]) ).
fof(f32,plain,
( aSubsetOf0(xB,xC)
& ! [X1] :
( ~ aElementOf0(X1,xB)
| aElementOf0(X1,xC) )
& aSubsetOf0(xA,xB)
& ! [X0] :
( ~ aElementOf0(X0,xA)
| aElementOf0(X0,xB) )
& ~ aSubsetOf0(xA,xC)
& ? [X2] :
( aElementOf0(X2,xA)
& ~ aElementOf0(X2,xC) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f33,plain,
( aSubsetOf0(xB,xC)
& ! [X1] :
( ~ aElementOf0(X1,xB)
| aElementOf0(X1,xC) )
& aSubsetOf0(xA,xB)
& ! [X0] :
( ~ aElementOf0(X0,xA)
| aElementOf0(X0,xB) )
& ~ aSubsetOf0(xA,xC)
& ? [X2] :
( aElementOf0(X2,xA)
& ~ aElementOf0(X2,xC) ) ),
inference(flattening,[],[f32]) ).
fof(f42,plain,
( aSubsetOf0(xB,xC)
& ! [X2] :
( ~ aElementOf0(X2,xB)
| aElementOf0(X2,xC) )
& aSubsetOf0(xA,xB)
& ! [X1] :
( ~ aElementOf0(X1,xA)
| aElementOf0(X1,xB) )
& ~ aSubsetOf0(xA,xC)
& ? [X0] :
( aElementOf0(X0,xA)
& ~ aElementOf0(X0,xC) ) ),
inference(rectify,[],[f33]) ).
fof(f43,plain,
( aSubsetOf0(xB,xC)
& ! [X2] :
( ~ aElementOf0(X2,xB)
| aElementOf0(X2,xC) )
& aSubsetOf0(xA,xB)
& ! [X1] :
( ~ aElementOf0(X1,xA)
| aElementOf0(X1,xB) )
& ~ aSubsetOf0(xA,xC)
& aElementOf0(sK2,xA)
& ~ aElementOf0(sK2,xC) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f42]) ).
fof(f59,plain,
! [X2] :
( ~ aElementOf0(X2,xB)
| aElementOf0(X2,xC) ),
inference(cnf_transformation,[],[f43]) ).
fof(f61,plain,
! [X1] :
( ~ aElementOf0(X1,xA)
| aElementOf0(X1,xB) ),
inference(cnf_transformation,[],[f43]) ).
fof(f63,plain,
aElementOf0(sK2,xA),
inference(cnf_transformation,[],[f43]) ).
fof(f64,plain,
~ aElementOf0(sK2,xC),
inference(cnf_transformation,[],[f43]) ).
tcf(c_63,negated_conjecture,
~ aElementOf0(sK2,xC),
inference(cnf_transformation,[],[f64]) ).
tcf(c_64,negated_conjecture,
aElementOf0(sK2,xA),
inference(cnf_transformation,[],[f63]) ).
tcf(c_66,negated_conjecture,
! [X0: $i] :
( aElementOf0(X0,xB)
| ~ aElementOf0(X0,xA) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_68,negated_conjecture,
! [X0: $i] :
( aElementOf0(X0,xC)
| ~ aElementOf0(X0,xB) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_370,negated_conjecture,
! [X0: $i] :
( aElementOf0(X0,xC)
| ~ aElementOf0(X0,xB) ),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_372,negated_conjecture,
! [X0: $i] :
( aElementOf0(X0,xB)
| ~ aElementOf0(X0,xA) ),
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_374,negated_conjecture,
aElementOf0(sK2,xA),
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_375,negated_conjecture,
~ aElementOf0(sK2,xC),
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_604,plain,
aElementOf0(sK2,xB),
inference(superposition,[status(thm)],[c_374,c_372]) ).
tcf(c_605,plain,
aElementOf0(sK2,xC),
inference(superposition,[status(thm)],[c_604,c_370]) ).
tcf(c_606,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_605,c_375]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM533+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.12/10.60 % Computer : n002.cluster.edu
% 0.12/10.60 % Model : x86_64 x86_64
% 0.12/10.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.60 % Memory : 8046.5625MB
% 0.12/10.60 % OS : Linux 6.8.0-71-generic
% 0.12/10.60 % CPULimit : 300
% 0.12/10.60 % WCLimit : 300
% 0.12/10.60 % DateTime : Thu Sep 24 04:32:01 UTC 2026
% 0.12/10.60 % CPUTime :
% 0.12/10.60 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/10.64 Running first-order theorem proving
% 0.12/10.64 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.12/10.66
% 0.12/10.66 % ======== iProver multi-core TPTP/SMT =========
% 0.12/10.66
% 0.12/10.66 % Detected problem language: tptp
% 0.12/10.67 % Proving...
% 1.90/11.52 % SZS status Started for theBenchmark.p
% 1.90/11.52 % SZS status Theorem for theBenchmark.p
% 1.90/11.52
% 1.90/11.52 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.90/11.52
% 1.90/11.52 % ------ iProver source info
% 1.90/11.52
% 1.90/11.52 % git: date: 2026-07-19 20:42:38 +0200
% 1.90/11.52 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.90/11.52 % git: non_committed_changes: false
% 1.90/11.52
% 1.90/11.52 % ------ Parsing...
% 1.90/11.52 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.90/11.52
% 1.90/11.52 % ------ Preprocessing... sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.90/11.52
% 1.90/11.52 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.90/11.52
% 1.90/11.52 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.90/11.52 % ------ Proving...
% 1.90/11.52 % ------ Problem Properties
% 1.90/11.52
% 1.90/11.52 %
% 1.90/11.52 % clauses 19
% 1.90/11.52 % conjectures 7
% 1.90/11.52 % EPR 16
% 1.90/11.52 % Horn 17
% 1.90/11.52 % unary 10
% 1.90/11.52 % binary 3
% 1.90/11.52 % lits 38
% 1.90/11.52 % lits eq 2
% 1.90/11.52 % fd_pure 0
% 1.90/11.52 % fd_pseudo 0
% 1.90/11.52 % fd_cond 1
% 1.90/11.52 % fd_pseudo_cond 1
% 1.90/11.52 % AC symbols 0
% 1.90/11.52
% 1.90/11.52 % ------ Schedule dynamic 5 is on
% 1.90/11.52
% 1.90/11.52 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.90/11.52
% 1.90/11.52
% 1.90/11.52 % ------
% 1.90/11.52 % Current options:
% 1.90/11.52 % ------
% 1.90/11.52
% 1.90/11.52
% 1.90/11.52 %
% 1.90/11.52
% 1.90/11.52 % ------ Proving...
% 1.90/11.52 %
% 1.90/11.52
% 1.90/11.52 % SZS status Theorem for theBenchmark.p
% 1.90/11.52
% 1.90/11.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.90/11.52
% 1.90/11.52
%------------------------------------------------------------------------------