%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM620+3 : TPTP v9.3.1. Released v4.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 02:26:16 PM UTC 2026
% Result : Theorem 4.10s 6.20s
% Output : CNFRefutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 50 ( 7 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 45 ( 15 ~; 9 |; 15 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f91,axiom,
( ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,X0))
=> sdtlseqdt0(sdtlpdtrp0(xe,X0),X1) )
& aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4660) ).
fof(f115,axiom,
( xx = sdtlpdtrp0(xe,xm)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5389) ).
fof(f117,conjecture,
( ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xm))
=> aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f118,negated_conjecture,
~ ( ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xm))
=> aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(negated_conjecture,[status(cth)],[f117]) ).
fof(f263,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ( sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0))
& ! [X1] :
( ~ aElementOf0(X1,sdtlpdtrp0(xN,X0))
| sdtlseqdt0(sdtlpdtrp0(xe,X0),X1) )
& aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
inference(ennf_transformation,[],[f91]) ).
fof(f279,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xm))
| aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(ennf_transformation,[],[f118]) ).
fof(f280,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xm))
| aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(flattening,[],[f279]) ).
fof(f817,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ),
inference(cnf_transformation,[],[f263]) ).
fof(f905,plain,
xx = sdtlpdtrp0(xe,xm),
inference(cnf_transformation,[],[f115]) ).
fof(f906,plain,
aElementOf0(xm,szNzAzT0),
inference(cnf_transformation,[],[f115]) ).
fof(f909,plain,
! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xm))
| aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(cnf_transformation,[],[f280]) ).
fof(f910,plain,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(cnf_transformation,[],[f280]) ).
tcf(c_400,plain,
! [X0: $i] :
( aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f817]) ).
tcf(c_488,plain,
aElementOf0(xm,szNzAzT0),
inference(cnf_transformation,[],[f906]) ).
tcf(c_489,plain,
sdtlpdtrp0(xe,xm) = xx,
inference(cnf_transformation,[],[f905]) ).
tcf(c_491,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(cnf_transformation,[],[f910]) ).
tcf(c_492,negated_conjecture,
! [X0: $i] :
( aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xm)) ),
inference(cnf_transformation,[],[f909]) ).
tcf(c_587,plain,
~ aElementOf0(xx,sdtlpdtrp0(xN,xm)),
inference(superposition,[status(thm)],[c_492,c_491]) ).
tcf(c_1434,plain,
( aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(xm,szNzAzT0) ),
inference(superposition,[status(thm)],[c_489,c_400]) ).
tcf(c_1437,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1434,c_587,c_488]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM620+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.37 % Computer : n001.cluster.edu
% 0.11/5.37 % Model : x86_64 x86_64
% 0.11/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37 % Memory : 8046.5625MB
% 0.11/5.37 % OS : Linux 6.8.0-71-generic
% 0.11/5.37 % CPULimit : 300
% 0.11/5.37 % WCLimit : 300
% 0.11/5.37 % DateTime : Thu Sep 24 05:03:27 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.41 Running first-order theorem proving
% 0.15/5.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.42
% 0.15/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.42
% 0.15/5.42 % Detected problem language: tptp
% 0.15/5.43 % Proving...
% 4.10/6.20 % SZS status Started for theBenchmark.p
% 4.10/6.20 % SZS status Theorem for theBenchmark.p
% 4.10/6.20
% 4.10/6.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.10/6.20
% 4.10/6.20 % ------ iProver source info
% 4.10/6.20
% 4.10/6.20 % git: date: 2026-07-19 20:42:38 +0200
% 4.10/6.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.10/6.20 % git: non_committed_changes: false
% 4.10/6.20
% 4.10/6.20 % ------ Parsing...
% 4.10/6.20 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.10/6.20 % ------ Proving...
% 4.10/6.20 % ------ Problem Properties
% 4.10/6.20
% 4.10/6.20 %
% 4.10/6.20 % clauses 445
% 4.10/6.20 % conjectures 3
% 4.10/6.20 % EPR 92
% 4.10/6.20 % Horn 360
% 4.10/6.20 % unary 79
% 4.10/6.20 % binary 129
% 4.10/6.20 % lits 1337
% 4.10/6.20 % lits eq 178
% 4.10/6.20 % fd_pure 0
% 4.10/6.20 % fd_pseudo 0
% 4.10/6.20 % fd_cond 11
% 4.10/6.20 % fd_pseudo_cond 47
% 4.10/6.20 % AC symbols 0
% 4.10/6.20
% 4.10/6.20 % ------ Input Options Time Limit: Unbounded
% 4.10/6.20
% 4.10/6.20
% 4.10/6.20 % ------
% 4.10/6.20 % Current options:
% 4.10/6.20 % ------
% 4.10/6.20
% 4.10/6.20
% 4.10/6.20 %
% 4.10/6.20
% 4.10/6.20 % ------ Proving...
% 4.10/6.20 %
% 4.10/6.20
% 4.10/6.20 % ------ Proving...
% 4.10/6.20 %
% 4.10/6.20
% 4.10/6.20 % SZS status Theorem for theBenchmark.p
% 4.10/6.20
% 4.10/6.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.10/6.20
% 4.10/6.20
%------------------------------------------------------------------------------