TSTP Solution File: SWC405+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC405+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 : 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 : Wed Aug 31 18:41:00 EDT 2022
% Result : Theorem 1.37s 0.56s
% Output : Refutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 192 ( 28 equ)
% Maximal formula atoms : 28 ( 9 avg)
% Number of connectives : 234 ( 63 ~; 48 |; 108 &)
% ( 0 <=>; 15 =>; 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 : 60 ( 23 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f209,plain,
$false,
inference(subsumption_resolution,[],[f208,f178]) ).
fof(f178,plain,
~ memberP(sK5,sK8),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
( ssList(sK4)
& ssList(sK5)
& sK7 = sK5
& sK4 = sK6
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(sK6,X4)
| memberP(sK7,X4) )
& ( ~ memberP(sK7,X4)
| memberP(sK6,X4) ) ) )
& memberP(sK4,sK8)
& ssItem(sK8)
& ~ memberP(sK5,sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8])],[f111,f140,f139,f138,f137,f136]) ).
fof(f136,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) ) )
& ? [X5] :
( memberP(X0,X5)
& ssItem(X5)
& ~ memberP(X1,X5) )
& ssList(X3) )
& ssList(X2) ) ) )
=> ( ssList(sK4)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& sK4 = X2
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) ) )
& ? [X5] :
( memberP(sK4,X5)
& ssItem(X5)
& ~ memberP(X1,X5) )
& ssList(X3) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& sK4 = X2
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) ) )
& ? [X5] :
( memberP(sK4,X5)
& ssItem(X5)
& ~ memberP(X1,X5) )
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK5)
& ? [X2] :
( ? [X3] :
( sK5 = X3
& sK4 = X2
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) ) )
& ? [X5] :
( memberP(sK4,X5)
& ssItem(X5)
& ~ memberP(sK5,X5) )
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
( ? [X2] :
( ? [X3] :
( sK5 = X3
& sK4 = X2
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) ) )
& ? [X5] :
( memberP(sK4,X5)
& ssItem(X5)
& ~ memberP(sK5,X5) )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( sK5 = X3
& sK4 = sK6
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(sK6,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(sK6,X4) ) ) )
& ? [X5] :
( memberP(sK4,X5)
& ssItem(X5)
& ~ memberP(sK5,X5) )
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X3] :
( sK5 = X3
& sK4 = sK6
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(sK6,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(sK6,X4) ) ) )
& ? [X5] :
( memberP(sK4,X5)
& ssItem(X5)
& ~ memberP(sK5,X5) )
& ssList(X3) )
=> ( sK7 = sK5
& sK4 = sK6
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(sK6,X4)
| memberP(sK7,X4) )
& ( ~ memberP(sK7,X4)
| memberP(sK6,X4) ) ) )
& ? [X5] :
( memberP(sK4,X5)
& ssItem(X5)
& ~ memberP(sK5,X5) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X5] :
( memberP(sK4,X5)
& ssItem(X5)
& ~ memberP(sK5,X5) )
=> ( memberP(sK4,sK8)
& ssItem(sK8)
& ~ memberP(sK5,sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) ) )
& ? [X5] :
( memberP(X0,X5)
& ssItem(X5)
& ~ memberP(X1,X5) )
& ssList(X3) )
& ssList(X2) ) ) ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) ) )
& ? [X5] :
( ~ memberP(X1,X5)
& memberP(X0,X5)
& ssItem(X5) )
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ? [X4] :
( ssItem(X4)
& ( ( memberP(X2,X4)
& ~ memberP(X3,X4) )
| ( ~ memberP(X2,X4)
& memberP(X3,X4) ) ) )
| ! [X5] :
( ssItem(X5)
=> ( memberP(X1,X5)
| ~ memberP(X0,X5) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ? [X4] :
( ssItem(X4)
& ( ( memberP(X2,X4)
& ~ memberP(X3,X4) )
| ( ~ memberP(X2,X4)
& memberP(X3,X4) ) ) )
| ! [X5] :
( ssItem(X5)
=> ( memberP(X1,X5)
| ~ memberP(X0,X5) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f208,plain,
memberP(sK5,sK8),
inference(subsumption_resolution,[],[f207,f179]) ).
fof(f179,plain,
ssItem(sK8),
inference(cnf_transformation,[],[f141]) ).
fof(f207,plain,
( ~ ssItem(sK8)
| memberP(sK5,sK8) ),
inference(resolution,[],[f191,f193]) ).
fof(f193,plain,
memberP(sK6,sK8),
inference(definition_unfolding,[],[f180,f183]) ).
fof(f183,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f141]) ).
fof(f180,plain,
memberP(sK4,sK8),
inference(cnf_transformation,[],[f141]) ).
fof(f191,plain,
! [X4] :
( ~ memberP(sK6,X4)
| ~ ssItem(X4)
| memberP(sK5,X4) ),
inference(definition_unfolding,[],[f182,f184]) ).
fof(f184,plain,
sK7 = sK5,
inference(cnf_transformation,[],[f141]) ).
fof(f182,plain,
! [X4] :
( ~ ssItem(X4)
| ~ memberP(sK6,X4)
| memberP(sK7,X4) ),
inference(cnf_transformation,[],[f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC405+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 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 : Tue Aug 30 18:18:05 EDT 2022
% 0.15/0.37 % CPUTime :
% 1.20/0.53 % (25674)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 1.20/0.54 % (25658)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 1.37/0.55 % (25650)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)
% 1.37/0.55 % (25677)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 1.37/0.55 % (25666)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.37/0.55 % (25666)Instruction limit reached!
% 1.37/0.55 % (25666)------------------------------
% 1.37/0.55 % (25666)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.37/0.55 % (25666)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.37/0.55 % (25666)Termination reason: Unknown
% 1.37/0.55 % (25666)Termination phase: Naming
% 1.37/0.55
% 1.37/0.55 % (25666)Memory used [KB]: 1535
% 1.37/0.55 % (25666)Time elapsed: 0.004 s
% 1.37/0.55 % (25666)Instructions burned: 3 (million)
% 1.37/0.55 % (25666)------------------------------
% 1.37/0.55 % (25666)------------------------------
% 1.37/0.55 % (25664)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.37/0.55 % (25653)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.37/0.56 % (25652)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.37/0.56 % (25674)First to succeed.
% 1.37/0.56 % (25654)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)
% 1.37/0.56 % (25655)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.37/0.56 % (25656)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.37/0.56 % (25669)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.37/0.56 % (25674)Refutation found. Thanks to Tanya!
% 1.37/0.56 % SZS status Theorem for theBenchmark
% 1.37/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.37/0.56 % (25674)------------------------------
% 1.37/0.56 % (25674)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.37/0.56 % (25674)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.37/0.56 % (25674)Termination reason: Refutation
% 1.37/0.56
% 1.37/0.56 % (25674)Memory used [KB]: 6140
% 1.37/0.56 % (25674)Time elapsed: 0.131 s
% 1.37/0.56 % (25674)Instructions burned: 5 (million)
% 1.37/0.56 % (25674)------------------------------
% 1.37/0.56 % (25674)------------------------------
% 1.37/0.56 % (25648)Success in time 0.187 s
%------------------------------------------------------------------------------