TSTP Solution File: SWC094+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC094+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 : n009.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:47:09 EDT 2024
% Result : Theorem 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 192 ( 86 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 248 ( 90 ~; 71 |; 73 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 85 ( 55 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f978,plain,
$false,
inference(resolution,[],[f977,f390]) ).
fof(f390,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f977,plain,
~ ssList(nil),
inference(resolution,[],[f975,f636]) ).
fof(f636,plain,
ssList(sK18),
inference(forward_demodulation,[],[f377,f633]) ).
fof(f633,plain,
sK18 = sK21,
inference(backward_demodulation,[],[f380,f379]) ).
fof(f379,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK19
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK20 = sK21
& 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] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK19
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK19
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK19
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK20 = X3
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK19
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK20 = X3
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK19
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK20 = sK21
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& 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] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| 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] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f380,plain,
sK20 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f377,plain,
ssList(sK21),
inference(cnf_transformation,[],[f254]) ).
fof(f975,plain,
( ~ ssList(sK18)
| ~ ssList(nil) ),
inference(trivial_inequality_removal,[],[f974]) ).
fof(f974,plain,
( sK18 != sK18
| ~ ssList(sK18)
| ~ ssList(nil) ),
inference(superposition,[],[f971,f662]) ).
fof(f662,plain,
sK18 = app(nil,sK18),
inference(resolution,[],[f453,f636]) ).
fof(f453,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f971,plain,
! [X0] :
( app(nil,X0) != sK18
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f969]) ).
fof(f969,plain,
! [X0] :
( app(nil,X0) != sK18
| app(nil,X0) != sK18
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(superposition,[],[f635,f639]) ).
fof(f639,plain,
nil = app(nil,nil),
inference(resolution,[],[f452,f390]) ).
fof(f452,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f635,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK18
| app(X4,X6) != sK18
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f381,f634]) ).
fof(f634,plain,
sK18 = sK19,
inference(forward_demodulation,[],[f378,f633]) ).
fof(f378,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f381,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK19
| app(app(X4,X5),X6) != sK18
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC094+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n009.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 : Sun May 19 02:40:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % (13560)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (13565)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.13/0.36 % (13562)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37 % (13567)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.13/0.37 % (13566)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.13/0.38 % (13561)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.38 % (13564)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.38 % (13563)WARNING: value z3 for option sas not known
% 0.20/0.38 % (13563)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.20/0.39 % (13566)First to succeed.
% 0.20/0.39 % (13566)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13560"
% 0.20/0.39 % (13566)Refutation found. Thanks to Tanya!
% 0.20/0.39 % SZS status Theorem for theBenchmark
% 0.20/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.39 % (13566)------------------------------
% 0.20/0.39 % (13566)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.39 % (13566)Termination reason: Refutation
% 0.20/0.39
% 0.20/0.39 % (13566)Memory used [KB]: 1574
% 0.20/0.39 % (13566)Time elapsed: 0.022 s
% 0.20/0.39 % (13566)Instructions burned: 43 (million)
% 0.20/0.39 % (13560)Success in time 0.046 s
%------------------------------------------------------------------------------