%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM624+1 : 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 : n009.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:17 PM UTC 2026
% Result : Theorem 3.23s 1.28s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 26 unt; 0 def)
% Number of atoms : 94 ( 45 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 100 ( 44 ~; 46 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 14 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f49,axiom,
! [X0,X1] :
( ( X1 != slcrc0
& X0 != slcrc0
& aSubsetOf0(X1,szNzAzT0)
& aSubsetOf0(X0,szNzAzT0) )
=> ( ( aElementOf0(szmzizndt0(X1),X0)
& aElementOf0(szmzizndt0(X0),X1) )
=> szmzizndt0(X0) = szmzizndt0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMinMin) ).
fof(f103,axiom,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5147) ).
fof(f116,axiom,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5401) ).
fof(f119,axiom,
( aElementOf0(xx,xQ)
& aElementOf0(xp,sdtlpdtrp0(xN,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5481) ).
fof(f120,axiom,
( sdtlpdtrp0(xN,xm) != slcrc0
& xQ != slcrc0
& aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
& aSubsetOf0(xQ,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5518) ).
fof(f121,conjecture,
xp = xx,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f122,negated_conjecture,
xp != xx,
inference(negated_conjecture,[status(cth)],[f121]) ).
fof(f130,plain,
xp != xx,
inference(flattening,[],[f122]) ).
fof(f194,plain,
! [X0,X1] :
( slcrc0 = X1
| slcrc0 = X0
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X0,szNzAzT0)
| ~ aElementOf0(szmzizndt0(X1),X0)
| ~ aElementOf0(szmzizndt0(X0),X1)
| szmzizndt0(X0) = szmzizndt0(X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f195,plain,
! [X0,X1] :
( slcrc0 = X1
| slcrc0 = X0
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X0,szNzAzT0)
| ~ aElementOf0(szmzizndt0(X1),X0)
| ~ aElementOf0(szmzizndt0(X0),X1)
| szmzizndt0(X0) = szmzizndt0(X1) ),
inference(flattening,[],[f194]) ).
fof(f405,plain,
! [X0,X1] :
( slcrc0 = X1
| slcrc0 = X0
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X0,szNzAzT0)
| ~ aElementOf0(szmzizndt0(X1),X0)
| ~ aElementOf0(szmzizndt0(X0),X1)
| szmzizndt0(X0) = szmzizndt0(X1) ),
inference(cnf_transformation,[],[f195]) ).
fof(f527,plain,
xp = szmzizndt0(xQ),
inference(cnf_transformation,[],[f103]) ).
fof(f545,plain,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f116]) ).
fof(f548,plain,
aElementOf0(xx,xQ),
inference(cnf_transformation,[],[f119]) ).
fof(f549,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f119]) ).
fof(f550,plain,
slcrc0 != sdtlpdtrp0(xN,xm),
inference(cnf_transformation,[],[f120]) ).
fof(f551,plain,
slcrc0 != xQ,
inference(cnf_transformation,[],[f120]) ).
fof(f552,plain,
aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0),
inference(cnf_transformation,[],[f120]) ).
fof(f553,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f120]) ).
fof(f554,plain,
xp != xx,
inference(cnf_transformation,[],[f130]) ).
tcf(c_131,plain,
! [X0: $i,X1: $i] :
( ( X1 = slcrc0 )
| ( X0 = slcrc0 )
| ( szmzizndt0(X0) = szmzizndt0(X1) )
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X0,szNzAzT0)
| ~ aElementOf0(szmzizndt0(X1),X0)
| ~ aElementOf0(szmzizndt0(X0),X1) ),
inference(cnf_transformation,[],[f405]) ).
tcf(c_253,plain,
szmzizndt0(xQ) = xp,
inference(cnf_transformation,[],[f527]) ).
tcf(c_271,plain,
szmzizndt0(sdtlpdtrp0(xN,xm)) = xx,
inference(cnf_transformation,[],[f545]) ).
tcf(c_274,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f549]) ).
tcf(c_275,plain,
aElementOf0(xx,xQ),
inference(cnf_transformation,[],[f548]) ).
tcf(c_276,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f553]) ).
tcf(c_277,plain,
aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0),
inference(cnf_transformation,[],[f552]) ).
tcf(c_278,plain,
slcrc0 != xQ,
inference(cnf_transformation,[],[f551]) ).
tcf(c_279,plain,
sdtlpdtrp0(xN,xm) != slcrc0,
inference(cnf_transformation,[],[f550]) ).
tcf(c_280,negated_conjecture,
xp != xx,
inference(cnf_transformation,[],[f554]) ).
tcf(c_378,plain,
! [X0: $i] :
( ( slcrc0 = xQ )
| ( X0 = slcrc0 )
| ( szmzizndt0(X0) = szmzizndt0(xQ) )
| ~ aSubsetOf0(xQ,szNzAzT0)
| ~ aSubsetOf0(X0,szNzAzT0)
| ~ aElementOf0(xp,X0)
| ~ aElementOf0(szmzizndt0(X0),xQ) ),
inference(superposition,[status(thm)],[c_253,c_131]) ).
tcf(c_440,plain,
! [X0: $i] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aElementOf0(xp,X0)
| ~ aElementOf0(szmzizndt0(X0),xQ)
| ( szmzizndt0(X0) = szmzizndt0(xQ) )
| ( X0 = slcrc0 ) ),
inference(global_subsumption_just,[status(thm)],[c_378,c_276,c_278,c_378]) ).
tcf(c_441,plain,
! [X0: $i] :
( ( X0 = slcrc0 )
| ( szmzizndt0(X0) = szmzizndt0(xQ) )
| ~ aSubsetOf0(X0,szNzAzT0)
| ~ aElementOf0(xp,X0)
| ~ aElementOf0(szmzizndt0(X0),xQ) ),
inference(renaming,[status(thm)],[c_440]) ).
tcf(c_448,plain,
! [X0: $i] :
( ( X0 = slcrc0 )
| ( szmzizndt0(X0) = xp )
| ~ aSubsetOf0(X0,szNzAzT0)
| ~ aElementOf0(xp,X0)
| ~ aElementOf0(szmzizndt0(X0),xQ) ),
inference(light_normalisation,[status(thm)],[c_441,c_253]) ).
tcf(c_461,plain,
( ( sdtlpdtrp0(xN,xm) = slcrc0 )
| ( szmzizndt0(sdtlpdtrp0(xN,xm)) = xp )
| ~ aElementOf0(xx,xQ)
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
| ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)) ),
inference(superposition,[status(thm)],[c_271,c_448]) ).
tcf(c_629,plain,
szmzizndt0(sdtlpdtrp0(xN,xm)) = xp,
inference(global_subsumption_just,[status(thm)],[c_461,c_275,c_274,c_277,c_279,c_461]) ).
tcf(c_644,plain,
xp = xx,
inference(superposition,[status(thm)],[c_629,c_271]) ).
tcf(c_645,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_280,c_644]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM624+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 04:58:14 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.23/1.28 % SZS status Started for theBenchmark.p
% 3.23/1.28 % SZS status Theorem for theBenchmark.p
% 3.23/1.28
% 3.23/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.23/1.28
% 3.23/1.28 % ------ iProver source info
% 3.23/1.28
% 3.23/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.23/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.23/1.28 % git: non_committed_changes: false
% 3.23/1.28
% 3.23/1.28 % ------ Parsing...
% 3.23/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.23/1.28 % ------ Proving...
% 3.23/1.28 % ------ Problem Properties
% 3.23/1.28
% 3.23/1.28 %
% 3.23/1.28 % clauses 232
% 3.23/1.28 % conjectures 1
% 3.23/1.28 % EPR 65
% 3.23/1.28 % Horn 193
% 3.23/1.28 % unary 69
% 3.23/1.28 % binary 35
% 3.23/1.28 % lits 703
% 3.23/1.28 % lits eq 111
% 3.23/1.28 % fd_pure 0
% 3.23/1.28 % fd_pseudo 0
% 3.23/1.28 % fd_cond 10
% 3.23/1.28 % fd_pseudo_cond 25
% 3.23/1.28 % AC symbols 0
% 3.23/1.28
% 3.23/1.28 % ------ Input Options Time Limit: Unbounded
% 3.23/1.28
% 3.23/1.28
% 3.23/1.28 % ------
% 3.23/1.28 % Current options:
% 3.23/1.28 % ------
% 3.23/1.28
% 3.23/1.28
% 3.23/1.28 %
% 3.23/1.28
% 3.23/1.28 % ------ Proving...
% 3.23/1.28 %
% 3.23/1.28
% 3.23/1.28 % ------ Proving...
% 3.23/1.28 %
% 3.23/1.28
% 3.23/1.28 % SZS status Theorem for theBenchmark.p
% 3.23/1.28
% 3.23/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.23/1.28
% 3.23/1.28
%------------------------------------------------------------------------------