TSTP Solution File: SWC019+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC019+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 : n028.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:14 EDT 2022
% Result : Theorem 1.70s 0.58s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 12 unt; 0 def)
% Number of atoms : 239 ( 86 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 313 ( 120 ~; 89 |; 85 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 60 ( 34 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f184,plain,
$false,
inference(avatar_sat_refutation,[],[f165,f177,f183]) ).
fof(f183,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_contradiction_clause,[],[f182]) ).
fof(f182,plain,
( $false
| ~ spl5_1
| spl5_2 ),
inference(subsumption_resolution,[],[f181,f164]) ).
fof(f164,plain,
( nil != sK3
| spl5_2 ),
inference(avatar_component_clause,[],[f162]) ).
fof(f162,plain,
( spl5_2
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f181,plain,
( nil = sK3
| ~ spl5_1 ),
inference(backward_demodulation,[],[f150,f159]) ).
fof(f159,plain,
( nil = sK2
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f158,plain,
( spl5_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f150,plain,
sK3 = sK2,
inference(definition_unfolding,[],[f134,f138]) ).
fof(f138,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
( ssList(sK1)
& ssList(sK3)
& ! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) )
& sK4 = sK2
& sK1 = sK3
& ssList(sK4)
& ( nil != sK1
| nil != sK2 )
& sK4 = sK3
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f111,f121,f120,f119,f118]) ).
fof(f118,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& X1 = X3
& X0 = X2
& ssList(X3)
& ( nil != X0
| nil != X1 )
& X2 = X3 ) )
& ssList(X1) ) )
=> ( ssList(sK1)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& X1 = X3
& sK1 = X2
& ssList(X3)
& ( nil != sK1
| nil != X1 )
& X2 = X3 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& X1 = X3
& sK1 = X2
& ssList(X3)
& ( nil != sK1
| nil != X1 )
& X2 = X3 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) )
& sK2 = X3
& sK1 = X2
& ssList(X3)
& ( nil != sK1
| nil != sK2 )
& X2 = X3 ) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) )
& sK2 = X3
& sK1 = X2
& ssList(X3)
& ( nil != sK1
| nil != sK2 )
& X2 = X3 ) )
=> ( ssList(sK3)
& ? [X3] :
( ! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) )
& sK2 = X3
& sK1 = sK3
& ssList(X3)
& ( nil != sK1
| nil != sK2 )
& sK3 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X3] :
( ! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) )
& sK2 = X3
& sK1 = sK3
& ssList(X3)
& ( nil != sK1
| nil != sK2 )
& sK3 = X3 )
=> ( ! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) )
& sK4 = sK2
& sK1 = sK3
& ssList(sK4)
& ( nil != sK1
| nil != sK2 )
& sK4 = sK3 ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& X1 = X3
& X0 = X2
& ssList(X3)
& ( nil != X0
| nil != X1 )
& X2 = X3 ) )
& ssList(X1) ) ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& X2 = X3
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& 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)
=> ( ( nil = X0
& nil = X1 )
| X2 != X3
| X1 != X3
| X0 != X2
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X0
& nil = X1 )
| X2 != X3
| X1 != X3
| X0 != X2
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f134,plain,
sK4 = sK3,
inference(cnf_transformation,[],[f122]) ).
fof(f177,plain,
spl5_1,
inference(avatar_split_clause,[],[f174,f158]) ).
fof(f174,plain,
nil = sK2,
inference(subsumption_resolution,[],[f173,f124]) ).
fof(f124,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f173,plain,
( ~ ssList(nil)
| nil = sK2 ),
inference(subsumption_resolution,[],[f172,f155]) ).
fof(f155,plain,
ssList(sK2),
inference(forward_demodulation,[],[f140,f150]) ).
fof(f140,plain,
ssList(sK3),
inference(cnf_transformation,[],[f122]) ).
fof(f172,plain,
( ~ ssList(sK2)
| nil = sK2
| ~ ssList(nil) ),
inference(resolution,[],[f171,f143]) ).
fof(f143,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f171,plain,
~ neq(sK2,nil),
inference(subsumption_resolution,[],[f170,f155]) ).
fof(f170,plain,
( ~ neq(sK2,nil)
| ~ ssList(sK2) ),
inference(duplicate_literal_removal,[],[f168]) ).
fof(f168,plain,
( ~ ssList(sK2)
| ~ ssList(sK2)
| ~ neq(sK2,nil) ),
inference(resolution,[],[f167,f127]) ).
fof(f127,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f167,plain,
! [X4] :
( ~ frontsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(duplicate_literal_removal,[],[f166]) ).
fof(f166,plain,
! [X4] :
( ~ frontsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f147,f150]) ).
fof(f147,plain,
! [X4] :
( ~ ssList(X4)
| ~ frontsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK3,X4) ),
inference(definition_unfolding,[],[f139,f137]) ).
fof(f137,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f122]) ).
fof(f139,plain,
! [X4] :
( ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f122]) ).
fof(f165,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f149,f162,f158]) ).
fof(f149,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f135,f137]) ).
fof(f135,plain,
( nil != sK1
| nil != sK2 ),
inference(cnf_transformation,[],[f122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC019+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 18:05:49 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.49/0.55 % (26056)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)
% 1.49/0.56 % (26045)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.49/0.57 % (26048)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.70/0.57 % (26045)First to succeed.
% 1.70/0.58 % (26045)Refutation found. Thanks to Tanya!
% 1.70/0.58 % SZS status Theorem for theBenchmark
% 1.70/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.70/0.58 % (26045)------------------------------
% 1.70/0.58 % (26045)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.70/0.58 % (26045)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.70/0.58 % (26045)Termination reason: Refutation
% 1.70/0.58
% 1.70/0.58 % (26045)Memory used [KB]: 6012
% 1.70/0.58 % (26045)Time elapsed: 0.142 s
% 1.70/0.58 % (26045)Instructions burned: 3 (million)
% 1.70/0.58 % (26045)------------------------------
% 1.70/0.58 % (26045)------------------------------
% 1.70/0.58 % (26043)Success in time 0.224 s
%------------------------------------------------------------------------------