%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM622+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:16 PM UTC 2026
% Result : Theorem 3.85s 1.49s
% Output : CNFRefutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 47 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 37 ( 12 ~; 8 |; 14 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 10 !; 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/sandbox2/benchmark/theBenchmark.p',m__4660) ).
fof(f111,axiom,
( sdtlpdtrp0(xe,xn) = xp
& aElementOf0(xn,szNzAzT0)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xd,xn) = szDzizrdt0(xd)
& aElementOf0(xn,szDzozmdt0(xd)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5309) ).
fof(f118,axiom,
( aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xn))
=> aElementOf0(X0,sdtlpdtrp0(xN,xm)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5461) ).
fof(f119,conjecture,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f120,negated_conjecture,
~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(negated_conjecture,[status(cth)],[f119]) ).
fof(f143,plain,
~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(flattening,[],[f120]) ).
fof(f266,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(f283,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))
& ! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xn))
| aElementOf0(X0,sdtlpdtrp0(xN,xm)) ) ),
inference(ennf_transformation,[],[f118]) ).
fof(f821,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ),
inference(cnf_transformation,[],[f266]) ).
fof(f896,plain,
xp = sdtlpdtrp0(xe,xn),
inference(cnf_transformation,[],[f111]) ).
fof(f897,plain,
aElementOf0(xn,szNzAzT0),
inference(cnf_transformation,[],[f111]) ).
fof(f916,plain,
! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xn))
| aElementOf0(X0,sdtlpdtrp0(xN,xm)) ),
inference(cnf_transformation,[],[f283]) ).
fof(f917,plain,
~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f143]) ).
tcf(c_400,plain,
! [X0: $i] :
( aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f821]) ).
tcf(c_478,plain,
aElementOf0(xn,szNzAzT0),
inference(cnf_transformation,[],[f897]) ).
tcf(c_479,plain,
sdtlpdtrp0(xe,xn) = xp,
inference(cnf_transformation,[],[f896]) ).
tcf(c_494,plain,
! [X0: $i] :
( aElementOf0(X0,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xn)) ),
inference(cnf_transformation,[],[f916]) ).
tcf(c_496,negated_conjecture,
~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f917]) ).
tcf(c_634,plain,
( aElementOf0(xp,sdtlpdtrp0(xN,xn))
| ~ aElementOf0(xn,szNzAzT0) ),
inference(superposition,[status(thm)],[c_479,c_400]) ).
tcf(c_791,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xn)),
inference(global_subsumption_just,[status(thm)],[c_634,c_478,c_634]) ).
tcf(c_796,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(superposition,[status(thm)],[c_791,c_494]) ).
tcf(c_797,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_496,c_796]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM622+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.20/0.45 % Computer : n020.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Thu Sep 24 04:58:49 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.24/0.54
% 0.24/0.54 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.54
% 0.24/0.54 % Detected problem language: tptp
% 0.24/0.56 % Proving...
% 3.85/1.49 % SZS status Started for theBenchmark.p
% 3.85/1.49 % SZS status Theorem for theBenchmark.p
% 3.85/1.49
% 3.85/1.49 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.85/1.49
% 3.85/1.49 % ------ iProver source info
% 3.85/1.49
% 3.85/1.49 % git: date: 2026-07-19 20:42:38 +0200
% 3.85/1.49 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.85/1.49 % git: non_committed_changes: false
% 3.85/1.49
% 3.85/1.49 % ------ Parsing...
% 3.85/1.49 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.85/1.49 % ------ Proving...
% 3.85/1.49 % ------ Problem Properties
% 3.85/1.49
% 3.85/1.49 %
% 3.85/1.49 % clauses 448
% 3.85/1.49 % conjectures 1
% 3.85/1.49 % EPR 92
% 3.85/1.49 % Horn 363
% 3.85/1.49 % unary 82
% 3.85/1.49 % binary 129
% 3.85/1.49 % lits 1340
% 3.85/1.49 % lits eq 178
% 3.85/1.49 % fd_pure 0
% 3.85/1.49 % fd_pseudo 0
% 3.85/1.49 % fd_cond 11
% 3.85/1.49 % fd_pseudo_cond 47
% 3.85/1.49 % AC symbols 0
% 3.85/1.49
% 3.85/1.49 % ------ Input Options Time Limit: Unbounded
% 3.85/1.49
% 3.85/1.49
% 3.85/1.49 % ------
% 3.85/1.49 % Current options:
% 3.85/1.49 % ------
% 3.85/1.49
% 3.85/1.49
% 3.85/1.49 %
% 3.85/1.49
% 3.85/1.49 % ------ Proving...
% 3.85/1.49 %
% 3.85/1.49
% 3.85/1.49 % ------ Proving...
% 3.85/1.49 %
% 3.85/1.49
% 3.85/1.49 % SZS status Theorem for theBenchmark.p
% 3.85/1.49
% 3.85/1.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.85/1.49
% 3.85/1.49
%------------------------------------------------------------------------------