TSTP Solution File: SWC209+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC209+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 : n027.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:37 EDT 2022
% Result : Theorem 1.27s 0.53s
% Output : Refutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 7 unt; 0 def)
% Number of atoms : 187 ( 62 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 193 ( 38 ~; 40 |; 100 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f662,plain,
$false,
inference(avatar_sat_refutation,[],[f642,f648,f655,f661]) ).
fof(f661,plain,
( ~ spl57_8
| spl57_9
| ~ spl57_10 ),
inference(avatar_contradiction_clause,[],[f660]) ).
fof(f660,plain,
( $false
| ~ spl57_8
| spl57_9
| ~ spl57_10 ),
inference(subsumption_resolution,[],[f658,f656]) ).
fof(f656,plain,
( neq(nil,nil)
| ~ spl57_8 ),
inference(backward_demodulation,[],[f560,f636]) ).
fof(f636,plain,
( nil = sK22
| ~ spl57_8 ),
inference(avatar_component_clause,[],[f634]) ).
fof(f634,plain,
( spl57_8
<=> nil = sK22 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_8])]) ).
fof(f560,plain,
neq(sK22,nil),
inference(definition_unfolding,[],[f408,f409]) ).
fof(f409,plain,
sK20 = sK22,
inference(cnf_transformation,[],[f263]) ).
fof(f263,plain,
( ssList(sK21)
& sK20 = sK22
& neq(sK20,nil)
& ( ( nil = sK22
& nil = sK21 )
| ( segmentP(sK22,sK21)
& neq(sK21,nil) ) )
& ssList(sK22)
& ~ neq(sK19,nil)
& sK21 = sK19
& ssList(sK20)
& ssList(sK19) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20,sK21,sK22])],[f139,f262,f261,f260,f259]) ).
fof(f259,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ( ( nil = X3
& nil = X2 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ~ neq(X0,nil)
& X0 = X2 ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ( ( nil = X3
& nil = X2 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ~ neq(sK19,nil)
& sK19 = X2 ) )
& ssList(X1) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f260,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ( ( nil = X3
& nil = X2 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ~ neq(sK19,nil)
& sK19 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK20 = X3
& neq(sK20,nil)
& ( ( nil = X3
& nil = X2 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ~ neq(sK19,nil)
& sK19 = X2 ) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f261,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK20 = X3
& neq(sK20,nil)
& ( ( nil = X3
& nil = X2 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ~ neq(sK19,nil)
& sK19 = X2 ) )
=> ( ssList(sK21)
& ? [X3] :
( sK20 = X3
& neq(sK20,nil)
& ( ( nil = X3
& nil = sK21 )
| ( segmentP(X3,sK21)
& neq(sK21,nil) ) )
& ssList(X3)
& ~ neq(sK19,nil)
& sK21 = sK19 ) ) ),
introduced(choice_axiom,[]) ).
fof(f262,plain,
( ? [X3] :
( sK20 = X3
& neq(sK20,nil)
& ( ( nil = X3
& nil = sK21 )
| ( segmentP(X3,sK21)
& neq(sK21,nil) ) )
& ssList(X3)
& ~ neq(sK19,nil)
& sK21 = sK19 )
=> ( sK20 = sK22
& neq(sK20,nil)
& ( ( nil = sK22
& nil = sK21 )
| ( segmentP(sK22,sK21)
& neq(sK21,nil) ) )
& ssList(sK22)
& ~ neq(sK19,nil)
& sK21 = sK19 ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ( ( nil = X3
& nil = X2 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ~ neq(X0,nil)
& X0 = X2 ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f138]) ).
fof(f138,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X3
& nil = X2 )
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& X0 = X2
& ~ neq(X0,nil)
& neq(X1,nil)
& 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)
=> ( ( ( nil != X2
| nil != X3 )
& ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) ) )
| X0 != X2
| neq(X0,nil)
| ~ neq(X1,nil)
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) ) )
| X0 != X2
| neq(X0,nil)
| ~ neq(X1,nil)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f408,plain,
neq(sK20,nil),
inference(cnf_transformation,[],[f263]) ).
fof(f658,plain,
( ~ neq(nil,nil)
| spl57_9
| ~ spl57_10 ),
inference(backward_demodulation,[],[f640,f646]) ).
fof(f646,plain,
( nil = sK19
| ~ spl57_10 ),
inference(avatar_component_clause,[],[f644]) ).
fof(f644,plain,
( spl57_10
<=> nil = sK19 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_10])]) ).
fof(f640,plain,
( ~ neq(sK19,nil)
| spl57_9 ),
inference(avatar_component_clause,[],[f639]) ).
fof(f639,plain,
( spl57_9
<=> neq(sK19,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_9])]) ).
fof(f655,plain,
~ spl57_9,
inference(avatar_split_clause,[],[f402,f639]) ).
fof(f402,plain,
~ neq(sK19,nil),
inference(cnf_transformation,[],[f263]) ).
fof(f648,plain,
( spl57_10
| spl57_9 ),
inference(avatar_split_clause,[],[f564,f639,f644]) ).
fof(f564,plain,
( neq(sK19,nil)
| nil = sK19 ),
inference(definition_unfolding,[],[f404,f401,f401]) ).
fof(f401,plain,
sK21 = sK19,
inference(cnf_transformation,[],[f263]) ).
fof(f404,plain,
( nil = sK21
| neq(sK21,nil) ),
inference(cnf_transformation,[],[f263]) ).
fof(f642,plain,
( spl57_9
| spl57_8 ),
inference(avatar_split_clause,[],[f562,f634,f639]) ).
fof(f562,plain,
( nil = sK22
| neq(sK19,nil) ),
inference(definition_unfolding,[],[f406,f401]) ).
fof(f406,plain,
( nil = sK22
| neq(sK21,nil) ),
inference(cnf_transformation,[],[f263]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC209+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/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.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 18:49:31 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (25912)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.27/0.52 % (25917)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)
% 1.27/0.52 % (25912)First to succeed.
% 1.27/0.52 % (25937)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)
% 1.27/0.53 % (25918)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)
% 1.27/0.53 % (25921)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 1.27/0.53 % (25912)Refutation found. Thanks to Tanya!
% 1.27/0.53 % SZS status Theorem for theBenchmark
% 1.27/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 1.27/0.53 % (25912)------------------------------
% 1.27/0.53 % (25912)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.27/0.53 % (25912)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.27/0.53 % (25912)Termination reason: Refutation
% 1.27/0.53
% 1.27/0.53 % (25912)Memory used [KB]: 6396
% 1.27/0.53 % (25912)Time elapsed: 0.105 s
% 1.27/0.53 % (25912)Instructions burned: 12 (million)
% 1.27/0.53 % (25912)------------------------------
% 1.27/0.53 % (25912)------------------------------
% 1.27/0.53 % (25911)Success in time 0.176 s
%------------------------------------------------------------------------------