%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT382+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 : n003.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.40s 1.42s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 65 ( 26 unt; 0 def)
% Number of atoms : 223 ( 30 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 290 ( 132 ~; 126 |; 23 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 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 : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 89 ( 0 sgn 86 !; 3 ?; 38 :)
% 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(f12,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefInf) ).
fof(f15,axiom,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
fof(f16,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773_01) ).
fof(f17,axiom,
( aInfimumOfIn0(xv,xS,xT)
& aInfimumOfIn0(xu,xS,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,
xu != xv,
inference(flattening,[],[f19]) ).
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(f34,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( ~ aLowerBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f53,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( ( ~ aInfimumOfIn0(X2,X1,X0)
| ( ! [X3] :
( ~ aLowerBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
& ( ? [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
& ~ sdtlseqdt0(X3,X2) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| aInfimumOfIn0(X2,X1,X0) ) ) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f54,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( ( ~ aInfimumOfIn0(X2,X1,X0)
| ( ! [X3] :
( ~ aLowerBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
& ( ? [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
& ~ sdtlseqdt0(X3,X2) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| aInfimumOfIn0(X2,X1,X0) ) ) ) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( ( ~ aInfimumOfIn0(X2,X1,X0)
| ( ! [X4] :
( ~ aLowerBoundOfIn0(X4,X1,X0)
| sdtlseqdt0(X4,X2) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
& ( ? [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
& ~ sdtlseqdt0(X3,X2) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| aInfimumOfIn0(X2,X1,X0) ) ) ) ),
inference(rectify,[],[f54]) ).
fof(f56,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( ( ~ aInfimumOfIn0(X2,X1,X0)
| ( ! [X4] :
( ~ aLowerBoundOfIn0(X4,X1,X0)
| sdtlseqdt0(X4,X2) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
& ( ( aLowerBoundOfIn0(sK4(X0,X1,X2),X1,X0)
& ~ sdtlseqdt0(sK4(X0,X1,X2),X2) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| aInfimumOfIn0(X2,X1,X0) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f55]) ).
fof(f61,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aElementOf0(X1,X0)
| aElement0(X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f69,plain,
! [X0,X1] :
( ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f79,plain,
! [X2,X0,X1,X4] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| ~ aInfimumOfIn0(X2,X1,X0)
| ~ aLowerBoundOfIn0(X4,X1,X0)
| sdtlseqdt0(X4,X2) ),
inference(cnf_transformation,[],[f56]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| ~ aInfimumOfIn0(X2,X1,X0)
| aLowerBoundOfIn0(X2,X1,X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f81,plain,
! [X2,X0,X1] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| ~ aInfimumOfIn0(X2,X1,X0)
| aElementOf0(X2,X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f90,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
fof(f91,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f92,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f93,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f94,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,[],[f61]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] :
( aElementOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aInfimumOfIn0(X0,X1,X2) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] :
( aLowerBoundOfIn0(X0,X1,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aInfimumOfIn0(X0,X1,X2) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( sdtlseqdt0(X0,X3)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aInfimumOfIn0(X3,X1,X2)
| ~ aLowerBoundOfIn0(X0,X1,X2) ),
inference(cnf_transformation,[],[f79]) ).
tcf(c_78,plain,
aSet0(xT),
inference(cnf_transformation,[],[f90]) ).
tcf(c_79,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f91]) ).
tcf(c_80,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f93]) ).
tcf(c_81,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f92]) ).
tcf(c_82,negated_conjecture,
xu != xv,
inference(cnf_transformation,[],[f94]) ).
tcf(c_708,plain,
! [X0: $i,X1: $i,X2: $i] :
( aLowerBoundOfIn0(X0,X1,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ( X2 != xT )
| ( X1 != xS )
| ( X0 != xu ) ),
inference(resolution_lifted,[status(thm)],[c_70,c_80]) ).
tcf(c_709,plain,
( aLowerBoundOfIn0(xu,xS,xT)
| ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT) ),
inference(unflattening,[status(thm)],[c_708]) ).
tcf(c_710,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(global_subsumption_just,[status(thm)],[c_709,c_78,c_79,c_709]) ).
tcf(c_715,plain,
! [X0: $i,X1: $i,X2: $i] :
( aElementOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ( X2 != xT )
| ( X1 != xS )
| ( X0 != xu ) ),
inference(resolution_lifted,[status(thm)],[c_69,c_80]) ).
tcf(c_716,plain,
( aElementOf0(xu,xT)
| ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT) ),
inference(unflattening,[status(thm)],[c_715]) ).
tcf(c_717,plain,
aElementOf0(xu,xT),
inference(global_subsumption_just,[status(thm)],[c_716,c_78,c_79,c_716]) ).
tcf(c_722,plain,
! [X0: $i,X1: $i,X2: $i] :
( aLowerBoundOfIn0(X0,X1,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ( X2 != xT )
| ( X1 != xS )
| ( X0 != xv ) ),
inference(resolution_lifted,[status(thm)],[c_70,c_81]) ).
tcf(c_723,plain,
( aLowerBoundOfIn0(xv,xS,xT)
| ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT) ),
inference(unflattening,[status(thm)],[c_722]) ).
tcf(c_724,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(global_subsumption_just,[status(thm)],[c_723,c_78,c_79,c_723]) ).
tcf(c_729,plain,
! [X0: $i,X1: $i,X2: $i] :
( aElementOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ( X2 != xT )
| ( X1 != xS )
| ( X0 != xv ) ),
inference(resolution_lifted,[status(thm)],[c_69,c_81]) ).
tcf(c_730,plain,
( aElementOf0(xv,xT)
| ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT) ),
inference(unflattening,[status(thm)],[c_729]) ).
tcf(c_731,plain,
aElementOf0(xv,xT),
inference(global_subsumption_just,[status(thm)],[c_730,c_78,c_79,c_730]) ).
tcf(c_736,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( sdtlseqdt0(X3,X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X0,X1)
| ~ aLowerBoundOfIn0(X3,X0,X1)
| ( X2 != xu )
| ( X1 != xT )
| ( X0 != xS ) ),
inference(resolution_lifted,[status(thm)],[c_71,c_80]) ).
tcf(c_737,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xu)
| ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| ~ aLowerBoundOfIn0(X0,xS,xT) ),
inference(unflattening,[status(thm)],[c_736]) ).
tcf(c_739,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xu)
| ~ aLowerBoundOfIn0(X0,xS,xT) ),
inference(global_subsumption_just,[status(thm)],[c_737,c_78,c_79,c_737]) ).
tcf(c_748,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( sdtlseqdt0(X3,X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X0,X1)
| ~ aLowerBoundOfIn0(X3,X0,X1)
| ( X2 != xv )
| ( X1 != xT )
| ( X0 != xS ) ),
inference(resolution_lifted,[status(thm)],[c_71,c_81]) ).
tcf(c_749,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xv)
| ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| ~ aLowerBoundOfIn0(X0,xS,xT) ),
inference(unflattening,[status(thm)],[c_748]) ).
tcf(c_751,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xv)
| ~ aLowerBoundOfIn0(X0,xS,xT) ),
inference(global_subsumption_just,[status(thm)],[c_749,c_78,c_79,c_749]) ).
tcf(c_1978,negated_conjecture,
xu != xv,
inference(demodulation,[status(thm)],[c_82]) ).
tcf(c_2611,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(superposition,[status(thm)],[c_717,c_49]) ).
tcf(c_2612,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(superposition,[status(thm)],[c_731,c_49]) ).
tcf(c_2613,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[status(thm)],[c_2612,c_78]) ).
tcf(c_2614,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[status(thm)],[c_2611,c_78]) ).
tcf(c_2665,plain,
sdtlseqdt0(xv,xu),
inference(superposition,[status(thm)],[c_724,c_739]) ).
tcf(c_2667,plain,
( ( xu = xv )
| ~ aElement0(xv)
| ~ aElement0(xu)
| ~ sdtlseqdt0(xu,xv) ),
inference(superposition,[status(thm)],[c_2665,c_57]) ).
tcf(c_2668,plain,
~ sdtlseqdt0(xu,xv),
inference(forward_subsumption_resolution,[status(thm)],[c_2667,c_1978,c_2613,c_2614]) ).
tcf(c_2673,plain,
sdtlseqdt0(xu,xv),
inference(superposition,[status(thm)],[c_710,c_751]) ).
tcf(c_2675,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2673,c_2668]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT382+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 : n003.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:32:20 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.44 % Proving...
% 3.40/1.42 % SZS status Started for theBenchmark.p
% 3.40/1.42 % SZS status Theorem for theBenchmark.p
% 3.40/1.42
% 3.40/1.42 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.40/1.42
% 3.40/1.42 % ------ iProver source info
% 3.40/1.42
% 3.40/1.42 % git: date: 2026-07-19 20:42:38 +0200
% 3.40/1.42 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.40/1.42 % git: non_committed_changes: false
% 3.40/1.42
% 3.40/1.42 % ------ Parsing...
% 3.40/1.42 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.40/1.42
% 3.40/1.42 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e %
% 3.40/1.42
% 3.40/1.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.40/1.42
% 3.40/1.42 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.40/1.42 % ------ Proving...
% 3.40/1.42 % ------ Problem Properties
% 3.40/1.42
% 3.40/1.42 %
% 3.40/1.42 % clauses 34
% 3.40/1.42 % conjectures 1
% 3.40/1.42 % EPR 23
% 3.40/1.42 % Horn 29
% 3.40/1.42 % unary 7
% 3.40/1.42 % binary 3
% 3.40/1.42 % lits 123
% 3.40/1.42 % lits eq 3
% 3.40/1.42 % fd_pure 0
% 3.40/1.42 % fd_pseudo 0
% 3.40/1.42 % fd_cond 0
% 3.40/1.42 % fd_pseudo_cond 2
% 3.40/1.42 % AC symbols 0
% 3.40/1.42
% 3.40/1.42 % ------ Schedule dynamic 5 is on
% 3.40/1.42
% 3.40/1.42 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.40/1.42
% 3.40/1.42
% 3.40/1.42 % ------
% 3.40/1.42 % Current options:
% 3.40/1.42 % ------
% 3.40/1.42
% 3.40/1.42
% 3.40/1.42 %
% 3.40/1.42
% 3.40/1.42 % ------ Proving...
% 3.40/1.42 %
% 3.40/1.42
% 3.40/1.42 % SZS status Theorem for theBenchmark.p
% 3.40/1.42
% 3.40/1.42 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.40/1.42
% 3.40/1.42
%------------------------------------------------------------------------------