TSTP Solution File: LAT382+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LAT382+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n007.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 Aug 31 17:35:39 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 22 unt; 0 def)
% Number of atoms : 145 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 160 ( 62 ~; 57 |; 29 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 75 ( 71 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f155,plain,
$false,
inference(unit_resulting_resolution,[],[f137,f130,f120,f141,f140,f112]) ).
fof(f112,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X0)
| ~ aElement0(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0) ),
inference(flattening,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X0)
& aElement0(X1) )
=> ( ( sdtlseqdt0(X0,X1)
& sdtlseqdt0(X1,X0) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
fof(f140,plain,
sdtlseqdt0(xu,xv),
inference(unit_resulting_resolution,[],[f125,f126,f83]) ).
fof(f83,plain,
! [X2,X0,X1,X4] :
( ~ sP0(X0,X1,X2)
| sdtlseqdt0(X4,X1)
| ~ aLowerBoundOfIn0(X4,X2,X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ~ aElementOf0(X1,X0)
| ~ aLowerBoundOfIn0(X1,X2,X0)
| ( aLowerBoundOfIn0(sK4(X0,X1,X2),X2,X0)
& ~ sdtlseqdt0(sK4(X0,X1,X2),X1) ) )
& ( ( aElementOf0(X1,X0)
& aLowerBoundOfIn0(X1,X2,X0)
& ! [X4] :
( ~ aLowerBoundOfIn0(X4,X2,X0)
| sdtlseqdt0(X4,X1) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f50,f51]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ? [X3] :
( aLowerBoundOfIn0(X3,X2,X0)
& ~ sdtlseqdt0(X3,X1) )
=> ( aLowerBoundOfIn0(sK4(X0,X1,X2),X2,X0)
& ~ sdtlseqdt0(sK4(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ~ aElementOf0(X1,X0)
| ~ aLowerBoundOfIn0(X1,X2,X0)
| ? [X3] :
( aLowerBoundOfIn0(X3,X2,X0)
& ~ sdtlseqdt0(X3,X1) ) )
& ( ( aElementOf0(X1,X0)
& aLowerBoundOfIn0(X1,X2,X0)
& ! [X4] :
( ~ aLowerBoundOfIn0(X4,X2,X0)
| sdtlseqdt0(X4,X1) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f49]) ).
fof(f49,plain,
! [X0,X2,X1] :
( ( sP0(X0,X2,X1)
| ~ aElementOf0(X2,X0)
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ? [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
& ~ sdtlseqdt0(X3,X2) ) )
& ( ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aLowerBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X3,X2) ) )
| ~ sP0(X0,X2,X1) ) ),
inference(flattening,[],[f48]) ).
fof(f48,plain,
! [X0,X2,X1] :
( ( sP0(X0,X2,X1)
| ~ aElementOf0(X2,X0)
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ? [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
& ~ sdtlseqdt0(X3,X2) ) )
& ( ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aLowerBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X3,X2) ) )
| ~ sP0(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X2,X1] :
( sP0(X0,X2,X1)
<=> ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aLowerBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X3,X2) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f126,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(unit_resulting_resolution,[],[f124,f84]) ).
fof(f84,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| aLowerBoundOfIn0(X1,X2,X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f124,plain,
sP0(xT,xu,xS),
inference(unit_resulting_resolution,[],[f122,f94,f81]) ).
fof(f81,plain,
! [X2,X0,X1] :
( ~ aInfimumOfIn0(X2,X0,X1)
| ~ sP1(X0,X1)
| sP0(X1,X2,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X0,X1)
| ~ sP0(X1,X2,X0) )
& ( sP0(X1,X2,X0)
| ~ aInfimumOfIn0(X2,X0,X1) ) )
| ~ sP1(X0,X1) ),
inference(rectify,[],[f46]) ).
fof(f46,plain,
! [X1,X0] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ~ sP0(X0,X2,X1) )
& ( sP0(X0,X2,X1)
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ sP1(X1,X0) ),
inference(nnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X1,X0] :
( ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> sP0(X0,X2,X1) )
| ~ sP1(X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f94,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
( aInfimumOfIn0(xv,xS,xT)
& aInfimumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__792) ).
fof(f122,plain,
sP1(xS,xT),
inference(unit_resulting_resolution,[],[f89,f96,f88]) ).
fof(f88,plain,
! [X0,X1] :
( ~ aSubsetOf0(X1,X0)
| sP1(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aSubsetOf0(X1,X0)
| sP1(X1,X0) ) ),
inference(definition_folding,[],[f32,f41,f40]) ).
fof(f32,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aLowerBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X3,X2) ) ) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( aElementOf0(X2,X0)
& ! [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefInf) ).
fof(f96,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f16,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773_01) ).
fof(f89,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
fof(f125,plain,
sP0(xT,xv,xS),
inference(unit_resulting_resolution,[],[f122,f95,f81]) ).
fof(f95,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f141,plain,
sdtlseqdt0(xv,xu),
inference(unit_resulting_resolution,[],[f124,f134,f83]) ).
fof(f134,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(unit_resulting_resolution,[],[f125,f84]) ).
fof(f120,plain,
xu != xv,
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
xu != xv,
inference(flattening,[],[f19]) ).
fof(f19,negated_conjecture,
xu != xv,
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f130,plain,
aElement0(xu),
inference(unit_resulting_resolution,[],[f89,f127,f97]) ).
fof(f97,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(f127,plain,
aElementOf0(xu,xT),
inference(unit_resulting_resolution,[],[f124,f85]) ).
fof(f85,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| aElementOf0(X1,X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f137,plain,
aElement0(xv),
inference(unit_resulting_resolution,[],[f89,f135,f97]) ).
fof(f135,plain,
aElementOf0(xv,xT),
inference(unit_resulting_resolution,[],[f125,f85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT382+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 01:11:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (25799)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.49 % (25815)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.50 % (25807)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.50 % (25799)First to succeed.
% 0.20/0.51 % (25798)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.51 % (25789)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.51 % (25796)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.51 % (25806)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51 % (25806)Instruction limit reached!
% 0.20/0.51 % (25806)------------------------------
% 0.20/0.51 % (25806)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (25806)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (25806)Termination reason: Unknown
% 0.20/0.51 % (25806)Termination phase: Preprocessing 3
% 0.20/0.51
% 0.20/0.51 % (25806)Memory used [KB]: 1407
% 0.20/0.51 % (25806)Time elapsed: 0.003 s
% 0.20/0.51 % (25806)Instructions burned: 2 (million)
% 0.20/0.51 % (25806)------------------------------
% 0.20/0.51 % (25806)------------------------------
% 0.20/0.51 % (25799)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (25799)------------------------------
% 0.20/0.51 % (25799)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (25799)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (25799)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (25799)Memory used [KB]: 6012
% 0.20/0.51 % (25799)Time elapsed: 0.107 s
% 0.20/0.51 % (25799)Instructions burned: 5 (million)
% 0.20/0.51 % (25799)------------------------------
% 0.20/0.51 % (25799)------------------------------
% 0.20/0.51 % (25787)Success in time 0.164 s
%------------------------------------------------------------------------------