TSTP Solution File: SWC094+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC094+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 : n021.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:46 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 9 unt; 0 def)
% Number of atoms : 255 ( 111 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 344 ( 134 ~; 112 |; 79 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 99 ( 69 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f193,plain,
$false,
inference(avatar_sat_refutation,[],[f177,f180,f192]) ).
fof(f192,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(avatar_contradiction_clause,[],[f191]) ).
fof(f191,plain,
( $false
| ~ spl8_1
| ~ spl8_2 ),
inference(subsumption_resolution,[],[f190,f139]) ).
fof(f139,plain,
ssList(sK5),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
( ssList(sK2)
& ssList(sK4)
& sK4 = sK5
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != sK3
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2 )
| ~ ssList(X5) ) )
& ssList(sK5)
& sK3 = sK5
& sK4 = sK2
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f112,f124,f123,f122,f121]) ).
fof(f121,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X2 = X3
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| ~ ssList(X6)
| app(app(X4,X5),X6) != X0 )
| ~ ssList(X5) ) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) )
=> ( ssList(sK2)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X2 = X3
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2 )
| ~ ssList(X5) ) )
& ssList(X3)
& X1 = X3
& sK2 = X2 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X2 = X3
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2 )
| ~ ssList(X5) ) )
& ssList(X3)
& X1 = X3
& sK2 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( X2 = X3
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != sK3
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2 )
| ~ ssList(X5) ) )
& ssList(X3)
& sK3 = X3
& sK2 = X2 ) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X2 = X3
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != sK3
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2 )
| ~ ssList(X5) ) )
& ssList(X3)
& sK3 = X3
& sK2 = X2 ) )
=> ( ssList(sK4)
& ? [X3] :
( sK4 = X3
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != sK3
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2 )
| ~ ssList(X5) ) )
& ssList(X3)
& sK3 = X3
& sK4 = sK2 ) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X3] :
( sK4 = X3
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != sK3
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2 )
| ~ ssList(X5) ) )
& ssList(X3)
& sK3 = X3
& sK4 = sK2 )
=> ( sK4 = sK5
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != sK3
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2 )
| ~ ssList(X5) ) )
& ssList(sK5)
& sK3 = sK5
& sK4 = sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f112,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X2 = X3
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| ~ ssList(X6)
| app(app(X4,X5),X6) != X0 )
| ~ ssList(X5) ) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| ~ ssList(X6)
| app(app(X4,X5),X6) != X0 )
| ~ ssList(X5) ) )
& X2 = X3
& X0 = X2
& 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] :
( ssList(X4)
& ? [X5] :
( ? [X6] :
( app(app(X4,X5),X6) = X0
& app(X4,X6) = X1
& ssList(X6) )
& ssList(X5) ) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ? [X6] :
( app(app(X4,X5),X6) = X0
& app(X4,X6) = X1
& ssList(X6) )
& ssList(X5) ) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f190,plain,
( ~ ssList(sK5)
| ~ spl8_1
| ~ spl8_2 ),
inference(equality_resolution,[],[f189]) ).
fof(f189,plain,
( ! [X0] :
( sK5 != X0
| ~ ssList(X0) )
| ~ spl8_1
| ~ spl8_2 ),
inference(duplicate_literal_removal,[],[f186]) ).
fof(f186,plain,
( ! [X0] :
( sK5 != X0
| ~ ssList(X0)
| ~ ssList(X0) )
| ~ spl8_1
| ~ spl8_2 ),
inference(superposition,[],[f183,f145]) ).
fof(f145,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f183,plain,
( ! [X0] :
( app(nil,X0) != sK5
| ~ ssList(X0) )
| ~ spl8_1
| ~ spl8_2 ),
inference(subsumption_resolution,[],[f182,f171]) ).
fof(f171,plain,
( ssList(nil)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f170,plain,
( spl8_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f182,plain,
( ! [X0] :
( ~ ssList(nil)
| app(nil,X0) != sK5
| ~ ssList(X0) )
| ~ spl8_2 ),
inference(duplicate_literal_removal,[],[f181]) ).
fof(f181,plain,
( ! [X0] :
( app(nil,X0) != sK5
| app(nil,X0) != sK5
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(nil) )
| ~ spl8_2 ),
inference(superposition,[],[f179,f176]) ).
fof(f176,plain,
( nil = app(nil,nil)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f174]) ).
fof(f174,plain,
( spl8_2
<=> nil = app(nil,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
fof(f179,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK5
| ~ ssList(X6)
| ~ ssList(X5)
| app(X4,X6) != sK5
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f163,f164]) ).
fof(f164,plain,
sK5 = sK2,
inference(definition_unfolding,[],[f137,f141]) ).
fof(f141,plain,
sK4 = sK5,
inference(cnf_transformation,[],[f125]) ).
fof(f137,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f125]) ).
fof(f163,plain,
! [X6,X4,X5] :
( ~ ssList(X6)
| ~ ssList(X5)
| app(X4,X6) != sK5
| app(app(X4,X5),X6) != sK2
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f140,f138]) ).
fof(f138,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f125]) ).
fof(f140,plain,
! [X6,X4,X5] :
( ~ ssList(X4)
| app(X4,X6) != sK3
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK2
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f125]) ).
fof(f180,plain,
spl8_1,
inference(avatar_split_clause,[],[f147,f170]) ).
fof(f147,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f177,plain,
( ~ spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f168,f174,f170]) ).
fof(f168,plain,
( nil = app(nil,nil)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f167]) ).
fof(f167,plain,
( ~ ssList(nil)
| nil = app(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f166]) ).
fof(f166,plain,
! [X1] :
( ~ ssList(nil)
| nil = app(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(equality_resolution,[],[f151]) ).
fof(f151,plain,
! [X0,X1] :
( ~ ssList(X0)
| nil = app(X0,X1)
| nil != X0
| nil != X1
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X0
| nil != X1 ) )
| ~ ssList(X1) ) ),
inference(flattening,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X0
| nil != X1 ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( nil = X0
& nil = X1 )
<=> nil = app(X0,X1) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( nil = X0
& nil = X1 )
<=> nil = app(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC094+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.34 % Computer : n021.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:10:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (3094)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.50 % (3096)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)
% 0.20/0.50 % (3102)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (3094)First to succeed.
% 0.20/0.51 % (3113)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)
% 0.20/0.51 % (3094)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (3094)------------------------------
% 0.20/0.51 % (3094)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (3094)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (3094)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (3094)Memory used [KB]: 6012
% 0.20/0.51 % (3094)Time elapsed: 0.099 s
% 0.20/0.51 % (3094)Instructions burned: 4 (million)
% 0.20/0.51 % (3094)------------------------------
% 0.20/0.51 % (3094)------------------------------
% 0.20/0.51 % (3083)Success in time 0.162 s
%------------------------------------------------------------------------------