TSTP Solution File: SWC086+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC086+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:38:42 EDT 2022
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 65 ( 6 unt; 0 def)
% Number of atoms : 325 ( 70 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 396 ( 136 ~; 131 |; 107 &)
% ( 8 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 57 ( 31 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f277,plain,
$false,
inference(avatar_sat_refutation,[],[f234,f239,f244,f249,f250,f255,f262,f276]) ).
fof(f276,plain,
( ~ spl10_3
| ~ spl10_7 ),
inference(avatar_contradiction_clause,[],[f275]) ).
fof(f275,plain,
( $false
| ~ spl10_3
| ~ spl10_7 ),
inference(subsumption_resolution,[],[f274,f229]) ).
fof(f229,plain,
( neq(sK8,nil)
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f227,plain,
( spl10_3
<=> neq(sK8,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f274,plain,
( ~ neq(sK8,nil)
| ~ spl10_7 ),
inference(subsumption_resolution,[],[f273,f181]) ).
fof(f181,plain,
ssList(sK8),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
( ssList(sK6)
& ( ( nil = sK8
& nil = sK9 )
| ( segmentP(sK9,sK8)
& neq(sK8,nil) ) )
& ssList(sK9)
& sK9 = sK7
& neq(sK7,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) )
& sK6 = sK8
& ssList(sK8)
& ssList(sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f123,f147,f146,f145,f144]) ).
fof(f144,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& X1 = X3
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK6)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& X1 = X3
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) )
& sK6 = X2 )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& X1 = X3
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) )
& sK6 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& sK7 = X3
& neq(sK7,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) )
& sK6 = X2 )
& ssList(X2) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& sK7 = X3
& neq(sK7,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) )
& sK6 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK8
& nil = X3 )
| ( segmentP(X3,sK8)
& neq(sK8,nil) ) )
& ssList(X3)
& sK7 = X3
& neq(sK7,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) )
& sK6 = sK8 )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X3] :
( ( ( nil = sK8
& nil = X3 )
| ( segmentP(X3,sK8)
& neq(sK8,nil) ) )
& ssList(X3)
& sK7 = X3
& neq(sK7,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) )
& sK6 = sK8 )
=> ( ( ( nil = sK8
& nil = sK9 )
| ( segmentP(sK9,sK8)
& neq(sK8,nil) ) )
& ssList(sK9)
& sK9 = sK7
& neq(sK7,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) )
& sK6 = sK8 ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& X1 = X3
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f122]) ).
fof(f122,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( nil = X2
& nil = X3 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) )
& X0 = X2
& neq(X1,nil)
& 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)
=> ( X1 != X3
| ( ( nil != X2
| nil != X3 )
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) )
| ? [X4] :
( segmentP(X0,X4)
& neq(X4,nil)
& segmentP(X1,X4)
& ssList(X4) )
| X0 != X2
| ~ neq(X1,nil) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( ( nil != X2
| nil != X3 )
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) )
| ? [X4] :
( segmentP(X0,X4)
& neq(X4,nil)
& segmentP(X1,X4)
& ssList(X4) )
| X0 != X2
| ~ neq(X1,nil) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f273,plain,
( ~ ssList(sK8)
| ~ neq(sK8,nil)
| ~ spl10_7 ),
inference(subsumption_resolution,[],[f272,f248]) ).
fof(f248,plain,
( segmentP(sK7,sK8)
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f246,plain,
( spl10_7
<=> segmentP(sK7,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f272,plain,
( ~ segmentP(sK7,sK8)
| ~ neq(sK8,nil)
| ~ ssList(sK8) ),
inference(duplicate_literal_removal,[],[f271]) ).
fof(f271,plain,
( ~ ssList(sK8)
| ~ neq(sK8,nil)
| ~ ssList(sK8)
| ~ segmentP(sK7,sK8) ),
inference(resolution,[],[f172,f206]) ).
fof(f206,plain,
! [X4] :
( ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK7,X4) ),
inference(definition_unfolding,[],[f183,f182]) ).
fof(f182,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f148]) ).
fof(f183,plain,
! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK6,X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) ),
inference(cnf_transformation,[],[f148]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f262,plain,
( ~ spl10_1
| ~ spl10_4
| ~ spl10_5
| ~ spl10_6 ),
inference(avatar_contradiction_clause,[],[f261]) ).
fof(f261,plain,
( $false
| ~ spl10_1
| ~ spl10_4
| ~ spl10_5
| ~ spl10_6 ),
inference(subsumption_resolution,[],[f260,f253]) ).
fof(f253,plain,
( neq(nil,nil)
| ~ spl10_6 ),
inference(backward_demodulation,[],[f184,f243]) ).
fof(f243,plain,
( nil = sK7
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl10_6
<=> nil = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f184,plain,
neq(sK7,nil),
inference(cnf_transformation,[],[f148]) ).
fof(f260,plain,
( ~ neq(nil,nil)
| ~ spl10_1
| ~ spl10_4
| ~ spl10_5
| ~ spl10_6 ),
inference(subsumption_resolution,[],[f259,f218]) ).
fof(f218,plain,
( ssList(nil)
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f217,plain,
( spl10_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f259,plain,
( ~ ssList(nil)
| ~ neq(nil,nil)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_6 ),
inference(resolution,[],[f238,f258]) ).
fof(f258,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl10_4
| ~ spl10_6 ),
inference(duplicate_literal_removal,[],[f257]) ).
fof(f257,plain,
( ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ segmentP(nil,X4) )
| ~ spl10_4
| ~ spl10_6 ),
inference(forward_demodulation,[],[f256,f233]) ).
fof(f233,plain,
( nil = sK8
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f231,plain,
( spl10_4
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f256,plain,
( ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK8,X4)
| ~ segmentP(nil,X4)
| ~ ssList(X4) )
| ~ spl10_6 ),
inference(forward_demodulation,[],[f206,f243]) ).
fof(f238,plain,
( segmentP(nil,nil)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f236]) ).
fof(f236,plain,
( spl10_5
<=> segmentP(nil,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f255,plain,
( spl10_1
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f254,f241,f217]) ).
fof(f254,plain,
( ssList(nil)
| ~ spl10_6 ),
inference(backward_demodulation,[],[f180,f243]) ).
fof(f180,plain,
ssList(sK7),
inference(cnf_transformation,[],[f148]) ).
fof(f250,plain,
( spl10_4
| spl10_7 ),
inference(avatar_split_clause,[],[f202,f246,f231]) ).
fof(f202,plain,
( segmentP(sK7,sK8)
| nil = sK8 ),
inference(definition_unfolding,[],[f190,f185]) ).
fof(f185,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f148]) ).
fof(f190,plain,
( nil = sK8
| segmentP(sK9,sK8) ),
inference(cnf_transformation,[],[f148]) ).
fof(f249,plain,
( spl10_7
| spl10_6 ),
inference(avatar_split_clause,[],[f203,f241,f246]) ).
fof(f203,plain,
( nil = sK7
| segmentP(sK7,sK8) ),
inference(definition_unfolding,[],[f188,f185,f185]) ).
fof(f188,plain,
( nil = sK9
| segmentP(sK9,sK8) ),
inference(cnf_transformation,[],[f148]) ).
fof(f244,plain,
( spl10_6
| spl10_3 ),
inference(avatar_split_clause,[],[f204,f227,f241]) ).
fof(f204,plain,
( neq(sK8,nil)
| nil = sK7 ),
inference(definition_unfolding,[],[f187,f185]) ).
fof(f187,plain,
( nil = sK9
| neq(sK8,nil) ),
inference(cnf_transformation,[],[f148]) ).
fof(f239,plain,
( spl10_5
| ~ spl10_1 ),
inference(avatar_split_clause,[],[f210,f217,f236]) ).
fof(f210,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f174]) ).
fof(f174,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f234,plain,
( spl10_3
| spl10_4 ),
inference(avatar_split_clause,[],[f189,f231,f227]) ).
fof(f189,plain,
( nil = sK8
| neq(sK8,nil) ),
inference(cnf_transformation,[],[f148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC086+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 18:20:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.49 % (11019)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)
% 0.18/0.49 % (11011)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.18/0.49 % (11003)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.18/0.49 % (11011)Instruction limit reached!
% 0.18/0.49 % (11011)------------------------------
% 0.18/0.49 % (11011)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (11011)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (11011)Termination reason: Unknown
% 0.18/0.49 % (11011)Termination phase: Preprocessing 3
% 0.18/0.49
% 0.18/0.49 % (11011)Memory used [KB]: 1535
% 0.18/0.49 % (11011)Time elapsed: 0.005 s
% 0.18/0.49 % (11011)Instructions burned: 3 (million)
% 0.18/0.49 % (11011)------------------------------
% 0.18/0.49 % (11011)------------------------------
% 0.18/0.49 % (11004)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)
% 0.18/0.50 % (11001)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.18/0.50 % (11003)First to succeed.
% 0.18/0.50 % (11019)Also succeeded, but the first one will report.
% 0.18/0.50 % (11003)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (11003)------------------------------
% 0.18/0.50 % (11003)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (11003)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (11003)Termination reason: Refutation
% 0.18/0.50
% 0.18/0.50 % (11003)Memory used [KB]: 6140
% 0.18/0.50 % (11003)Time elapsed: 0.068 s
% 0.18/0.50 % (11003)Instructions burned: 5 (million)
% 0.18/0.50 % (11003)------------------------------
% 0.18/0.50 % (11003)------------------------------
% 0.18/0.50 % (10996)Success in time 0.161 s
%------------------------------------------------------------------------------