%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT381+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 : n026.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 01:59:45 PM UTC 2026
% Result : Theorem 2.26s 1.29s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 22 unt; 0 def)
% Number of atoms : 163 ( 12 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 173 ( 52 ~; 47 |; 58 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 44 ( 0 sgn 42 !; 2 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
fof(f14,axiom,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725) ).
fof(f16,axiom,
( aSupremumOfIn0(xv,xS,xT)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xS,xT)
| ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xT) ) )
=> sdtlseqdt0(xv,X0) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(X0,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xS,xT)
| ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xT) ) )
=> sdtlseqdt0(xu,X0) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(X0,xu) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__744) ).
fof(f17,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f18,negated_conjecture,
xu != xv,
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f22,plain,
( aSupremumOfIn0(xv,xS,xT)
& ! [X4] :
( ( aUpperBoundOfIn0(X4,xS,xT)
| ( ! [X5] :
( aElementOf0(X5,xS)
=> sdtlseqdt0(X5,X4) )
& aElementOf0(X4,xT) ) )
=> sdtlseqdt0(xv,X4) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X3] :
( aElementOf0(X3,xS)
=> sdtlseqdt0(X3,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X1] :
( ( aUpperBoundOfIn0(X1,xS,xT)
| ( ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xT) ) )
=> sdtlseqdt0(xu,X1) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(X0,xu) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(rectify,[],[f16]) ).
fof(f23,plain,
xu != xv,
inference(flattening,[],[f18]) ).
fof(f24,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f28,plain,
! [X0,X1] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f8]) ).
fof(f29,plain,
! [X0,X1] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f28]) ).
fof(f37,plain,
( aSupremumOfIn0(xv,xS,xT)
& ! [X4] :
( ( ~ aUpperBoundOfIn0(X4,xS,xT)
& ( ? [X5] :
( aElementOf0(X5,xS)
& ~ sdtlseqdt0(X5,X4) )
| ~ aElementOf0(X4,xT) ) )
| sdtlseqdt0(xv,X4) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X3] :
( ~ aElementOf0(X3,xS)
| sdtlseqdt0(X3,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X1] :
( ( ~ aUpperBoundOfIn0(X1,xS,xT)
& ( ? [X2] :
( aElementOf0(X2,xS)
& ~ sdtlseqdt0(X2,X1) )
| ~ aElementOf0(X1,xT) ) )
| sdtlseqdt0(xu,X1) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X0] :
( ~ aElementOf0(X0,xS)
| sdtlseqdt0(X0,xu) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(ennf_transformation,[],[f22]) ).
fof(f61,plain,
( aSupremumOfIn0(xv,xS,xT)
& ! [X4] :
( ( ~ aUpperBoundOfIn0(X4,xS,xT)
& ( ( aElementOf0(sK7(X4),xS)
& ~ sdtlseqdt0(sK7(X4),X4) )
| ~ aElementOf0(X4,xT) ) )
| sdtlseqdt0(xv,X4) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X3] :
( ~ aElementOf0(X3,xS)
| sdtlseqdt0(X3,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X1] :
( ( ~ aUpperBoundOfIn0(X1,xS,xT)
& ( ( aElementOf0(sK6(X1),xS)
& ~ sdtlseqdt0(sK6(X1),X1) )
| ~ aElementOf0(X1,xT) ) )
| sdtlseqdt0(xu,X1) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X0] :
( ~ aElementOf0(X0,xS)
| sdtlseqdt0(X0,xu) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X2,sK6(X1)),skolemize(X5,sK7(X4))],[f37]) ).
fof(f62,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aElementOf0(X1,X0)
| aElement0(X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f70,plain,
! [X0,X1] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f90,plain,
aSet0(xT),
inference(cnf_transformation,[],[f14]) ).
fof(f95,plain,
! [X4] :
( ~ aUpperBoundOfIn0(X4,xS,xT)
| sdtlseqdt0(xv,X4) ),
inference(cnf_transformation,[],[f61]) ).
fof(f98,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f61]) ).
fof(f100,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f61]) ).
fof(f103,plain,
! [X1] :
( ~ aUpperBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(xu,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f106,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f61]) ).
fof(f108,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f61]) ).
fof(f110,plain,
xu != xv,
inference(cnf_transformation,[],[f23]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( aElement0(X0)
| ~ aSet0(X1)
| ~ aElementOf0(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_77,plain,
aSet0(xT),
inference(cnf_transformation,[],[f90]) ).
tcf(c_82,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f108]) ).
tcf(c_84,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f106]) ).
tcf(c_87,plain,
! [X0: $i] :
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(cnf_transformation,[],[f103]) ).
tcf(c_90,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f100]) ).
tcf(c_92,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f98]) ).
tcf(c_95,plain,
! [X0: $i] :
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(cnf_transformation,[],[f95]) ).
tcf(c_97,negated_conjecture,
xu != xv,
inference(cnf_transformation,[],[f110]) ).
tcf(c_3232,negated_conjecture,
xu != xv,
inference(demodulation,[status(thm)],[c_97]) ).
tcf(c_3877,plain,
sdtlseqdt0(xu,xv),
inference(superposition,[status(thm)],[c_92,c_87]) ).
tcf(c_3882,plain,
sdtlseqdt0(xv,xu),
inference(superposition,[status(thm)],[c_84,c_95]) ).
tcf(c_3890,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(superposition,[status(thm)],[c_82,c_49]) ).
tcf(c_3891,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(superposition,[status(thm)],[c_90,c_49]) ).
tcf(c_3892,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[status(thm)],[c_3891,c_77]) ).
tcf(c_3893,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[status(thm)],[c_3890,c_77]) ).
tcf(c_3976,plain,
( ( xu = xv )
| ~ aElement0(xv)
| ~ aElement0(xu)
| ~ sdtlseqdt0(xu,xv) ),
inference(superposition,[status(thm)],[c_3882,c_57]) ).
tcf(c_3978,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3976,c_3232,c_3892,c_3893,c_3877]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT381+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.10/0.37 % Computer : n026.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 : Wed Sep 23 21:33:24 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 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.44 % Proving...
% 2.26/1.29 % SZS status Started for theBenchmark.p
% 2.26/1.29 % SZS status Theorem for theBenchmark.p
% 2.26/1.29
% 2.26/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.26/1.29
% 2.26/1.29 % ------ iProver source info
% 2.26/1.29
% 2.26/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.26/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.26/1.29 % git: non_committed_changes: false
% 2.26/1.29
% 2.26/1.29 % ------ Parsing...
% 2.26/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.26/1.29
% 2.26/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 2.26/1.29
% 2.26/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.26/1.29
% 2.26/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.26/1.29 % ------ Proving...
% 2.26/1.29 % ------ Problem Properties
% 2.26/1.29
% 2.26/1.29 %
% 2.26/1.29 % clauses 38
% 2.26/1.29 % conjectures 1
% 2.26/1.29 % EPR 23
% 2.26/1.29 % Horn 31
% 2.26/1.29 % unary 8
% 2.26/1.29 % binary 6
% 2.26/1.29 % lits 126
% 2.26/1.29 % lits eq 2
% 2.26/1.29 % fd_pure 0
% 2.26/1.29 % fd_pseudo 0
% 2.26/1.29 % fd_cond 0
% 2.26/1.29 % fd_pseudo_cond 1
% 2.26/1.29 % AC symbols 0
% 2.26/1.29
% 2.26/1.29 % ------ Schedule dynamic 5 is on
% 2.26/1.29
% 2.26/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.26/1.29
% 2.26/1.29
% 2.26/1.29 % ------
% 2.26/1.29 % Current options:
% 2.26/1.29 % ------
% 2.26/1.29
% 2.26/1.29
% 2.26/1.29 %
% 2.26/1.29
% 2.26/1.29 % ------ Proving...
% 2.26/1.29 %
% 2.26/1.29
% 2.26/1.29 % SZS status Theorem for theBenchmark.p
% 2.26/1.29
% 2.26/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.26/1.29
% 2.26/1.29
%------------------------------------------------------------------------------