TSTP Solution File: SWC257+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC257+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 : n025.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:55 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 8 unt; 0 def)
% Number of atoms : 298 ( 105 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 359 ( 108 ~; 108 |; 124 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 65 ( 33 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f290,plain,
$false,
inference(avatar_sat_refutation,[],[f220,f258,f266,f286,f289]) ).
fof(f289,plain,
( ~ spl16_1
| spl16_7 ),
inference(avatar_contradiction_clause,[],[f288]) ).
fof(f288,plain,
( $false
| ~ spl16_1
| spl16_7 ),
inference(subsumption_resolution,[],[f287,f243]) ).
fof(f243,plain,
( nil != sK4
| spl16_7 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f242,plain,
( spl16_7
<=> nil = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl16_7])]) ).
fof(f287,plain,
( nil = sK4
| ~ spl16_1 ),
inference(backward_demodulation,[],[f174,f215]) ).
fof(f215,plain,
( nil = sK6
| ~ spl16_1 ),
inference(avatar_component_clause,[],[f213]) ).
fof(f213,plain,
( spl16_1
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl16_1])]) ).
fof(f174,plain,
sK6 = sK4,
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
( ssList(sK5)
& ( ( nil = sK6
& nil = sK7 )
| ( ! [X5] :
( sK8 = X5
| ~ ssItem(X5)
| ~ memberP(sK7,X5)
| ~ leq(sK8,X5) )
& ssItem(sK8)
& cons(sK8,nil) = sK6
& memberP(sK7,sK8) ) )
& ~ totalorderedP(sK4)
& sK5 = sK7
& sK6 = sK4
& ssList(sK7)
& ssList(sK6)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8])],[f110,f135,f134,f133,f132,f131]) ).
fof(f131,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ~ totalorderedP(X0)
& X1 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ~ totalorderedP(sK4)
& X1 = X3
& sK4 = X2
& ssList(X3) )
& ssList(X2) ) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ~ totalorderedP(sK4)
& X1 = X3
& sK4 = X2
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK5)
& ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ~ totalorderedP(sK4)
& sK5 = X3
& sK4 = X2
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ~ totalorderedP(sK4)
& sK5 = X3
& sK4 = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = sK6
& memberP(X3,X4) ) )
& ~ totalorderedP(sK4)
& sK5 = X3
& sK6 = sK4
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = sK6
& memberP(X3,X4) ) )
& ~ totalorderedP(sK4)
& sK5 = X3
& sK6 = sK4
& ssList(X3) )
=> ( ( ( nil = sK6
& nil = sK7 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(sK7,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = sK6
& memberP(sK7,X4) ) )
& ~ totalorderedP(sK4)
& sK5 = sK7
& sK6 = sK4
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(sK7,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = sK6
& memberP(sK7,X4) )
=> ( ! [X5] :
( sK8 = X5
| ~ ssItem(X5)
| ~ memberP(sK7,X5)
| ~ leq(sK8,X5) )
& ssItem(sK8)
& cons(sK8,nil) = sK6
& memberP(sK7,sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ~ totalorderedP(X0)
& X1 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != X2 ) )
| ~ ssList(X3)
| totalorderedP(X0)
| X1 != X3
| X0 != X2 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != X2 ) )
| ~ ssList(X3)
| totalorderedP(X0)
| X1 != X3
| X0 != X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f286,plain,
( ~ spl16_2
| ~ spl16_6 ),
inference(avatar_contradiction_clause,[],[f285]) ).
fof(f285,plain,
( $false
| ~ spl16_2
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f284,f176]) ).
fof(f176,plain,
~ totalorderedP(sK4),
inference(cnf_transformation,[],[f136]) ).
fof(f284,plain,
( totalorderedP(sK4)
| ~ spl16_2
| ~ spl16_6 ),
inference(forward_demodulation,[],[f275,f238]) ).
fof(f238,plain,
( cons(sK8,nil) = sK4
| ~ spl16_6 ),
inference(avatar_component_clause,[],[f236]) ).
fof(f236,plain,
( spl16_6
<=> cons(sK8,nil) = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl16_6])]) ).
fof(f275,plain,
( totalorderedP(cons(sK8,nil))
| ~ spl16_2 ),
inference(unit_resulting_resolution,[],[f195,f219,f208]) ).
fof(f208,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f162]) ).
fof(f162,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| totalorderedP(cons(X0,X1))
| nil != X1 ),
inference(cnf_transformation,[],[f128]) ).
fof(f128,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil = X1
| ( leq(X0,hd(X1))
& nil != X1
& totalorderedP(X1) )
| ~ totalorderedP(cons(X0,X1)) )
& ( totalorderedP(cons(X0,X1))
| ( nil != X1
& ( ~ leq(X0,hd(X1))
| nil = X1
| ~ totalorderedP(X1) ) ) ) ) ) ),
inference(flattening,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil = X1
| ( leq(X0,hd(X1))
& nil != X1
& totalorderedP(X1) )
| ~ totalorderedP(cons(X0,X1)) )
& ( totalorderedP(cons(X0,X1))
| ( nil != X1
& ( ~ leq(X0,hd(X1))
| nil = X1
| ~ totalorderedP(X1) ) ) ) ) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil = X1
| ( leq(X0,hd(X1))
& nil != X1
& totalorderedP(X1) ) )
<=> totalorderedP(cons(X0,X1)) ) ) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( nil = X1
| ( leq(X0,hd(X1))
& nil != X1
& totalorderedP(X1) ) )
<=> totalorderedP(cons(X0,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax67) ).
fof(f219,plain,
( ssItem(sK8)
| ~ spl16_2 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f217,plain,
( spl16_2
<=> ssItem(sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_2])]) ).
fof(f195,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f266,plain,
~ spl16_7,
inference(avatar_contradiction_clause,[],[f265]) ).
fof(f265,plain,
( $false
| ~ spl16_7 ),
inference(subsumption_resolution,[],[f261,f186]) ).
fof(f186,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax66) ).
fof(f261,plain,
( ~ totalorderedP(nil)
| ~ spl16_7 ),
inference(backward_demodulation,[],[f176,f244]) ).
fof(f244,plain,
( nil = sK4
| ~ spl16_7 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f258,plain,
( spl16_6
| spl16_7 ),
inference(avatar_split_clause,[],[f257,f242,f236]) ).
fof(f257,plain,
( nil = sK4
| cons(sK8,nil) = sK4 ),
inference(forward_demodulation,[],[f256,f174]) ).
fof(f256,plain,
( cons(sK8,nil) = sK4
| nil = sK6 ),
inference(forward_demodulation,[],[f182,f174]) ).
fof(f182,plain,
( cons(sK8,nil) = sK6
| nil = sK6 ),
inference(cnf_transformation,[],[f136]) ).
fof(f220,plain,
( spl16_1
| spl16_2 ),
inference(avatar_split_clause,[],[f183,f217,f213]) ).
fof(f183,plain,
( ssItem(sK8)
| nil = sK6 ),
inference(cnf_transformation,[],[f136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC257+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.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.20/0.35 % WCLimit : 300
% 0.20/0.35 % DateTime : Tue Aug 30 18:48:30 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.20/0.51 % (993)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.52 % (998)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)
% 0.20/0.52 % (1009)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)
% 0.20/0.52 % (1009)Instruction limit reached!
% 0.20/0.52 % (1009)------------------------------
% 0.20/0.52 % (1009)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (1009)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (1009)Termination reason: Unknown
% 0.20/0.52 % (1009)Termination phase: Preprocessing 3
% 0.20/0.52
% 0.20/0.52 % (1009)Memory used [KB]: 1535
% 0.20/0.52 % (1009)Time elapsed: 0.003 s
% 0.20/0.52 % (1009)Instructions burned: 3 (million)
% 0.20/0.52 % (1009)------------------------------
% 0.20/0.52 % (1009)------------------------------
% 0.20/0.52 % (1007)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.53 % (998)First to succeed.
% 0.20/0.53 % (1000)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.20/0.53 % (1030)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.53 % (999)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)
% 0.20/0.53 % (1015)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)
% 0.20/0.54 % (1010)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)
% 0.20/0.54 % (1027)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)
% 0.20/0.54 % (1001)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)
% 0.20/0.54 % (1029)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.20/0.54 % (996)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.54 % (997)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.20/0.54 % (1016)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54 % (1006)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.54 % (997)Instruction limit reached!
% 0.20/0.54 % (997)------------------------------
% 0.20/0.54 % (997)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (997)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (997)Termination reason: Unknown
% 0.20/0.54 % (997)Termination phase: Preprocessing 3
% 0.20/0.54
% 0.20/0.54 % (997)Memory used [KB]: 1663
% 0.20/0.54 % (997)Time elapsed: 0.003 s
% 0.20/0.54 % (997)Instructions burned: 4 (million)
% 0.20/0.54 % (997)------------------------------
% 0.20/0.54 % (997)------------------------------
% 0.20/0.55 % (998)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (998)------------------------------
% 0.20/0.55 % (998)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (998)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (998)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (998)Memory used [KB]: 6140
% 0.20/0.55 % (998)Time elapsed: 0.105 s
% 0.20/0.55 % (998)Instructions burned: 7 (million)
% 0.20/0.55 % (998)------------------------------
% 0.20/0.55 % (998)------------------------------
% 0.20/0.55 % (992)Success in time 0.188 s
%------------------------------------------------------------------------------