TSTP Solution File: SWC051+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC051+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.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 : Tue May 21 04:41:07 EDT 2024
% Result : Theorem 0.15s 0.34s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 239 ( 54 equ)
% Maximal formula atoms : 32 ( 8 avg)
% Number of connectives : 320 ( 110 ~; 89 |; 108 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 51 ( 25 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f648,plain,
$false,
inference(resolution,[],[f647,f376]) ).
fof(f376,plain,
ssList(sK20),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ( ( rearsegP(sK21,sK20)
& neq(sK20,nil) )
| ~ neq(sK21,nil) )
& ( nil != sK21
| nil = sK20 )
& ! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f99,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK20)
& neq(sK20,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK20 )
& ! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK20)
& neq(sK20,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK20 )
& ! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK21,sK20)
& neq(sK20,nil) )
| ~ neq(sK21,nil) )
& ( nil != sK21
| nil = sK20 )
& ! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& 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)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f647,plain,
~ ssList(sK20),
inference(resolution,[],[f646,f638]) ).
fof(f638,plain,
neq(sK21,nil),
inference(forward_demodulation,[],[f380,f378]) ).
fof(f378,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f380,plain,
neq(sK19,nil),
inference(cnf_transformation,[],[f254]) ).
fof(f646,plain,
( ~ neq(sK21,nil)
| ~ ssList(sK20) ),
inference(resolution,[],[f645,f384]) ).
fof(f384,plain,
( rearsegP(sK21,sK20)
| ~ neq(sK21,nil) ),
inference(cnf_transformation,[],[f254]) ).
fof(f645,plain,
( ~ rearsegP(sK21,sK20)
| ~ ssList(sK20) ),
inference(duplicate_literal_removal,[],[f644]) ).
fof(f644,plain,
( ~ ssList(sK20)
| ~ rearsegP(sK21,sK20)
| ~ ssList(sK20) ),
inference(resolution,[],[f643,f454]) ).
fof(f454,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f643,plain,
( ~ rearsegP(sK20,sK20)
| ~ ssList(sK20)
| ~ rearsegP(sK21,sK20) ),
inference(resolution,[],[f642,f638]) ).
fof(f642,plain,
( ~ neq(sK21,nil)
| ~ rearsegP(sK21,sK20)
| ~ ssList(sK20)
| ~ rearsegP(sK20,sK20) ),
inference(resolution,[],[f637,f383]) ).
fof(f383,plain,
( neq(sK20,nil)
| ~ neq(sK21,nil) ),
inference(cnf_transformation,[],[f254]) ).
fof(f637,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK20,X4)
| ~ rearsegP(sK21,X4)
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f636,f378]) ).
fof(f636,plain,
! [X4] :
( ~ rearsegP(sK20,X4)
| ~ rearsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f381,f379]) ).
fof(f379,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f381,plain,
! [X4] :
( ~ rearsegP(sK18,X4)
| ~ rearsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWC051+1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.09/0.30 % Computer : n010.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 02:48:23 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % (610)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32 % (613)WARNING: value z3 for option sas not known
% 0.15/0.32 % (613)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.32 % (617)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.32 % (616)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.33 % (615)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.33 % (611)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.33 % (616)First to succeed.
% 0.15/0.33 % (616)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-610"
% 0.15/0.34 % (616)Refutation found. Thanks to Tanya!
% 0.15/0.34 % SZS status Theorem for theBenchmark
% 0.15/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.34 % (616)------------------------------
% 0.15/0.34 % (616)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.34 % (616)Termination reason: Refutation
% 0.15/0.34
% 0.15/0.34 % (616)Memory used [KB]: 1316
% 0.15/0.34 % (616)Time elapsed: 0.012 s
% 0.15/0.34 % (616)Instructions burned: 21 (million)
% 0.15/0.34 % (610)Success in time 0.03 s
%------------------------------------------------------------------------------