%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT382+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 : n004.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 3.69s 1.53s
% Output : CNFRefutation 3.69s
% 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(f15,axiom,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
fof(f17,axiom,
( aInfimumOfIn0(xv,xS,xT)
& ! [X0] :
( ( aLowerBoundOfIn0(X0,xS,xT)
| ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X0,X1) )
& aElementOf0(X0,xT) ) )
=> sdtlseqdt0(X0,xv) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(xv,X0) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aInfimumOfIn0(xu,xS,xT)
& ! [X0] :
( ( aLowerBoundOfIn0(X0,xS,xT)
| ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X0,X1) )
& aElementOf0(X0,xT) ) )
=> sdtlseqdt0(X0,xu) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(xu,X0) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__792) ).
fof(f18,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f19,negated_conjecture,
xu != xv,
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f23,plain,
( aInfimumOfIn0(xv,xS,xT)
& ! [X4] :
( ( aLowerBoundOfIn0(X4,xS,xT)
| ( ! [X5] :
( aElementOf0(X5,xS)
=> sdtlseqdt0(X4,X5) )
& aElementOf0(X4,xT) ) )
=> sdtlseqdt0(X4,xv) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X3] :
( aElementOf0(X3,xS)
=> sdtlseqdt0(xv,X3) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aInfimumOfIn0(xu,xS,xT)
& ! [X1] :
( ( aLowerBoundOfIn0(X1,xS,xT)
| ( ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,xT) ) )
=> sdtlseqdt0(X1,xu) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(xu,X0) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(rectify,[],[f17]) ).
fof(f24,plain,
xu != xv,
inference(flattening,[],[f19]) ).
fof(f25,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f29,plain,
! [X0,X1] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f8]) ).
fof(f30,plain,
! [X0,X1] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f29]) ).
fof(f40,plain,
( aInfimumOfIn0(xv,xS,xT)
& ! [X4] :
( ( ~ aLowerBoundOfIn0(X4,xS,xT)
& ( ? [X5] :
( aElementOf0(X5,xS)
& ~ sdtlseqdt0(X4,X5) )
| ~ aElementOf0(X4,xT) ) )
| sdtlseqdt0(X4,xv) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X3] :
( ~ aElementOf0(X3,xS)
| sdtlseqdt0(xv,X3) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aInfimumOfIn0(xu,xS,xT)
& ! [X1] :
( ( ~ aLowerBoundOfIn0(X1,xS,xT)
& ( ? [X2] :
( aElementOf0(X2,xS)
& ~ sdtlseqdt0(X1,X2) )
| ~ aElementOf0(X1,xT) ) )
| sdtlseqdt0(X1,xu) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X0] :
( ~ aElementOf0(X0,xS)
| sdtlseqdt0(xu,X0) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(ennf_transformation,[],[f23]) ).
fof(f64,plain,
( aInfimumOfIn0(xv,xS,xT)
& ! [X4] :
( ( ~ aLowerBoundOfIn0(X4,xS,xT)
& ( ( aElementOf0(sK7(X4),xS)
& ~ sdtlseqdt0(X4,sK7(X4)) )
| ~ aElementOf0(X4,xT) ) )
| sdtlseqdt0(X4,xv) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X3] :
( ~ aElementOf0(X3,xS)
| sdtlseqdt0(xv,X3) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aInfimumOfIn0(xu,xS,xT)
& ! [X1] :
( ( ~ aLowerBoundOfIn0(X1,xS,xT)
& ( ( aElementOf0(sK6(X1),xS)
& ~ sdtlseqdt0(X1,sK6(X1)) )
| ~ aElementOf0(X1,xT) ) )
| sdtlseqdt0(X1,xu) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X0] :
( ~ aElementOf0(X0,xS)
| sdtlseqdt0(xu,X0) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X2,sK6(X1)),skolemize(X5,sK7(X4))],[f40]) ).
fof(f65,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aElementOf0(X1,X0)
| aElement0(X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f73,plain,
! [X0,X1] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f94,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
fof(f99,plain,
! [X4] :
( ~ aLowerBoundOfIn0(X4,xS,xT)
| sdtlseqdt0(X4,xv) ),
inference(cnf_transformation,[],[f64]) ).
fof(f102,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f64]) ).
fof(f104,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f64]) ).
fof(f107,plain,
! [X1] :
( ~ aLowerBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(X1,xu) ),
inference(cnf_transformation,[],[f64]) ).
fof(f110,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f64]) ).
fof(f112,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f64]) ).
fof(f114,plain,
xu != xv,
inference(cnf_transformation,[],[f24]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( aElement0(X0)
| ~ aSet0(X1)
| ~ aElementOf0(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_78,plain,
aSet0(xT),
inference(cnf_transformation,[],[f94]) ).
tcf(c_83,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f112]) ).
tcf(c_85,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f110]) ).
tcf(c_88,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xu)
| ~ aLowerBoundOfIn0(X0,xS,xT) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_91,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f104]) ).
tcf(c_93,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f102]) ).
tcf(c_96,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xv)
| ~ aLowerBoundOfIn0(X0,xS,xT) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_98,negated_conjecture,
xu != xv,
inference(cnf_transformation,[],[f114]) ).
tcf(c_3718,negated_conjecture,
xu != xv,
inference(demodulation,[status(thm)],[c_98]) ).
tcf(c_4427,plain,
sdtlseqdt0(xv,xu),
inference(superposition,[status(thm)],[c_93,c_88]) ).
tcf(c_4432,plain,
sdtlseqdt0(xu,xv),
inference(superposition,[status(thm)],[c_85,c_96]) ).
tcf(c_4440,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(superposition,[status(thm)],[c_83,c_49]) ).
tcf(c_4441,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(superposition,[status(thm)],[c_91,c_49]) ).
tcf(c_4442,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[status(thm)],[c_4441,c_78]) ).
tcf(c_4443,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[status(thm)],[c_4440,c_78]) ).
tcf(c_4526,plain,
( ( xu = xv )
| ~ aElement0(xv)
| ~ aElement0(xu)
| ~ sdtlseqdt0(xv,xu) ),
inference(superposition,[status(thm)],[c_4432,c_57]) ).
tcf(c_4528,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4526,c_3718,c_4442,c_4443,c_4427]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT382+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.19/0.44 % Computer : n004.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Wed Sep 23 21:30:35 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 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.25/0.53
% 0.25/0.53 % ======== iProver multi-core TPTP/SMT =========
% 0.25/0.53
% 0.25/0.53 % Detected problem language: tptp
% 0.25/0.56 % Proving...
% 3.69/1.53 % SZS status Started for theBenchmark.p
% 3.69/1.53 % SZS status Theorem for theBenchmark.p
% 3.69/1.53
% 3.69/1.53 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.69/1.53
% 3.69/1.53 % ------ iProver source info
% 3.69/1.53
% 3.69/1.53 % git: date: 2026-07-19 20:42:38 +0200
% 3.69/1.53 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.69/1.53 % git: non_committed_changes: false
% 3.69/1.53
% 3.69/1.53 % ------ Parsing...
% 3.69/1.53 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.69/1.53
% 3.69/1.53 % ------ 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 %
% 3.69/1.53
% 3.69/1.53 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.69/1.53
% 3.69/1.53 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.69/1.53 % ------ Proving...
% 3.69/1.53 % ------ Problem Properties
% 3.69/1.53
% 3.69/1.53 %
% 3.69/1.53 % clauses 42
% 3.69/1.53 % conjectures 1
% 3.69/1.53 % EPR 27
% 3.69/1.53 % Horn 35
% 3.69/1.53 % unary 8
% 3.69/1.53 % binary 6
% 3.69/1.53 % lits 142
% 3.69/1.53 % lits eq 3
% 3.69/1.53 % fd_pure 0
% 3.69/1.53 % fd_pseudo 0
% 3.69/1.53 % fd_cond 0
% 3.69/1.53 % fd_pseudo_cond 2
% 3.69/1.53 % AC symbols 0
% 3.69/1.53
% 3.69/1.53 % ------ Schedule dynamic 5 is on
% 3.69/1.53
% 3.69/1.53 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.69/1.53
% 3.69/1.53
% 3.69/1.53 % ------
% 3.69/1.53 % Current options:
% 3.69/1.53 % ------
% 3.69/1.53
% 3.69/1.53
% 3.69/1.53 %
% 3.69/1.53
% 3.69/1.53 % ------ Proving...
% 3.69/1.53 %
% 3.69/1.53
% 3.69/1.53 % SZS status Theorem for theBenchmark.p
% 3.69/1.53
% 3.69/1.53 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.69/1.53
% 3.69/1.53
%------------------------------------------------------------------------------