TSTP Solution File: SWC185+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC185+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 : n014.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:39:25 EDT 2022
% Result : Theorem 1.61s 0.57s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 9 unt; 0 def)
% Number of atoms : 342 ( 70 equ)
% Maximal formula atoms : 36 ( 8 avg)
% Number of connectives : 440 ( 139 ~; 118 |; 160 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 138 ( 62 !; 76 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f237,plain,
$false,
inference(avatar_sat_refutation,[],[f223,f229,f236]) ).
fof(f236,plain,
~ spl13_4,
inference(avatar_contradiction_clause,[],[f235]) ).
fof(f235,plain,
( $false
| ~ spl13_4 ),
inference(subsumption_resolution,[],[f234,f171]) ).
fof(f171,plain,
ssList(sK6),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ssList(sK0)
& ssList(sK2)
& ssItem(sK4)
& ( memberP(sK5,sK4)
| memberP(sK6,sK4) )
& sK0 = app(app(sK5,cons(sK4,nil)),sK6)
& ssList(sK6)
& ssList(sK5)
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != sK2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(sK3)
& sK3 = sK1
& sK2 = sK0
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f126,f133,f132,f131,f130,f129,f128,f127]) ).
fof(f127,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != X2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) )
=> ( ssList(sK0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != X2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(X3)
& X1 = X3
& sK0 = X2 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != X2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(X3)
& X1 = X3
& sK0 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != X2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(X3)
& sK1 = X3
& sK0 = X2 ) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != X2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(X3)
& sK1 = X3
& sK0 = X2 ) )
=> ( ssList(sK2)
& ? [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != sK2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(X3)
& sK1 = X3
& sK2 = sK0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != sK2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(X3)
& sK1 = X3
& sK2 = sK0 )
=> ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != sK2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(sK3)
& sK3 = sK1
& sK2 = sK0 ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) ) )
=> ( ssItem(sK4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,sK4)
| memberP(X6,sK4) )
& sK0 = app(app(X5,cons(sK4,nil)),X6)
& ssList(X6) )
& ssList(X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X5] :
( ? [X6] :
( ( memberP(X5,sK4)
| memberP(X6,sK4) )
& sK0 = app(app(X5,cons(sK4,nil)),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ( memberP(sK5,sK4)
| memberP(X6,sK4) )
& app(app(sK5,cons(sK4,nil)),X6) = sK0
& ssList(X6) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X6] :
( ( memberP(sK5,sK4)
| memberP(X6,sK4) )
& app(app(sK5,cons(sK4,nil)),X6) = sK0
& ssList(X6) )
=> ( ( memberP(sK5,sK4)
| memberP(sK6,sK4) )
& sK0 = app(app(sK5,cons(sK4,nil)),sK6)
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ( memberP(X5,X4)
| memberP(X6,X4) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != X2
| ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) ) ) ) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) ),
inference(rectify,[],[f110]) ).
fof(f110,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ? [X9] :
( ( memberP(X8,X7)
| memberP(X9,X7) )
& app(app(X8,cons(X7,nil)),X9) = X0
& ssList(X9) )
& ssList(X8) ) )
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X2
| ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) ) ) ) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) ),
inference(flattening,[],[f109]) ).
fof(f109,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X2
| ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) ) ) ) )
& X0 = X2
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ( memberP(X8,X7)
| memberP(X9,X7) )
& app(app(X8,cons(X7,nil)),X9) = X0
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) )
& 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)
=> ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6)
& ( memberP(X5,X4)
| memberP(X6,X4) ) ) ) )
| X0 != X2
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) )
| app(app(X8,cons(X7,nil)),X9) != X0 ) ) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6)
& ( memberP(X5,X4)
| memberP(X6,X4) ) ) ) )
| X0 != X2
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ( ~ memberP(X8,X7)
& ~ memberP(X9,X7) )
| app(app(X8,cons(X7,nil)),X9) != X0 ) ) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f234,plain,
( ~ ssList(sK6)
| ~ spl13_4 ),
inference(subsumption_resolution,[],[f233,f170]) ).
fof(f170,plain,
ssList(sK5),
inference(cnf_transformation,[],[f134]) ).
fof(f233,plain,
( ~ ssList(sK5)
| ~ ssList(sK6)
| ~ spl13_4 ),
inference(subsumption_resolution,[],[f232,f222]) ).
fof(f222,plain,
( memberP(sK6,sK4)
| ~ spl13_4 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f220,plain,
( spl13_4
<=> memberP(sK6,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_4])]) ).
fof(f232,plain,
( ~ memberP(sK6,sK4)
| ~ ssList(sK6)
| ~ ssList(sK5) ),
inference(subsumption_resolution,[],[f231,f174]) ).
fof(f174,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f134]) ).
fof(f231,plain,
( ~ ssItem(sK4)
| ~ memberP(sK6,sK4)
| ~ ssList(sK6)
| ~ ssList(sK5) ),
inference(trivial_inequality_removal,[],[f230]) ).
fof(f230,plain,
( sK0 != sK0
| ~ ssList(sK6)
| ~ memberP(sK6,sK4)
| ~ ssItem(sK4)
| ~ ssList(sK5) ),
inference(superposition,[],[f197,f172]) ).
fof(f172,plain,
sK0 = app(app(sK5,cons(sK4,nil)),sK6),
inference(cnf_transformation,[],[f134]) ).
fof(f197,plain,
! [X8,X9,X7] :
( app(app(X8,cons(X7,nil)),X9) != sK0
| ~ ssItem(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| ~ memberP(X9,X7) ),
inference(definition_unfolding,[],[f168,f165]) ).
fof(f165,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f134]) ).
fof(f168,plain,
! [X8,X9,X7] :
( ~ ssItem(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != sK2
| ~ memberP(X9,X7) ),
inference(cnf_transformation,[],[f134]) ).
fof(f229,plain,
~ spl13_3,
inference(avatar_split_clause,[],[f228,f216]) ).
fof(f216,plain,
( spl13_3
<=> memberP(sK5,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_3])]) ).
fof(f228,plain,
~ memberP(sK5,sK4),
inference(subsumption_resolution,[],[f227,f174]) ).
fof(f227,plain,
( ~ ssItem(sK4)
| ~ memberP(sK5,sK4) ),
inference(subsumption_resolution,[],[f226,f171]) ).
fof(f226,plain,
( ~ memberP(sK5,sK4)
| ~ ssList(sK6)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f225,f170]) ).
fof(f225,plain,
( ~ ssList(sK5)
| ~ ssList(sK6)
| ~ ssItem(sK4)
| ~ memberP(sK5,sK4) ),
inference(trivial_inequality_removal,[],[f224]) ).
fof(f224,plain,
( ~ memberP(sK5,sK4)
| ~ ssList(sK6)
| ~ ssItem(sK4)
| sK0 != sK0
| ~ ssList(sK5) ),
inference(superposition,[],[f196,f172]) ).
fof(f196,plain,
! [X8,X9,X7] :
( app(app(X8,cons(X7,nil)),X9) != sK0
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ memberP(X8,X7) ),
inference(definition_unfolding,[],[f169,f165]) ).
fof(f169,plain,
! [X8,X9,X7] :
( ~ ssItem(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != sK2
| ~ memberP(X8,X7) ),
inference(cnf_transformation,[],[f134]) ).
fof(f223,plain,
( spl13_3
| spl13_4 ),
inference(avatar_split_clause,[],[f173,f220,f216]) ).
fof(f173,plain,
( memberP(sK6,sK4)
| memberP(sK5,sK4) ),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC185+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 18:33:03 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.41/0.55 % (7595)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.61/0.56 % (7585)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.61/0.56 % (7577)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.61/0.56 % (7593)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 1.61/0.56 % (7587)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.61/0.56 % (7579)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)
% 1.61/0.57 % (7585)Instruction limit reached!
% 1.61/0.57 % (7585)------------------------------
% 1.61/0.57 % (7585)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.61/0.57 % (7585)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.61/0.57 % (7585)Termination reason: Unknown
% 1.61/0.57 % (7585)Termination phase: Naming
% 1.61/0.57
% 1.61/0.57 % (7585)Memory used [KB]: 1535
% 1.61/0.57 % (7585)Time elapsed: 0.005 s
% 1.61/0.57 % (7585)Instructions burned: 3 (million)
% 1.61/0.57 % (7585)------------------------------
% 1.61/0.57 % (7585)------------------------------
% 1.61/0.57 % (7577)First to succeed.
% 1.61/0.57 % (7577)Refutation found. Thanks to Tanya!
% 1.61/0.57 % SZS status Theorem for theBenchmark
% 1.61/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.61/0.57 % (7577)------------------------------
% 1.61/0.57 % (7577)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.61/0.57 % (7577)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.61/0.57 % (7577)Termination reason: Refutation
% 1.61/0.57
% 1.61/0.57 % (7577)Memory used [KB]: 6140
% 1.61/0.57 % (7577)Time elapsed: 0.141 s
% 1.61/0.57 % (7577)Instructions burned: 5 (million)
% 1.61/0.57 % (7577)------------------------------
% 1.61/0.57 % (7577)------------------------------
% 1.61/0.57 % (7570)Success in time 0.232 s
%------------------------------------------------------------------------------