TSTP Solution File: LAT381+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LAT381+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 06:18:24 EDT 2023
% Result : Theorem 2.29s 1.14s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 21 unt; 0 def)
% Number of atoms : 170 ( 11 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 182 ( 55 ~; 47 |; 62 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 : 48 ( 0 sgn; 38 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).
fof(f14,axiom,
aSet0(xT),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',m__744) ).
fof(f17,conjecture,
xu = xv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f18,negated_conjecture,
xu != xv,
inference(negated_conjecture,[],[f17]) ).
fof(f22,plain,
( 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)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X3] :
( ( aUpperBoundOfIn0(X3,xS,xT)
| ( ! [X4] :
( aElementOf0(X4,xS)
=> sdtlseqdt0(X4,X3) )
& aElementOf0(X3,xT) ) )
=> sdtlseqdt0(xu,X3) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X5] :
( aElementOf0(X5,xS)
=> sdtlseqdt0(X5,xu) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(rectify,[],[f16]) ).
fof(f23,plain,
xu != xv,
inference(flattening,[],[f18]) ).
fof(f24,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f28,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f29,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f28]) ).
fof(f37,plain,
( aSupremumOfIn0(xv,xS,xT)
& ! [X0] :
( sdtlseqdt0(xv,X0)
| ( ~ aUpperBoundOfIn0(X0,xS,xT)
& ( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xS) )
| ~ aElementOf0(X0,xT) ) ) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X2] :
( sdtlseqdt0(X2,xv)
| ~ aElementOf0(X2,xS) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X3] :
( sdtlseqdt0(xu,X3)
| ( ~ aUpperBoundOfIn0(X3,xS,xT)
& ( ? [X4] :
( ~ sdtlseqdt0(X4,X3)
& aElementOf0(X4,xS) )
| ~ aElementOf0(X3,xT) ) ) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X5] :
( sdtlseqdt0(X5,xu)
| ~ aElementOf0(X5,xS) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(ennf_transformation,[],[f22]) ).
fof(f67,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xS) )
=> ( ~ sdtlseqdt0(sK6(X0),X0)
& aElementOf0(sK6(X0),xS) ) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
! [X3] :
( ? [X4] :
( ~ sdtlseqdt0(X4,X3)
& aElementOf0(X4,xS) )
=> ( ~ sdtlseqdt0(sK7(X3),X3)
& aElementOf0(sK7(X3),xS) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
( aSupremumOfIn0(xv,xS,xT)
& ! [X0] :
( sdtlseqdt0(xv,X0)
| ( ~ aUpperBoundOfIn0(X0,xS,xT)
& ( ( ~ sdtlseqdt0(sK6(X0),X0)
& aElementOf0(sK6(X0),xS) )
| ~ aElementOf0(X0,xT) ) ) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X2] :
( sdtlseqdt0(X2,xv)
| ~ aElementOf0(X2,xS) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X3] :
( sdtlseqdt0(xu,X3)
| ( ~ aUpperBoundOfIn0(X3,xS,xT)
& ( ( ~ sdtlseqdt0(sK7(X3),X3)
& aElementOf0(sK7(X3),xS) )
| ~ aElementOf0(X3,xT) ) ) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X5] :
( sdtlseqdt0(X5,xu)
| ~ aElementOf0(X5,xS) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f37,f68,f67]) ).
fof(f70,plain,
! [X0,X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f78,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f98,plain,
aSet0(xT),
inference(cnf_transformation,[],[f14]) ).
fof(f102,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f69]) ).
fof(f105,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f69]) ).
fof(f108,plain,
! [X3] :
( sdtlseqdt0(xu,X3)
| ~ aUpperBoundOfIn0(X3,xS,xT) ),
inference(cnf_transformation,[],[f69]) ).
fof(f110,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f69]) ).
fof(f113,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f69]) ).
fof(f116,plain,
! [X0] :
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(cnf_transformation,[],[f69]) ).
fof(f118,plain,
xu != xv,
inference(cnf_transformation,[],[f23]) ).
cnf(c_49,plain,
( ~ aElementOf0(X0,X1)
| ~ aSet0(X1)
| aElement0(X0) ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_57,plain,
( ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f78]) ).
cnf(c_77,plain,
aSet0(xT),
inference(cnf_transformation,[],[f98]) ).
cnf(c_82,plain,
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xv,X0) ),
inference(cnf_transformation,[],[f116]) ).
cnf(c_85,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f113]) ).
cnf(c_88,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f110]) ).
cnf(c_90,plain,
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xu,X0) ),
inference(cnf_transformation,[],[f108]) ).
cnf(c_93,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f105]) ).
cnf(c_96,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f102]) ).
cnf(c_97,negated_conjecture,
xv != xu,
inference(cnf_transformation,[],[f118]) ).
cnf(c_3876,plain,
sdtlseqdt0(xv,xu),
inference(superposition,[status(thm)],[c_93,c_82]) ).
cnf(c_3881,plain,
sdtlseqdt0(xu,xv),
inference(superposition,[status(thm)],[c_85,c_90]) ).
cnf(c_3889,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(superposition,[status(thm)],[c_88,c_49]) ).
cnf(c_3890,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(superposition,[status(thm)],[c_96,c_49]) ).
cnf(c_3891,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[status(thm)],[c_3890,c_77]) ).
cnf(c_3892,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[status(thm)],[c_3889,c_77]) ).
cnf(c_3975,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xv)
| ~ aElement0(xu)
| xv = xu ),
inference(superposition,[status(thm)],[c_3881,c_57]) ).
cnf(c_3977,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3975,c_97,c_3891,c_3892,c_3876]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT381+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 04:35:32 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.29/1.14 % SZS status Started for theBenchmark.p
% 2.29/1.14 % SZS status Theorem for theBenchmark.p
% 2.29/1.14
% 2.29/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.29/1.14
% 2.29/1.14 ------ iProver source info
% 2.29/1.14
% 2.29/1.14 git: date: 2023-05-31 18:12:56 +0000
% 2.29/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.29/1.14 git: non_committed_changes: false
% 2.29/1.14 git: last_make_outside_of_git: false
% 2.29/1.14
% 2.29/1.14 ------ Parsing...
% 2.29/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.29/1.14
% 2.29/1.14 ------ 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.29/1.14
% 2.29/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.29/1.14
% 2.29/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.29/1.14 ------ Proving...
% 2.29/1.14 ------ Problem Properties
% 2.29/1.14
% 2.29/1.14
% 2.29/1.14 clauses 38
% 2.29/1.14 conjectures 1
% 2.29/1.14 EPR 23
% 2.29/1.14 Horn 31
% 2.29/1.14 unary 8
% 2.29/1.14 binary 6
% 2.29/1.14 lits 126
% 2.29/1.14 lits eq 2
% 2.29/1.14 fd_pure 0
% 2.29/1.14 fd_pseudo 0
% 2.29/1.14 fd_cond 0
% 2.29/1.14 fd_pseudo_cond 1
% 2.29/1.14 AC symbols 0
% 2.29/1.14
% 2.29/1.14 ------ Schedule dynamic 5 is on
% 2.29/1.14
% 2.29/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.29/1.14
% 2.29/1.14
% 2.29/1.14 ------
% 2.29/1.14 Current options:
% 2.29/1.14 ------
% 2.29/1.14
% 2.29/1.14
% 2.29/1.14
% 2.29/1.14
% 2.29/1.14 ------ Proving...
% 2.29/1.14
% 2.29/1.14
% 2.29/1.14 % SZS status Theorem for theBenchmark.p
% 2.29/1.14
% 2.29/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.29/1.14
% 2.29/1.14
%------------------------------------------------------------------------------