TSTP Solution File: SWC385+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC385+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 : n004.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:40:51 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 161 ( 28 equ)
% Maximal formula atoms : 24 ( 7 avg)
% Number of connectives : 190 ( 51 ~; 36 |; 91 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f261,plain,
$false,
inference(subsumption_resolution,[],[f260,f209]) ).
fof(f209,plain,
segmentP(sK8,sK5),
inference(definition_unfolding,[],[f196,f193]) ).
fof(f193,plain,
sK7 = sK5,
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
( ( ~ neq(sK8,nil)
| singletonP(sK7) )
& sK6 = sK8
& ssList(sK8)
& segmentP(sK8,sK7)
& neq(sK6,nil)
& ( ~ singletonP(sK5)
| ~ segmentP(sK6,sK5) )
& sK7 = sK5
& ssList(sK7)
& ssList(sK6)
& ssList(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8])],[f129,f151,f150,f149,f148]) ).
fof(f148,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& X1 = X3
& ssList(X3)
& segmentP(X3,X2)
& neq(X1,nil)
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& X1 = X3
& ssList(X3)
& segmentP(X3,X2)
& neq(X1,nil)
& ( ~ singletonP(sK5)
| ~ segmentP(X1,sK5) )
& sK5 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& X1 = X3
& ssList(X3)
& segmentP(X3,X2)
& neq(X1,nil)
& ( ~ singletonP(sK5)
| ~ segmentP(X1,sK5) )
& sK5 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& sK6 = X3
& ssList(X3)
& segmentP(X3,X2)
& neq(sK6,nil)
& ( ~ singletonP(sK5)
| ~ segmentP(sK6,sK5) )
& sK5 = X2 )
& ssList(X2) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& sK6 = X3
& ssList(X3)
& segmentP(X3,X2)
& neq(sK6,nil)
& ( ~ singletonP(sK5)
| ~ segmentP(sK6,sK5) )
& sK5 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(sK7) )
& sK6 = X3
& ssList(X3)
& segmentP(X3,sK7)
& neq(sK6,nil)
& ( ~ singletonP(sK5)
| ~ segmentP(sK6,sK5) )
& sK7 = sK5 )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(sK7) )
& sK6 = X3
& ssList(X3)
& segmentP(X3,sK7)
& neq(sK6,nil)
& ( ~ singletonP(sK5)
| ~ segmentP(sK6,sK5) )
& sK7 = sK5 )
=> ( ( ~ neq(sK8,nil)
| singletonP(sK7) )
& sK6 = sK8
& ssList(sK8)
& segmentP(sK8,sK7)
& neq(sK6,nil)
& ( ~ singletonP(sK5)
| ~ segmentP(sK6,sK5) )
& sK7 = sK5 ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& X1 = X3
& ssList(X3)
& segmentP(X3,X2)
& neq(X1,nil)
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f128]) ).
fof(f128,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& neq(X1,nil)
& ( ~ neq(X3,nil)
| singletonP(X2) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& segmentP(X3,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)
=> ( X0 != X2
| ~ neq(X1,nil)
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ( singletonP(X0)
& segmentP(X1,X0) )
| ~ segmentP(X3,X2)
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ~ neq(X1,nil)
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ( singletonP(X0)
& segmentP(X1,X0) )
| ~ segmentP(X3,X2)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f196,plain,
segmentP(sK8,sK7),
inference(cnf_transformation,[],[f152]) ).
fof(f260,plain,
~ segmentP(sK8,sK5),
inference(subsumption_resolution,[],[f211,f255]) ).
fof(f255,plain,
singletonP(sK5),
inference(subsumption_resolution,[],[f208,f210]) ).
fof(f210,plain,
neq(sK8,nil),
inference(definition_unfolding,[],[f195,f198]) ).
fof(f198,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f152]) ).
fof(f195,plain,
neq(sK6,nil),
inference(cnf_transformation,[],[f152]) ).
fof(f208,plain,
( ~ neq(sK8,nil)
| singletonP(sK5) ),
inference(definition_unfolding,[],[f199,f193]) ).
fof(f199,plain,
( ~ neq(sK8,nil)
| singletonP(sK7) ),
inference(cnf_transformation,[],[f152]) ).
fof(f211,plain,
( ~ singletonP(sK5)
| ~ segmentP(sK8,sK5) ),
inference(definition_unfolding,[],[f194,f198]) ).
fof(f194,plain,
( ~ singletonP(sK5)
| ~ segmentP(sK6,sK5) ),
inference(cnf_transformation,[],[f152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC385+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.14 % 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 : n004.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 18:48:49 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.48 % (16136)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.49 % (16136)First to succeed.
% 0.20/0.49 % (16160)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.50 % (16152)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.50 % (16144)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 % (16136)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 % (16136)------------------------------
% 0.20/0.51 % (16136)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (16136)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (16136)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (16136)Memory used [KB]: 1663
% 0.20/0.51 % (16136)Time elapsed: 0.090 s
% 0.20/0.51 % (16136)Instructions burned: 4 (million)
% 0.20/0.51 % (16136)------------------------------
% 0.20/0.51 % (16136)------------------------------
% 0.20/0.51 % (16130)Success in time 0.142 s
%------------------------------------------------------------------------------