%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM578+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:06 PM UTC 2026
% Result : Theorem 3.68s 1.21s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f229ERROR: Could not build tree for root c_618ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f84,axiom,
( aElementOf0(xj,szNzAzT0)
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3856) ).
fof(f85,axiom,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3856_02) ).
fof(f208,plain,
( xi = xj
| sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ),
inference(ennf_transformation,[],[f85]) ).
fof(f209,plain,
( xi = xj
| sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ),
inference(flattening,[],[f208]) ).
fof(f311,plain,
! [X0,X1] :
( ~ sP12(X0,X1)
| ( ! [X5] :
( ~ aElementOf0(X5,sdtlpdtrp0(xN,X1))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X5) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,X1))
& sP11(X0,X1)
& aSubsetOf0(sdtlpdtrp0(xN,X1),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& ! [X4] :
( ~ aElementOf0(X4,sdtlpdtrp0(xN,X1))
| aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) )
& sP10(X0)
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,X0))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X0)),X2) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X0)),sdtlpdtrp0(xN,X0)) ) ),
inference(nnf_transformation,[],[f228]) ).
fof(f312,plain,
! [X0,X1] :
( ~ sP12(X0,X1)
| ( ! [X4] :
( ~ aElementOf0(X4,sdtlpdtrp0(xN,X1))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X4) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,X1))
& sP11(X0,X1)
& aSubsetOf0(sdtlpdtrp0(xN,X1),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& ! [X3] :
( ~ aElementOf0(X3,sdtlpdtrp0(xN,X1))
| aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) )
& sP10(X0)
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,X0))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X0)),X2) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X0)),sdtlpdtrp0(xN,X0)) ) ),
inference(rectify,[],[f311]) ).
fof(f319,plain,
( ! [X2,X3] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X2),X3)
| sP12(X2,X3) )
& xi != xj
& szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj))
& ! [X1] :
( ~ aElementOf0(X1,sdtlpdtrp0(xN,xj))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X0) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(rectify,[],[f229]) ).
fof(f544,plain,
aElementOf0(xj,szNzAzT0),
inference(cnf_transformation,[],[f84]) ).
fof(f545,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f84]) ).
fof(f546,plain,
( xi = xj
| sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ),
inference(cnf_transformation,[],[f209]) ).
fof(f549,plain,
! [X0,X1] :
( ~ sP12(X0,X1)
| szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,X1)) ),
inference(cnf_transformation,[],[f312]) ).
fof(f563,plain,
! [X2,X3] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X2),X3)
| sP12(X2,X3) ),
inference(cnf_transformation,[],[f319]) ).
fof(f564,plain,
xi != xj,
inference(cnf_transformation,[],[f319]) ).
fof(f565,plain,
szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
inference(cnf_transformation,[],[f319]) ).
tcf(c_273,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f545]) ).
tcf(c_274,plain,
aElementOf0(xj,szNzAzT0),
inference(cnf_transformation,[],[f544]) ).
tcf(c_275,plain,
( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj)
| ( xi = xj ) ),
inference(cnf_transformation,[],[f546]) ).
tcf(c_283,plain,
! [X0: $i,X1: $i] :
( ~ sP12(X0,X1)
| ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ),
inference(cnf_transformation,[],[f549]) ).
tcf(c_296,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
inference(cnf_transformation,[],[f565]) ).
tcf(c_297,negated_conjecture,
xi != xj,
inference(cnf_transformation,[],[f564]) ).
tcf(c_298,negated_conjecture,
! [X0: $i,X1: $i] :
( sP12(X0,X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X0),X1) ),
inference(cnf_transformation,[],[f563]) ).
tcf(c_403,plain,
( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(global_subsumption_just,[status(thm)],[c_275,c_297,c_275]) ).
tcf(c_425,plain,
! [X0: $i] :
( ~ sP12(xj,X0)
| ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ),
inference(superposition,[status(thm)],[c_296,c_283]) ).
tcf(c_426,plain,
! [X0: $i] :
( ~ sP12(X0,xj)
| ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ),
inference(superposition,[status(thm)],[c_296,c_283]) ).
tcf(c_449,plain,
( sP12(xj,xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj)
| ~ aElementOf0(xj,szNzAzT0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(superposition,[status(thm)],[c_403,c_298]) ).
tcf(c_587,plain,
~ sP12(xi,xj),
inference(equality_resolution,[status(thm)],[c_426]) ).
tcf(c_593,plain,
~ sP12(xj,xi),
inference(equality_resolution,[status(thm)],[c_425]) ).
tcf(c_614,plain,
sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(global_subsumption_just,[status(thm)],[c_449,c_274,c_273,c_449,c_593]) ).
tcf(c_617,plain,
( sP12(xi,xj)
| ~ aElementOf0(xj,szNzAzT0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(superposition,[status(thm)],[c_614,c_298]) ).
tcf(c_618,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_617,c_587,c_273,c_274]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM578+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.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 04:44:18 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 3.68/1.21 % SZS status Started for theBenchmark.p
% 3.68/1.21 % SZS status Theorem for theBenchmark.p
% 3.68/1.21
% 3.68/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.68/1.21
% 3.68/1.21 % ------ iProver source info
% 3.68/1.21
% 3.68/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 3.68/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.68/1.21 % git: non_committed_changes: false
% 3.68/1.21
% 3.68/1.21 % ------ Parsing...
% 3.68/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.68/1.21 % ------ Proving...
% 3.68/1.21 % ------ Problem Properties
% 3.68/1.21
% 3.68/1.21 %
% 3.68/1.21 % clauses 250
% 3.68/1.21 % conjectures 7
% 3.68/1.21 % EPR 52
% 3.68/1.21 % Horn 197
% 3.68/1.21 % unary 30
% 3.68/1.21 % binary 62
% 3.68/1.21 % lits 831
% 3.68/1.21 % lits eq 103
% 3.68/1.21 % fd_pure 0
% 3.68/1.21 % fd_pseudo 0
% 3.68/1.21 % fd_cond 10
% 3.68/1.21 % fd_pseudo_cond 31
% 3.68/1.21 % AC symbols 0
% 3.68/1.21
% 3.68/1.21 % ------ Input Options Time Limit: Unbounded
% 3.68/1.21
% 3.68/1.21
% 3.68/1.21 % ------
% 3.68/1.21 % Current options:
% 3.68/1.21 % ------
% 3.68/1.21
% 3.68/1.21
% 3.68/1.21 %
% 3.68/1.21
% 3.68/1.21 % ------ Proving...
% 3.68/1.21 %
% 3.68/1.21
% 3.68/1.21 % SZS status Theorem for theBenchmark.p
% 3.68/1.21
% 3.68/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.21
% 3.68/1.21
%------------------------------------------------------------------------------