TSTP Solution File: SWC406+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC406+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_sat --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:43:40 EDT 2022
% Result : Theorem 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 346 ( 64 equ)
% Maximal formula atoms : 44 ( 14 avg)
% Number of connectives : 454 ( 132 ~; 111 |; 187 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 102 ( 44 !; 58 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f606,plain,
$false,
inference(subsumption_resolution,[],[f605,f436]) ).
fof(f436,plain,
ssItem(sK31),
inference(cnf_transformation,[],[f288]) ).
fof(f288,plain,
( ssList(sK26)
& ssList(sK27)
& sK26 = sK28
& ! [X4] :
( ( ( ( leq(sK30(X4),X4)
& ssItem(sK30(X4))
& sK30(X4) != X4
& memberP(sK29,sK30(X4)) )
| ~ memberP(sK29,X4)
| memberP(sK28,X4) )
& ( ~ memberP(sK28,X4)
| ( memberP(sK29,X4)
& ! [X6] :
( ~ memberP(sK29,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(sK29)
& memberP(sK26,sK31)
& ~ memberP(sK27,sK31)
& ssItem(sK31)
& sK27 = sK29
& ssList(sK28) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26,sK27,sK28,sK29,sK30,sK31])],[f281,f287,f286,f285,f284,f283,f282]) ).
fof(f282,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(X3,X5) )
| ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| ( memberP(X3,X4)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(X0,X7)
& ~ memberP(X1,X7)
& ssItem(X7) )
& X1 = X3 )
& ssList(X2) ) ) )
=> ( ssList(sK26)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK26 = X2
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(X3,X5) )
| ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| ( memberP(X3,X4)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(sK26,X7)
& ~ memberP(X1,X7)
& ssItem(X7) )
& X1 = X3 )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f283,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK26 = X2
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(X3,X5) )
| ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| ( memberP(X3,X4)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(sK26,X7)
& ~ memberP(X1,X7)
& ssItem(X7) )
& X1 = X3 )
& ssList(X2) ) )
=> ( ssList(sK27)
& ? [X2] :
( ? [X3] :
( sK26 = X2
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(X3,X5) )
| ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| ( memberP(X3,X4)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(sK26,X7)
& ~ memberP(sK27,X7)
& ssItem(X7) )
& sK27 = X3 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f284,plain,
( ? [X2] :
( ? [X3] :
( sK26 = X2
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(X3,X5) )
| ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| ( memberP(X3,X4)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(sK26,X7)
& ~ memberP(sK27,X7)
& ssItem(X7) )
& sK27 = X3 )
& ssList(X2) )
=> ( ? [X3] :
( sK26 = sK28
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(X3,X5) )
| ~ memberP(X3,X4)
| memberP(sK28,X4) )
& ( ~ memberP(sK28,X4)
| ( memberP(X3,X4)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(sK26,X7)
& ~ memberP(sK27,X7)
& ssItem(X7) )
& sK27 = X3 )
& ssList(sK28) ) ),
introduced(choice_axiom,[]) ).
fof(f285,plain,
( ? [X3] :
( sK26 = sK28
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(X3,X5) )
| ~ memberP(X3,X4)
| memberP(sK28,X4) )
& ( ~ memberP(sK28,X4)
| ( memberP(X3,X4)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(sK26,X7)
& ~ memberP(sK27,X7)
& ssItem(X7) )
& sK27 = X3 )
=> ( sK26 = sK28
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(sK29,X5) )
| ~ memberP(sK29,X4)
| memberP(sK28,X4) )
& ( ~ memberP(sK28,X4)
| ( memberP(sK29,X4)
& ! [X6] :
( ~ memberP(sK29,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(sK29)
& ? [X7] :
( memberP(sK26,X7)
& ~ memberP(sK27,X7)
& ssItem(X7) )
& sK27 = sK29 ) ),
introduced(choice_axiom,[]) ).
fof(f286,plain,
! [X4] :
( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(sK29,X5) )
=> ( leq(sK30(X4),X4)
& ssItem(sK30(X4))
& sK30(X4) != X4
& memberP(sK29,sK30(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f287,plain,
( ? [X7] :
( memberP(sK26,X7)
& ~ memberP(sK27,X7)
& ssItem(X7) )
=> ( memberP(sK26,sK31)
& ~ memberP(sK27,sK31)
& ssItem(sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f281,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& ! [X4] :
( ( ( ? [X5] :
( leq(X5,X4)
& ssItem(X5)
& X4 != X5
& memberP(X3,X5) )
| ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| ( memberP(X3,X4)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ leq(X6,X4)
| X4 = X6
| ~ ssItem(X6) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(X0,X7)
& ~ memberP(X1,X7)
& ssItem(X7) )
& X1 = X3 )
& ssList(X2) ) ) ),
inference(rectify,[],[f105]) ).
fof(f105,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& ! [X4] :
( ( ( ? [X6] :
( leq(X6,X4)
& ssItem(X6)
& X4 != X6
& memberP(X3,X6) )
| ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| ( memberP(X3,X4)
& ! [X5] :
( ~ memberP(X3,X5)
| ~ leq(X5,X4)
| X4 = X5
| ~ ssItem(X5) ) ) ) )
| ~ ssItem(X4) )
& ssList(X3)
& ? [X7] :
( memberP(X0,X7)
& ~ memberP(X1,X7)
& ssItem(X7) )
& X1 = X3 )
& ssList(X2) ) ) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X7] :
( memberP(X0,X7)
& ~ memberP(X1,X7)
& ssItem(X7) )
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ( ( memberP(X2,X4)
| ~ memberP(X3,X4)
| ? [X6] :
( memberP(X3,X6)
& X4 != X6
& leq(X6,X4)
& ssItem(X6) ) )
& ( ~ memberP(X2,X4)
| ( memberP(X3,X4)
& ! [X5] :
( ~ memberP(X3,X5)
| ~ leq(X5,X4)
| X4 = X5
| ~ ssItem(X5) ) ) ) ) )
& 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)
=> ( ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X0,X7)
| memberP(X1,X7) ) )
| X1 != X3
| X0 != X2
| ? [X4] :
( ssItem(X4)
& ( ( ~ memberP(X2,X4)
& memberP(X3,X4)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X3,X6)
| X4 = X6
| ~ leq(X6,X4) ) ) )
| ( ( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& leq(X5,X4)
& X4 != X5
& memberP(X3,X5) ) )
& memberP(X2,X4) ) ) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& leq(X5,X4)
& X4 != X5
& memberP(X3,X5) ) )
& memberP(X2,X4) )
| ( ~ memberP(X2,X4)
& memberP(X3,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X5,X4) ) ) ) )
& ssItem(X4) )
| X0 != X2
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X0,X6)
| memberP(X1,X6) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& leq(X5,X4)
& X4 != X5
& memberP(X3,X5) ) )
& memberP(X2,X4) )
| ( ~ memberP(X2,X4)
& memberP(X3,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X5,X4) ) ) ) )
& ssItem(X4) )
| X0 != X2
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X0,X6)
| memberP(X1,X6) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f605,plain,
~ ssItem(sK31),
inference(subsumption_resolution,[],[f604,f569]) ).
fof(f569,plain,
~ memberP(sK29,sK31),
inference(definition_unfolding,[],[f437,f435]) ).
fof(f435,plain,
sK27 = sK29,
inference(cnf_transformation,[],[f288]) ).
fof(f437,plain,
~ memberP(sK27,sK31),
inference(cnf_transformation,[],[f288]) ).
fof(f604,plain,
( memberP(sK29,sK31)
| ~ ssItem(sK31) ),
inference(resolution,[],[f441,f568]) ).
fof(f568,plain,
memberP(sK28,sK31),
inference(definition_unfolding,[],[f438,f446]) ).
fof(f446,plain,
sK26 = sK28,
inference(cnf_transformation,[],[f288]) ).
fof(f438,plain,
memberP(sK26,sK31),
inference(cnf_transformation,[],[f288]) ).
fof(f441,plain,
! [X4] :
( ~ memberP(sK28,X4)
| memberP(sK29,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f288]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC406+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_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n010.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 18:46:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.55 % (28642)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.56 % (28643)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.56 % (28660)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.56 % (28644)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.56 % (28658)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.56 % (28644)Instruction limit reached!
% 0.20/0.56 % (28644)------------------------------
% 0.20/0.56 % (28644)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (28659)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.56 % (28644)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (28644)Termination reason: Unknown
% 0.20/0.56 % (28644)Termination phase: Naming
% 0.20/0.56
% 0.20/0.56 % (28644)Memory used [KB]: 1023
% 0.20/0.56 % (28644)Time elapsed: 0.004 s
% 0.20/0.56 % (28644)Instructions burned: 3 (million)
% 0.20/0.56 % (28644)------------------------------
% 0.20/0.56 % (28644)------------------------------
% 0.20/0.57 % (28650)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.57 % (28652)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.57 % (28651)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.57 % (28643)Instruction limit reached!
% 0.20/0.57 % (28643)------------------------------
% 0.20/0.57 % (28643)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (28643)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (28643)Termination reason: Unknown
% 0.20/0.57 % (28643)Termination phase: Property scanning
% 0.20/0.57
% 0.20/0.57 % (28643)Memory used [KB]: 1279
% 0.20/0.57 % (28643)Time elapsed: 0.005 s
% 0.20/0.57 % (28643)Instructions burned: 7 (million)
% 0.20/0.57 % (28643)------------------------------
% 0.20/0.57 % (28643)------------------------------
% 0.20/0.58 % (28658)First to succeed.
% 0.20/0.58 % (28658)Refutation found. Thanks to Tanya!
% 0.20/0.58 % SZS status Theorem for theBenchmark
% 0.20/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.58 % (28658)------------------------------
% 0.20/0.58 % (28658)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (28658)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (28658)Termination reason: Refutation
% 0.20/0.58
% 0.20/0.58 % (28658)Memory used [KB]: 1407
% 0.20/0.58 % (28658)Time elapsed: 0.150 s
% 0.20/0.58 % (28658)Instructions burned: 11 (million)
% 0.20/0.58 % (28658)------------------------------
% 0.20/0.58 % (28658)------------------------------
% 0.20/0.58 % (28635)Success in time 0.227 s
%------------------------------------------------------------------------------