TSTP Solution File: LAT381+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LAT381+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n027.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 : Wed May 31 12:17:55 EDT 2023
% Result : Theorem 0.19s 0.34s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 15 unt; 0 def)
% Number of atoms : 147 ( 9 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 151 ( 47 ~; 44 |; 45 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 30 (; 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [W0,W1] :
( ( aElement0(W0)
& aElement0(W1) )
=> ( ( sdtlseqdt0(W0,W1)
& sdtlseqdt0(W1,W0) )
=> W0 = W1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [W0] :
( aElementOf0(W0,xS)
=> sdtlseqdt0(W0,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [W0] :
( ( ( aElementOf0(W0,xT)
& ! [W1] :
( aElementOf0(W1,xS)
=> sdtlseqdt0(W1,W0) ) )
| aUpperBoundOfIn0(W0,xS,xT) )
=> sdtlseqdt0(xu,W0) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [W0] :
( aElementOf0(W0,xS)
=> sdtlseqdt0(W0,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [W0] :
( ( ( aElementOf0(W0,xT)
& ! [W1] :
( aElementOf0(W1,xS)
=> sdtlseqdt0(W1,W0) ) )
| aUpperBoundOfIn0(W0,xS,xT) )
=> sdtlseqdt0(xv,W0) )
& aSupremumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
xu != xv,
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f25,plain,
! [W0] :
( ~ aSet0(W0)
| ! [W1] :
( ~ aElementOf0(W1,W0)
| aElement0(W1) ) ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f26,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aElementOf0(X1,X0)
| aElement0(X1) ),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f44,plain,
! [W0,W1] :
( ~ aElement0(W0)
| ~ aElement0(W1)
| ~ sdtlseqdt0(W0,W1)
| ~ sdtlseqdt0(W1,W0)
| W0 = W1 ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f45,plain,
! [X0,X1] :
( ~ aElement0(X0)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f44]) ).
fof(f82,plain,
aSet0(xT),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f87,plain,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [W0] :
( ~ aElementOf0(W0,xS)
| sdtlseqdt0(W0,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [W0] :
( ( ( ~ aElementOf0(W0,xT)
| ? [W1] :
( aElementOf0(W1,xS)
& ~ sdtlseqdt0(W1,W0) ) )
& ~ aUpperBoundOfIn0(W0,xS,xT) )
| sdtlseqdt0(xu,W0) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [W0] :
( ~ aElementOf0(W0,xS)
| sdtlseqdt0(W0,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [W0] :
( ( ( ~ aElementOf0(W0,xT)
| ? [W1] :
( aElementOf0(W1,xS)
& ~ sdtlseqdt0(W1,W0) ) )
& ~ aUpperBoundOfIn0(W0,xS,xT) )
| sdtlseqdt0(xv,W0) )
& aSupremumOfIn0(xv,xS,xT) ),
inference(pre_NNF_transformation,[status(esa)],[f16]) ).
fof(f88,plain,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [W0] :
( ~ aElementOf0(W0,xS)
| sdtlseqdt0(W0,xu) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [W0] :
( ( ( ~ aElementOf0(W0,xT)
| ( aElementOf0(sk0_6(W0),xS)
& ~ sdtlseqdt0(sk0_6(W0),W0) ) )
& ~ aUpperBoundOfIn0(W0,xS,xT) )
| sdtlseqdt0(xu,W0) )
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [W0] :
( ~ aElementOf0(W0,xS)
| sdtlseqdt0(W0,xv) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [W0] :
( ( ( ~ aElementOf0(W0,xT)
| ( aElementOf0(sk0_7(W0),xS)
& ~ sdtlseqdt0(sk0_7(W0),W0) ) )
& ~ aUpperBoundOfIn0(W0,xS,xT) )
| sdtlseqdt0(xv,W0) )
& aSupremumOfIn0(xv,xS,xT) ),
inference(skolemization,[status(esa)],[f87]) ).
fof(f89,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f92,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f95,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xu,X0) ),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f97,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f100,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f103,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xv,X0) ),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f105,plain,
xu != xv,
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f106,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[status(thm)],[f95,f100]) ).
fof(f109,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[status(thm)],[f103,f92]) ).
fof(f110,plain,
( spl0_0
<=> aSet0(xT) ),
introduced(split_symbol_definition) ).
fof(f112,plain,
( ~ aSet0(xT)
| spl0_0 ),
inference(component_clause,[status(thm)],[f110]) ).
fof(f113,plain,
( spl0_1
<=> aElement0(xv) ),
introduced(split_symbol_definition) ).
fof(f116,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(resolution,[status(thm)],[f26,f97]) ).
fof(f117,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f116,f110,f113]) ).
fof(f118,plain,
( spl0_2
<=> aElement0(xu) ),
introduced(split_symbol_definition) ).
fof(f121,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(resolution,[status(thm)],[f26,f89]) ).
fof(f122,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f121,f110,f118]) ).
fof(f123,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f112,f82]) ).
fof(f124,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f123]) ).
fof(f162,plain,
( spl0_10
<=> sdtlseqdt0(xu,xv) ),
introduced(split_symbol_definition) ).
fof(f164,plain,
( ~ sdtlseqdt0(xu,xv)
| spl0_10 ),
inference(component_clause,[status(thm)],[f162]) ).
fof(f165,plain,
( spl0_11
<=> xu = xv ),
introduced(split_symbol_definition) ).
fof(f166,plain,
( xu = xv
| ~ spl0_11 ),
inference(component_clause,[status(thm)],[f165]) ).
fof(f168,plain,
( ~ aElement0(xu)
| ~ aElement0(xv)
| ~ sdtlseqdt0(xu,xv)
| xu = xv ),
inference(resolution,[status(thm)],[f45,f109]) ).
fof(f169,plain,
( ~ spl0_2
| ~ spl0_1
| ~ spl0_10
| spl0_11 ),
inference(split_clause,[status(thm)],[f168,f118,f113,f162,f165]) ).
fof(f191,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f164,f106]) ).
fof(f192,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f191]) ).
fof(f197,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f166,f105]) ).
fof(f198,plain,
~ spl0_11,
inference(contradiction_clause,[status(thm)],[f197]) ).
fof(f199,plain,
$false,
inference(sat_refutation,[status(thm)],[f117,f122,f124,f169,f192,f198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT381+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.32 % Computer : n027.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 30 09:40:47 EDT 2023
% 0.13/0.32 % CPUTime :
% 0.19/0.33 % Drodi V3.5.1
% 0.19/0.34 % Refutation found
% 0.19/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.19/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.35 % Elapsed time: 0.023965 seconds
% 0.19/0.35 % CPU time: 0.034551 seconds
% 0.19/0.35 % Memory used: 11.831 MB
%------------------------------------------------------------------------------