%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT385+4 : 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 : n019.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:46 PM UTC 2026
% Result : Theorem 4.21s 1.31s
% Output : CNFRefutation 4.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f73ERROR: Could not build tree for root c_13828ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( ( ( aUpperBoundOfIn0(X0,xT,xU)
| ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) ) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) )
=> aElementOf0(X0,xP) )
& ( aElementOf0(X0,xP)
=> ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) ) ) )
& aSet0(xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1244) ).
fof(f31,plain,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( ( ( aUpperBoundOfIn0(X0,xT,xU)
| ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X0) ) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) )
=> aElementOf0(X0,xP) )
& ( aElementOf0(X0,xP)
=> ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) ) ) )
& aSet0(xP) ),
inference(rectify,[],[f27]) ).
fof(f42,plain,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( ( ~ aUpperBoundOfIn0(X0,xT,xU)
& ? [X2] :
( aElementOf0(X2,xT)
& ~ sdtlseqdt0(X2,X0) ) )
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ~ aElementOf0(X0,xU)
| aElementOf0(X0,xP) )
& ( ~ aElementOf0(X0,xP)
| ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X1] :
( ~ aElementOf0(X1,xT)
| sdtlseqdt0(X1,X0) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) ) ) )
& aSet0(xP) ),
inference(ennf_transformation,[],[f31]) ).
fof(f43,plain,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( ( ~ aUpperBoundOfIn0(X0,xT,xU)
& ? [X2] :
( aElementOf0(X2,xT)
& ~ sdtlseqdt0(X2,X0) ) )
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ~ aElementOf0(X0,xU)
| aElementOf0(X0,xP) )
& ( ~ aElementOf0(X0,xP)
| ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X1] :
( ~ aElementOf0(X1,xT)
| sdtlseqdt0(X1,X0) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) ) ) )
& aSet0(xP) ),
inference(flattening,[],[f42]) ).
fof(f76,plain,
! [X0] :
( ~ sP2(X0)
| ? [X2] :
( sP0(X0)
& aInfimumOfIn0(X2,X0,xU)
& sP1(X2,X0)
& aLowerBoundOfIn0(X2,X0,xU)
& ! [X3] :
( ~ aElementOf0(X3,X0)
| sdtlseqdt0(X2,X3) )
& aElementOf0(X2,xU)
& aElementOf0(X2,xU) ) ),
inference(nnf_transformation,[],[f72]) ).
fof(f77,plain,
! [X0] :
( ~ sP2(X0)
| ? [X1] :
( sP0(X0)
& aInfimumOfIn0(X1,X0,xU)
& sP1(X1,X0)
& aLowerBoundOfIn0(X1,X0,xU)
& ! [X2] :
( ~ aElementOf0(X2,X0)
| sdtlseqdt0(X1,X2) )
& aElementOf0(X1,xU)
& aElementOf0(X1,xU) ) ),
inference(rectify,[],[f76]) ).
fof(f78,plain,
! [X0] :
( ~ sP2(X0)
| ( sP0(X0)
& aInfimumOfIn0(sK4(X0),X0,xU)
& sP1(sK4(X0),X0)
& aLowerBoundOfIn0(sK4(X0),X0,xU)
& ! [X2] :
( ~ aElementOf0(X2,X0)
| sdtlseqdt0(sK4(X0),X2) )
& aElementOf0(sK4(X0),xU)
& aElementOf0(sK4(X0),xU) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f77]) ).
fof(f85,plain,
( isOn0(xf,xU)
& szRzazndt0(xf) = xU
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X2,X3] :
( ~ aElementOf0(X3,szDzozmdt0(xf))
| ~ aElementOf0(X2,szDzozmdt0(xf))
| ~ sdtlseqdt0(X2,X3)
| sdtlseqdt0(sdtlpdtrp0(xf,X2),sdtlpdtrp0(xf,X3)) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X0] :
( ( ~ aSubsetOf0(X0,xU)
& ( ? [X1] :
( aElementOf0(X1,X0)
& ~ aElementOf0(X1,xU) )
| ~ aSet0(X0) ) )
| sP2(X0) )
& aSet0(xU) ),
inference(rectify,[],[f73]) ).
fof(f86,plain,
( isOn0(xf,xU)
& szRzazndt0(xf) = xU
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X2,X3] :
( ~ aElementOf0(X3,szDzozmdt0(xf))
| ~ aElementOf0(X2,szDzozmdt0(xf))
| ~ sdtlseqdt0(X2,X3)
| sdtlseqdt0(sdtlpdtrp0(xf,X2),sdtlpdtrp0(xf,X3)) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X0] :
( ( ~ aSubsetOf0(X0,xU)
& ( ( aElementOf0(sK8(X0),X0)
& ~ aElementOf0(sK8(X0),xU) )
| ~ aSet0(X0) ) )
| sP2(X0) )
& aSet0(xU) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X1,sK8(X0))],[f85]) ).
fof(f87,plain,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( ( ~ aUpperBoundOfIn0(X0,xT,xU)
& aElementOf0(sK9(X0),xT)
& ~ sdtlseqdt0(sK9(X0),X0) )
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ~ aElementOf0(X0,xU)
| aElementOf0(X0,xP) )
& ( ~ aElementOf0(X0,xP)
| ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X1] :
( ~ aElementOf0(X1,xT)
| sdtlseqdt0(X1,X0) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) ) ) )
& aSet0(xP) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X2,sK9(X0))],[f43]) ).
fof(f91,plain,
! [X0] :
( ~ aInfimumOfIn0(X0,xP,xU)
& ( sP3(X0)
| ( ~ aLowerBoundOfIn0(X0,xP,xU)
& ( ( aElementOf0(sK11(X0),xP)
& ~ sdtlseqdt0(X0,sK11(X0)) )
| ~ aElementOf0(X0,xU) ) )
| ~ aElementOf0(X0,xU) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X1,sK11(X0))],[f75]) ).
fof(f121,plain,
! [X0] :
( ~ sP2(X0)
| aInfimumOfIn0(sK4(X0),X0,xU) ),
inference(cnf_transformation,[],[f78]) ).
fof(f146,plain,
! [X0] :
( aElementOf0(sK8(X0),X0)
| ~ aSet0(X0)
| sP2(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f147,plain,
! [X0] :
( ~ aElementOf0(sK8(X0),xU)
| ~ aSet0(X0)
| sP2(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f166,plain,
! [X0] :
( ~ aElementOf0(X0,xP)
| aElementOf0(X0,xU) ),
inference(cnf_transformation,[],[f87]) ).
fof(f167,plain,
aSet0(xP),
inference(cnf_transformation,[],[f87]) ).
fof(f172,plain,
! [X0] : ~ aInfimumOfIn0(X0,xP,xU),
inference(cnf_transformation,[],[f91]) ).
tcf(c_54,plain,
! [X0: $i] :
( aInfimumOfIn0(sK4(X0),X0,xU)
| ~ sP2(X0) ),
inference(cnf_transformation,[],[f121]) ).
tcf(c_68,plain,
! [X0: $i] :
( sP2(X0)
| ~ aSet0(X0)
| ~ aElementOf0(sK8(X0),xU) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_69,plain,
! [X0: $i] :
( sP2(X0)
| aElementOf0(sK8(X0),X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_88,plain,
aSet0(xP),
inference(cnf_transformation,[],[f167]) ).
tcf(c_89,plain,
! [X0: $i] :
( aElementOf0(X0,xU)
| ~ aElementOf0(X0,xP) ),
inference(cnf_transformation,[],[f166]) ).
tcf(c_104,negated_conjecture,
! [X0: $i] : ~ aInfimumOfIn0(X0,xP,xU),
inference(cnf_transformation,[],[f172]) ).
tcf(c_13669,plain,
~ sP2(xP),
inference(superposition,[status(thm)],[c_54,c_104]) ).
tcf(c_13712,plain,
( sP2(xP)
| aElementOf0(sK8(xP),xU)
| ~ aSet0(xP) ),
inference(superposition,[status(thm)],[c_69,c_89]) ).
tcf(c_13713,plain,
aElementOf0(sK8(xP),xU),
inference(forward_subsumption_resolution,[status(thm)],[c_13712,c_13669,c_88]) ).
tcf(c_13825,plain,
( sP2(xP)
| ~ aSet0(xP) ),
inference(superposition,[status(thm)],[c_13713,c_68]) ).
tcf(c_13828,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_13825,c_13669,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT385+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 21:31:04 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 4.21/1.31 % SZS status Started for theBenchmark.p
% 4.21/1.31 % SZS status Theorem for theBenchmark.p
% 4.21/1.31
% 4.21/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.21/1.31
% 4.21/1.31 % ------ iProver source info
% 4.21/1.31
% 4.21/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.21/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.21/1.31 % git: non_committed_changes: false
% 4.21/1.31
% 4.21/1.31 % ------ Parsing...
% 4.21/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.21/1.31
% 4.21/1.31 % ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 9 sf_s rm: 6 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e %
% 4.21/1.31
% 4.21/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.21/1.31
% 4.21/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.21/1.31 % ------ Proving...
% 4.21/1.31 % ------ Problem Properties
% 4.21/1.31
% 4.21/1.31 %
% 4.21/1.31 % clauses 79
% 4.21/1.31 % conjectures 4
% 4.21/1.31 % EPR 33
% 4.21/1.31 % Horn 69
% 4.21/1.31 % unary 10
% 4.21/1.31 % binary 22
% 4.21/1.31 % lits 245
% 4.21/1.31 % lits eq 9
% 4.21/1.31 % fd_pure 0
% 4.21/1.31 % fd_pseudo 0
% 4.21/1.31 % fd_cond 0
% 4.21/1.31 % fd_pseudo_cond 3
% 4.21/1.31 % AC symbols 0
% 4.21/1.31
% 4.21/1.31 % ------ Schedule dynamic 5 is on
% 4.21/1.31
% 4.21/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.21/1.31
% 4.21/1.31
% 4.21/1.31 % ------
% 4.21/1.31 % Current options:
% 4.21/1.31 % ------
% 4.21/1.31
% 4.21/1.31
% 4.21/1.31 %
% 4.21/1.31
% 4.21/1.31 % ------ Proving...
% 4.21/1.31 %
% 4.21/1.31
% 4.21/1.31 % SZS status Theorem for theBenchmark.p
% 4.21/1.31
% 4.21/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.21/1.31
% 4.21/1.31
%------------------------------------------------------------------------------