TSTP Solution File: LAT388+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LAT388+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : Fri May 3 02:35:40 EDT 2024
% Result : Theorem 1.09s 1.17s
% Output : CNFRefutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 143 ( 4 equ)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 171 ( 48 ~; 33 |; 73 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 1 sgn 31 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
=> sdtlseqdt0(xp,X0) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X0] :
( aElementOf0(X0,xT)
=> sdtlseqdt0(X0,xp) )
& aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).
fof(f31,conjecture,
? [X0] :
( aSupremumOfIn0(X0,xT,xS)
| ( ! [X1] :
( ( aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) )
=> sdtlseqdt0(X0,X1) )
& ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
& aElementOf0(X0,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f32,negated_conjecture,
~ ? [X0] :
( aSupremumOfIn0(X0,xT,xS)
| ( ! [X1] :
( ( aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) )
=> sdtlseqdt0(X0,X1) )
& ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
& aElementOf0(X0,xS) ) ),
inference(negated_conjecture,[],[f31]) ).
fof(f41,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
=> sdtlseqdt0(xp,X0) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,xp) )
& aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(rectify,[],[f30]) ).
fof(f42,plain,
~ ? [X0] :
( aSupremumOfIn0(X0,xT,xS)
| ( ! [X1] :
( ( aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) )
=> sdtlseqdt0(X0,X1) )
& ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X0) )
& aElementOf0(X0,xS) ) )
& aElementOf0(X0,xS) ) ),
inference(rectify,[],[f32]) ).
fof(f77,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( sdtlseqdt0(xp,X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
| ~ aElementOf0(X0,xS) ) ) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,xp)
| ~ aElementOf0(X2,xT) )
& aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(ennf_transformation,[],[f41]) ).
fof(f78,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,xT) )
& aElementOf0(X1,xS) )
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X3] :
( ~ sdtlseqdt0(X3,X0)
& aElementOf0(X3,xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f79,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,xT) )
& aElementOf0(X1,xS) )
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X3] :
( ~ sdtlseqdt0(X3,X0)
& aElementOf0(X3,xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(flattening,[],[f78]) ).
fof(f84,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,xT) )
& aElementOf0(X1,xS) )
| ~ sP3(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f85,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( sP3(X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X3] :
( ~ sdtlseqdt0(X3,X0)
& aElementOf0(X3,xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(definition_folding,[],[f79,f84]) ).
fof(f145,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
=> ( ~ sdtlseqdt0(sK21(X0),X0)
& aElementOf0(sK21(X0),xT) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( sdtlseqdt0(xp,X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ( ~ sdtlseqdt0(sK21(X0),X0)
& aElementOf0(sK21(X0),xT) )
| ~ aElementOf0(X0,xS) ) ) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,xp)
| ~ aElementOf0(X2,xT) )
& aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK21])],[f77,f145]) ).
fof(f150,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( sP3(X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(rectify,[],[f85]) ).
fof(f151,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
=> ( ~ sdtlseqdt0(sK23(X0),X0)
& aElementOf0(sK23(X0),xT) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( sP3(X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ( ~ sdtlseqdt0(sK23(X0),X0)
& aElementOf0(sK23(X0),xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK23])],[f150,f151]) ).
fof(f268,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[],[f146]) ).
fof(f276,plain,
! [X0] : ~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[],[f152]) ).
cnf(c_156,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[],[f268]) ).
cnf(c_169,negated_conjecture,
~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[],[f276]) ).
cnf(c_624,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_156,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LAT388+4 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 2 17:39:51 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.09/1.17 % SZS status Started for theBenchmark.p
% 1.09/1.17 % SZS status Theorem for theBenchmark.p
% 1.09/1.17
% 1.09/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.09/1.17
% 1.09/1.17 ------ iProver source info
% 1.09/1.17
% 1.09/1.17 git: date: 2024-05-02 19:28:25 +0000
% 1.09/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.09/1.17 git: non_committed_changes: false
% 1.09/1.17
% 1.09/1.17 ------ Parsing...
% 1.09/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.09/1.17
% 1.09/1.17 ------ Preprocessing...
% 1.09/1.17
% 1.09/1.17 % SZS status Theorem for theBenchmark.p
% 1.09/1.17
% 1.09/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.09/1.17
% 1.09/1.17
%------------------------------------------------------------------------------