TSTP Solution File: SWC411+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC411+1 : TPTP v8.1.0. Released v2.4.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 : n010.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 18:41:02 EDT 2022
% Result : Theorem 0.21s 0.56s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 190 ( 32 equ)
% Maximal formula atoms : 24 ( 8 avg)
% Number of connectives : 226 ( 59 ~; 41 |; 106 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 72 ( 29 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f229,plain,
$false,
inference(subsumption_resolution,[],[f228,f171]) ).
fof(f171,plain,
ssItem(sK8),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
( ssList(sK4)
& ssList(sK5)
& sK5 = sK7
& ssList(sK7)
& ! [X4] :
( ~ ssItem(X4)
| memberP(sK6,X4)
| ~ memberP(sK7,X4) )
& sK6 = sK4
& ssItem(sK8)
& memberP(sK5,sK8)
& ~ memberP(sK4,sK8)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8])],[f137,f142,f141,f140,f139,f138]) ).
fof(f138,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| memberP(X2,X4)
| ~ memberP(X3,X4) )
& X0 = X2
& ? [X5] :
( ssItem(X5)
& memberP(X1,X5)
& ~ memberP(X0,X5) ) )
& ssList(X2) ) ) )
=> ( ssList(sK4)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| memberP(X2,X4)
| ~ memberP(X3,X4) )
& sK4 = X2
& ? [X5] :
( ssItem(X5)
& memberP(X1,X5)
& ~ memberP(sK4,X5) ) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| memberP(X2,X4)
| ~ memberP(X3,X4) )
& sK4 = X2
& ? [X5] :
( ssItem(X5)
& memberP(X1,X5)
& ~ memberP(sK4,X5) ) )
& ssList(X2) ) )
=> ( ssList(sK5)
& ? [X2] :
( ? [X3] :
( sK5 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| memberP(X2,X4)
| ~ memberP(X3,X4) )
& sK4 = X2
& ? [X5] :
( ssItem(X5)
& memberP(sK5,X5)
& ~ memberP(sK4,X5) ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X2] :
( ? [X3] :
( sK5 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| memberP(X2,X4)
| ~ memberP(X3,X4) )
& sK4 = X2
& ? [X5] :
( ssItem(X5)
& memberP(sK5,X5)
& ~ memberP(sK4,X5) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK5 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| memberP(sK6,X4)
| ~ memberP(X3,X4) )
& sK6 = sK4
& ? [X5] :
( ssItem(X5)
& memberP(sK5,X5)
& ~ memberP(sK4,X5) ) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X3] :
( sK5 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| memberP(sK6,X4)
| ~ memberP(X3,X4) )
& sK6 = sK4
& ? [X5] :
( ssItem(X5)
& memberP(sK5,X5)
& ~ memberP(sK4,X5) ) )
=> ( sK5 = sK7
& ssList(sK7)
& ! [X4] :
( ~ ssItem(X4)
| memberP(sK6,X4)
| ~ memberP(sK7,X4) )
& sK6 = sK4
& ? [X5] :
( ssItem(X5)
& memberP(sK5,X5)
& ~ memberP(sK4,X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X5] :
( ssItem(X5)
& memberP(sK5,X5)
& ~ memberP(sK4,X5) )
=> ( ssItem(sK8)
& memberP(sK5,sK8)
& ~ memberP(sK4,sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| memberP(X2,X4)
| ~ memberP(X3,X4) )
& X0 = X2
& ? [X5] :
( ssItem(X5)
& memberP(X1,X5)
& ~ memberP(X0,X5) ) )
& ssList(X2) ) ) ),
inference(rectify,[],[f100]) ).
fof(f100,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ! [X5] :
( ~ ssItem(X5)
| memberP(X2,X5)
| ~ memberP(X3,X5) )
& X0 = X2
& ? [X4] :
( ssItem(X4)
& memberP(X1,X4)
& ~ memberP(X0,X4) ) )
& ssList(X2) ) ) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X5] :
( ~ ssItem(X5)
| memberP(X2,X5)
| ~ memberP(X3,X5) )
& X0 = X2
& X1 = X3
& ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X5] :
( ssItem(X5)
& ~ memberP(X2,X5)
& memberP(X3,X5) )
| X0 != X2
| X1 != X3
| ! [X4] :
( ssItem(X4)
=> ( memberP(X0,X4)
| ~ memberP(X1,X4) ) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X0,X5) ) )
| ? [X4] :
( ~ memberP(X2,X4)
& ssItem(X4)
& memberP(X3,X4) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X0,X5) ) )
| ? [X4] :
( ~ memberP(X2,X4)
& ssItem(X4)
& memberP(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f228,plain,
~ ssItem(sK8),
inference(subsumption_resolution,[],[f227,f169]) ).
fof(f169,plain,
~ memberP(sK4,sK8),
inference(cnf_transformation,[],[f143]) ).
fof(f227,plain,
( memberP(sK4,sK8)
| ~ ssItem(sK8) ),
inference(resolution,[],[f192,f193]) ).
fof(f193,plain,
memberP(sK7,sK8),
inference(definition_unfolding,[],[f170,f175]) ).
fof(f175,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f143]) ).
fof(f170,plain,
memberP(sK5,sK8),
inference(cnf_transformation,[],[f143]) ).
fof(f192,plain,
! [X4] :
( ~ memberP(sK7,X4)
| ~ ssItem(X4)
| memberP(sK4,X4) ),
inference(definition_unfolding,[],[f173,f172]) ).
fof(f172,plain,
sK6 = sK4,
inference(cnf_transformation,[],[f143]) ).
fof(f173,plain,
! [X4] :
( ~ ssItem(X4)
| memberP(sK6,X4)
| ~ memberP(sK7,X4) ),
inference(cnf_transformation,[],[f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC411+1 : TPTP v8.1.0. Released v2.4.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.14/0.34 % Computer : n010.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 : Tue Aug 30 18:46:59 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.55 % (29832)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.55 % (29829)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.55 % (29832)First to succeed.
% 0.21/0.55 % (29829)Instruction limit reached!
% 0.21/0.55 % (29829)------------------------------
% 0.21/0.55 % (29829)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (29829)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (29829)Termination reason: Unknown
% 0.21/0.55 % (29829)Termination phase: Preprocessing 3
% 0.21/0.55
% 0.21/0.55 % (29829)Memory used [KB]: 1535
% 0.21/0.55 % (29829)Time elapsed: 0.004 s
% 0.21/0.55 % (29829)Instructions burned: 3 (million)
% 0.21/0.55 % (29829)------------------------------
% 0.21/0.55 % (29829)------------------------------
% 0.21/0.56 % (29853)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.56 % (29846)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.21/0.56 % (29832)Refutation found. Thanks to Tanya!
% 0.21/0.56 % SZS status Theorem for theBenchmark
% 0.21/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.56 % (29832)------------------------------
% 0.21/0.56 % (29832)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56 % (29832)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56 % (29832)Termination reason: Refutation
% 0.21/0.56
% 0.21/0.56 % (29832)Memory used [KB]: 1663
% 0.21/0.56 % (29832)Time elapsed: 0.125 s
% 0.21/0.56 % (29832)Instructions burned: 4 (million)
% 0.21/0.56 % (29832)------------------------------
% 0.21/0.56 % (29832)------------------------------
% 0.21/0.56 % (29826)Success in time 0.21 s
%------------------------------------------------------------------------------